On relationships among avalanche, nonlinearity, and correlation immunity

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

Volumn 1976, Issue , 2000, Pages 470-482

  Zheng, Yuliang ^a   Zhang, Xian Mo ^b  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

AVALANCHE PROPERTIES; CORRELATION IMMUNITY; LOWER BOUNDS; NEW RESULTS;

BOOLEAN FUNCTIONS;

EID: 84937399833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_36     Document Type: Conference Paper

References (26)

1. E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, Vol. 4, No. 1:3–72, 1991.
2. P. Camion, C. Carlet, P. Charpin, and N. Sendrier. On correlation-immune functions. In Advances in Cryptology -CRYPTO’91, volume 576 of Lecture Notes in Computer Science, pages 87–100. Springer-Verlag, Berlin, Heidelberg, New York, 1991.
3. C. Carlet and P. Codes. On the propagation criterion of degree l and order k. In Advances in Cryptology -EUROCRYPT’98, volume 1403 of Lecture Notes in Computer Science, pages 462–474. Springer-Verlag, Berlin, Heidelberg, New York, 1998.
4. Claude Carlet. Partially-bent functions. Designs, Codes and Cryptography, 3:135–145, 1993.
5. D. Coppersmith. The development of DES, 2000. (Invited talk at CRYPTO2000).
6. H. Feistel. Cryptography and computer privacy. Scientific American, 228(5):15–23, 1973.
7. Xiao Guo-Zhen and J. L. Massey. A spectral characterization of correlationimmune combining functions. IEEE Transactions on Information Theory, 34(3):569–571, 1988.
8. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, New York, Oxford, 1978.
9. M. Matsui. Linear cryptanalysis method for DESc ipher. In Advances in Cryptology -EUROCRYPT’93, volume 765 of Lecture Notes in Computer Science, pages 386–397. Springer-Verlag, Berlin, Heidelberg, New York, 1994.
10. W. Meier and O. Staffelbach. Nonlinearity criteria for cryptographic functions. In Advances in Cryptology -EUROCRYPT’89, volume 434 of Lecture Notes in Computer Science, pages 549–562. Springer-Verlag, Berlin, Heidelberg, New York, 1990
11. K. Nyberg. On the construction of highly nonlinear permutations. In Advances in Cryptology -EUROCRYPT’92, volume 658 of Lecture Notes in Computer Science, pages 92–98. Springer-Verlag, Berlin, Heidelberg, New York, 1993.
12. B. Preneel, W. V. Leekwijck, L. V. Linden, R. Govaerts, and J. Vandewalle. Propagation characteristics of boolean functions. In Advances in Cryptology -EUROCRYPT’ 90, volume 437 of Lecture Notes in Computer Science, pages 155–165. Springer-Verlag, Berlin, Heidelberg, New York, 1991.
13. O. S. Rothaus. On “bent” functions. Journal of Combinatorial Theory, S er. A, 20:300–305, 1976.
14. J. Seberry, X. M. Zhang, and Y. Zheng. On constructions and nonlinearity of correlation immune functions. In Advances in Cryptology -EUROCRYPT’93, volume 765 of Lecture Notes in Computer Science, pages 181–199. Springer-Verlag, Berlin, Heidelberg, New York, 1994.
15. J. Seberry, X. M. Zhang, and Y. Zheng. Nonlinearity and propagation characteristics of balanced boolean functions. Information and Computation, 119(1):1–13, 1995.
16. C. E. Shannon. Communications theory of secrecy system. Bell Sys. Tech. Journal, Vol. 28:656–751, 1949.
17. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, IT-30 No. 5:776–779, 1984.
18. A. F. Webster and S. E. Tavares. On the design of S-boxes. In Advances in Cryptology -CRYPTO’85, volume 219 of Lecture Notes in Computer Science, pages 523–534. Springer-Verlag, Berlin, Heidelberg, New York, 1986.
19. R. Yarlagadda and J. E. Hershey. Analysis and synthesis of bent sequences. IEE Proceedings (Part E), 136:112–123, 1989.
20. X. M. Zhang and Y. Zheng. Auto-correlations and new bounds on the nonlinearity of boolean functions. In Advances in Cryptology -EUROCRYPT’96, volume 1070 of Lecture Notes in Computer Science, pages 294–306. Springer-Verlag, Berlin, Heidelberg, New York, 1996.
21. X. M. Zhang and Y. Zheng. Characterizing the structures of cryptographic functions satisfying the propagation criterion for almost all vectors. Design, Codes and Cryptography, 7(1/2):111–134, 1996. special issue dedicated to Gus Simmons.
22. X. M. Zhang and Y. Zheng. Cryptographically resilient functions. IEEE Transactions on Information Theory, 43(5):1740–1747, 1997.
23. X. M. Zhang and Y. Zheng. On plateaued functions. IEEE Transactions on Information Theory, 2000. (accepted).
24. Y. Zheng and X. M. Zhang. Plateaued functions. In Advances in Cryptology -ICICS’99, volume 1726 of Lecture Notes in Computer Science, pages 284–300. Springer-Verlag, Berlin, Heidelberg, New York, 1999.
25. Y. Zheng and X. M. Zhang. Improved upper bound on the nonlinearity of high order correlation immune functions. In Selected Areas in Cryptography, 7th Annual International Workshop, SAC2000, volume xxxx of Lecture Notes in Computer Science, pages xxx–xxx. Springer-Verlag, Berlin, Heidelberg, New York, 2000. now in Preceedings pages 258-269.
26. Y. Zheng and X. M. Zhang. Strong linear dependence and unbiased distribution of non-propagative vectors. In Selected Areas in Cryptography, 6th Annual International Workshop, SAC’99, volume 1758 of Lecture Notes in Computer Science, pages 92–105. Springer-Verlag, Berlin, Heidelberg, New York, 2000.