Nonlinearity bounds and constructions of resilient Boolean functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1880, Issue , 2000, Pages 515-532

  Sarkar, Palash ^a   Maitra, Subhamoy ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Algebraic degree; Balancedness; Boolean functions; Combinatorial cryptography; Correlation immunity; Nonlinearity; Resiliency; Stream ciphers

Indexed keywords

CRYPTOGRAPHY; ECONOMIC AND SOCIAL EFFECTS; FORWARD ERROR CORRECTION;

ALGEBRAIC DEGREES; BALANCEDNESS; CORRELATION IMMUNITY; NONLINEARITY; RESILIENCY; STREAM CIPHERS;

BOOLEAN FUNCTIONS;

EID: 84969396978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_32     Document Type: Conference Paper

References (24)

1. P. Camion, C. Carlet, P. Charpin, and N. Sendrier. On correlation immune functions. In Advances in Cryptology-CRYPTO’91, pages 86-100. Springer-Verlag, 1992.
2. C. Carlet. More correlation immune and resilient functions over Galois fields and Galois rings. In Advances in Cryptology-EUROCRYPT’97, pages 422-433. Springer-Verlag, May 1997.
3. S. Chee, S. Lee, D. Lee, and S. H. Sung. On the correlation immune functions and their nonlinearity. In Advances in Cryptology, Asiacrypt 96, number 1163 in Lecture Notes in Computer Science, pages 232-243. Springer-Verlag, 1996.
4. C. Ding, G. Xiao, and W. Shan. The Stability Theory of Stream Ciphers. Number 561 in Lecture Notes in Computer Science. Springer-Verlag, 1991.
5. E. Filiol and C. Fontaine. Highly nonlinear balanced Boolean functions with a good correlation-immunity. In Advances in Cryptology-EUROCRYPT’98. Springer-Verlag, 1998.
6. X. Guo-Zhen and J. Massey. A spectral characterization of correlation immune combining functions. IEEE Transactions on Information Theory, 34(3):569-571, May 1988.
7. X. Hou. Covering radius of the Reed-Muller code R(1, 7)-a simpler proof. Journal of Combinatorial Theory, Series A, 74(3):337-341, 1996.
8. X. Hou. On the covering radius of R(1,m) in R(3,m). IEEE Transactions on Information Theory, 42(3):1035-1037, 1996.
9. X. Hou. On the norm and covering radius of the first order Reed-Muller codes. IEEE Transactions on Information Theory, 43(3):1025-1027, 1997.
10. T. Johansson and F. Jonsson. Fast correlation attacks based on turbo code techniques. In Advances in Cryptology-CRYPTO’99, number 1666 in Lecture Notes in Computer Science, pages 181-197. Springer-Verlag, August 1999.
11. T. Johansson and F. Jonsson. Improved fast correlation attacks on stream ciphers via convolutional codes. In Advances in Cryptology-EUROCRYPT’99, number 1592 in Lecture Notes in Computer Science, pages 347-362. Springer-Verlag, May 1999.
12. F. J. MacWillams and N. J. A. Sloane. The Theory of Error Correcting Codes. NorthHolland, 1977.
13. S. Maitra and P. Sarkar. Highly nonlinear resilient functions optimizing Siegenthaler’s inequality. In Advances in Cryptology-CRYPTO’99, number 1666 in Lecture Notes in Computer Science, pages 198-215. Springer Verlag, August 1999.
14. W. Meier and O. Staffelbach. Fast correlation attack on stream ciphers. In Advances in Cryptology-EUROCRYPT’88, volume 330, pages 301-314. Springer-Verlag, May 1988.
15. S. Palit and B. K. Roy. Cryptanalysis of LFSR-encrypted codes withunkno wn combining functions. In Advances in Cryptology-ASIACRYPT’99, number 1716 in Lecture Notes in Computer Science, pages 306-320. Springer Verlag, November 1999.
16. E. Pasalic and T. Johansson. Further results on the relation between nonlinearity and resiliency of Boolean functions. In IMA Conference on Cryptography and Coding, number 1746 in Lecture Notes in Computer Science, pages 35-45. Springer-Verlag, 1999.
17. R. A. Rueppel. Analysis and Design of Stream Ciphers. Springer Verlag, 1986.
18. R. A. Rueppel and O. J. Staffelbach. Products of linear recurring sequences with maximum complexity. IEEE Transactions on Information Theory, IT-33:124-131, January 1987.
19. P. Sarkar and S. Maitra. Construction of nonlinear Boolean functions withimp ortant cryptographic properties. In Advances in Cryptology-EUROCRYPT 2000, number 1807 in Lecture Notes in Computer Science, pages 491-512. Springer Verlag, 2000.
20. J. Seberry, X. M. Zhang, and Y. Zheng. Nonlinearly balanced Boolean functions and their propagation characteristics. In Advances in Cryptology-CRYPTO’93, pages 49-60. Springer-Verlag, 1994.
21. J. Seberry, X. M. Zhang, and Y. Zheng. On constructions and nonlinearity of correlation immune Boolean functions. In Advances in Cryptology-EUROCRYPT’93, pages 181-199. Springer-Verlag, 1994.
22. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, IT-30(5):776-780, September 1984.
23. T. Siegenthaler. Decrypting a class of stream ciphers using ciphertext only. IEEE Transactions on Computers, C-34(1):81-85, January 1985.
24. Y. V. Tarannikov. On resilient Boolean functions withmaxim um possible nonlinearity. Cryptology ePrint Archive, eprint.iacr.org, No. 2000/005, 2000.