Construction of nonlinear boolean functions with important cryptographic properties

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

Volumn 1807, Issue , 2000, Pages 485-506

  Sarkar, Palash ^a   Maitra, Subhamoy ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CONTROL NONLINEARITIES;

ALGEBRAIC DEGREES; CRYPTOGRAPHIC PROPERTIES; HIGH NONLINEARITY; NEW CONSTRUCTIONS; POSITIVE INTEGERS; PROPAGATION CHARACTERISTICS; RESILIENT FUNCTION; STRICT AVALANCHE CRITERION;

CRYPTOGRAPHY;

EID: 84948968383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_35     Document Type: Conference Paper

References (18)

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. 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.
3. H. Dobbertin. Construction of bent functions and balanced Boolean functions with high nonlinearity. In Fast Software Encryption, number 1008 in Lecture Notes in Computer Science, pages 61-74. Springer-Verlag, 1994.
4. E. Filiol and C. Fontaine. Highly nonlinear balanced Boolean functions with a good correlation-immunity. In Advances in Cryptology - EUROCRYPT’98. Springer-Verlag, 1998.
5. 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.
6. K. Kurosawa and T. Satoh. Design of SAC/PC(l) of order k Boolean functions and three other cryptographic criteria. In Advances in Cryptology - EUROCRYPT’97, Lecture Notes in Computer Science, pages 434-449. Springer-Verlag, 1997.
7. S. Maitra and P. Sarkar. Highly nonlinear resilient functions optimizing Siegen-thaler’s inequality. In Advances in Cryptology - CRYPTO’99, number 1666 in Lecture Notes in Computer Science, pages 198-215. Springer Verlag, August 1999.
8. 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.
9. N. J. Patterson and D. H. Wiedemann. Correction to - the covering radius of the (215; 16) Reed-Muller code is at least 16276. IEEE Transactions on Information Theory, IT-36(2): 443, 1990.
10. B. Preneel, W. Van Leekwijck, L. Van Linden, R. Govaerts, and J. Vandewalle. Propagation characteristics of Boolean functions. In Advances in Cryptology -EUROCRYPT’90, Lecture Notes in Computer Science, pages 161-173. Springer-Verlag, 1991.
11. O. S. Rothaus. On bent functions. Journal of Combinatorial Theory, Series A, 20: 300-305, 1976.
12. P. Sarkar and S. Maitra. Construction of nonlinear resilient Boolean functions. Indian Statistical Institute, Technical Report No. ASD/99/30, November 1999.
13. P. Sarkar and S. Maitra. Highly nonlinear balanced Boolean functions with important cryptographic properties. Indian Statistical Institute, Technical Report No. ASD/99/31, November 1999.
14. 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.
15. 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.
16. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, IT-30(5): 776-780, September 1984.
17. T. Siegenthaler. Decrypting a class of stream ciphers using ciphertext only. IEEE Transactions on Computers, C-34(1): 81-85, January 1985.
18. Y. V. Tarannikov. On a method for the constructing of cryptographically strong Boolean functions. Moscow State University, French-Russian Institute of Applied Mathematics and Informatics, Preprint No. 6, October 1999.