| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Efficient Implementation of Cryptographically Useful 'Large' Boolean Functions
April 2003 (vol. 52 no. 4)
pp. 410-417
Abstract—We present low cost hardware architecture for implementing state-of-the-art theoretical constructions of secure Boolean functions suitable for stream ciphers. Using a pipelined architecture, we show that it is possible to implement systems which use Boolean functions of a relatively large number of variables. Our architecture is reconfigurable and provide a universal circuit for a certain class of secure Boolean functions.
[1] 410 P. Camion, C. Carlet, P. Charpin, and N. Sendrier, “On Correlation Immune Functions,” Proc. Advances in Cryptology—CRYPTO '91, pp. 86-100, 1992.[2] A. Canteaut and M. Trabbia, “Improved Fast Correlation Attacks Using Parity Checks Equations of Weight 4 and 5,” Proc. Advances in Cryptology—EUROCRYPT 2000, pp. 573-588, 2000.[3] V. Chepysov, T. Johansson, and B. Smeets, “A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers,” Proc. Fast Software Encryption—FSE 2000, pp. 181-195, 2001.[4] T. Johansson and F. Jonsson, “Fast Correlation Attacks through Reconstruction of Linear Polynomials,” Proc. Advances in Cryptology—CRYPTO 2000, pp. 300-315, 2000.[5] S. Maitra and P. Sarkar, “Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality,” Proc. Advances in Cryptology—CRYPTO '99, pp. 198-215, 1999.[6] W. Meier and O. Stafflebach, “Fast Correlation Attacks on Certain Stream Ciphers,” J. Cryptology, vol. 1, pp. 159-176, 1989.[7] E. Pasalic, S. Maitra, T. Johansson, and P. Sarkar, “New Constructions of Correlation Immune and Resilient Boolean Functions Achieving Upper Bounds on Nonlinearity,” Proc. Workshop Coding and Cryptography—WCC 2001, 2001.[8] R.A. Rueppel, Analysis and Design of Stream Ciphers. Springer-Verlag, 1986.[9] P. Sarkar and S. Maitra, “Construction of Nonlinear Boolean Functions with Important Cryptographic Properties,” Proc. Advances in Cryptology—EUROCRYPT 2000, pp. 491-512, 2000.[10] P. Sarkar and S. Maitra, “Nonlinearity Bounds and Constructions of Resilient Boolean Functions,” Proc. Advances in Cryptology—CRYPTO 2000, pp. 515-532, 2000.[11] J. Seberry, X.M. Zhang, and Y. Zheng, “On Constructions and Nonlinearity of Correlation Immune Boolean Functions,” Proc. Advances in Cryptology—EUROCRYPT '93, pp. 181-199, 1994.[12] T. Siegenthaler, “Correlation-Immunity of Nonlinear Combining Functions for Cryptographic Applications,” IEEE Trans. Information Theory, vol. 30, no. 5, pp. 776-780, Sept. 1984.[13] T. Siegenthaler, “Decrypting a Class of Stream Ciphers Using Ciphertext Only,” IEEE Trans. Computers, vol. 34, no. 1, pp. 81-85, Jan. 1985.[14] Y.V. Tarannikov, “On Resilient Boolean Functions with Maximum Possible Nonlinearity,” Proc. INDOCRYPT 2000, pp. 19-30, 2000.
Index Terms:
Boolean function, cryptography, pipelined architecture, reconfigurable hardware, stream cipher.
Citation:
Palash Sarkar, Subhamoy Maitra, "Efficient Implementation of Cryptographically Useful 'Large' Boolean Functions," IEEE Transactions on Computers, vol. 52, no. 4, pp. 410-417, Apr. 2003, doi:10.1109/TC.2003.1190582
