Cross-correlation analysis of cryptographically useful Boolean functions and S-boxes

Theory of Computing Systems

Volumn 35, Issue 1, 2002, Pages 39-57

  Sarkar, P ^a   Maitra, S ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; COMPUTER SCIENCE;

STREAM CIPHERS;

CRYPTOGRAPHY;

EID: 0036005143     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-001-1019-1     Document Type: Article

References (20)

1. A. Canteaut, C. Carlet, P. Charpin and C. Fontaine. Propagation characteristics and correlation-immunity of highly non-linear Boolean functions. In Advances in Cryptology - Eurocrypt 2000, pages 507-522. Number 1807 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2000.
2. C. Carlet. Partially-bent functions. In Advances in Cryptology - CRYPTO '92, pages 280-291. Number 740 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1992.
3. T. W. Cusick. Boolean functions satisfying a higher order strict avalanche criteria. Advances in Cryptology - Eurocrypt '93, pages 102-117.
4. T. W. Cusick. Bounds on the number of functions satisfying the strict avalanche criteria. Information Processing Letter, 57(5):261-263 (1996).
5. L. E. Dickson. History of the Theory of Numbers, volume II. Chelsea, New York, 1919.
6. C. Ding, G. Xiao and W. Shan. The Stability Theory of Stream Ciphers. Number 561 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1991.
7. T. Johansson and E. Pasalic. A construction of resilient functions with high nonlinearity. International Symposium on Information Theory, ISIT 2000.
8. 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, pages 434-449. Number 1233 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1997.
9. F. J. MacWillams and N. J. A. Sloane. The Theory of Error Correcting Codes. North-Holland, Amsterdam, 1977.
10. E. Pasalic, S. Maitra, T. Johansson and P. Sarkar. New constructions of resilent and correlation immune Boolean functions achieving upper bounds on nonlinearity. In Proceedings of the Workshop on Cryptography and Coding Theory, Paris. 2001. Electronic Notes in Discrete Mathematics, Volume 6, Elsevier, Amsterdam. 2000.
11. B. Preneel. Analysis and design of cryptographic hash functions. Doctoral dissertation, K.U. Leuven, 1993.
12. O. S. Rothaus. On bent functions. Journal of Combinatorial Theory, Series A, 20:300-305, 1976.
13. P. Sarkar and S. Maitra. Nonlinearity bounds and constructions of resilient Boolean functions. In Advances in Cryptology - CRYPTO 2000, pages 515-532. Number 1880 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2000.
14. C. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28:656-715, 1949.
15. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, IT-30(5):776-780, September 1984.
16. Y. V. Tarannikov. On resilient Boolean functions with maximum possible nonlinearity. Proceedings of INDOCRYPT. pages 19-30. Number 1977 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2000.
17. G. Xiao and J. L. Massey. A spectral characterization of correlation-immune combining functions. IEEE Transactions on Information Theory, 34(3):569-571, 1988.
18. M. Zhang. Maximum correlation analysis of nonlinear combining functions in stream ciphers. Journal of Cryptology, 13:301-313, 2000.
19. M. Zhang and A. Chan. Maximum correlation analysis of nonlinear S-boxes in stream ciphers. In Advances in Cryptology - CRYPTO 2000, pages 501-514. Number 1880 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2000.
20. X.-M. Zhang and Y. Zheng, GAC-the criterion for global avalanche characteristics of cryptographic functions. Journal for Universal Computer Science, 1(5):316-333, 1995.