Minimum distance between bent and 1-resilient Boolean functions

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

Volumn 3017, Issue , 2004, Pages 143-160

  Maity, Soumen ^a   Maitra, Subhamoy ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Autocorrelation; Bent Function; Boolean Function; Nonlinearity; Resiliency

Indexed keywords

AUTOCORRELATION;

BENT FUNCTION; COMBINATORIAL ANALYSIS; INPUT VARIABLES; LOW AUTOCORRELATION; MINIMUM DISTANCE; NONLINEARITY; RESILIENCY; TRIAL AND ERROR;

BOOLEAN FUNCTIONS;

EID: 35048899286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25937-4_10     Document Type: Article

References (23)

1. C. Carlet. On the coset weight divisibility and nonlinearity of resilient and correlation immune functions. In Sequences and Their Applications - SETA 2001, Discrete Mathematics and Theoretical Computer Science, pages 131-144. Springer Verlag, 2001.
2. C. Carlet. A larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Constructions. In Advances in Cryptology - CRYPTO 2002, number 2442 in Lecture Notes in Computer Science, pages 549-564. Springer Verlag, 2002.
3. C. Carlet and P. Sarkar. Spectral domain analysis of correlation immune and resilient Boolean functions. Finite Fields and Its Applications, 8(1):120-130, January 2002.
4. P. Charpin and E. Pasalic. On Propagation Characteristics of Resilient Functions. In SAC 2002, number 2595 in Lecture Notes in Computer Science, pages 175-195. Springer-Verlag, 2003.
5. J. Clark, J. Jacob, S. Stepney, S. Maitra and W. Millan. Evolving Boolean Functions Satisfying Multiple Criteria. In INDOCRYPT 2002, Volume 2551 in Lecture Notes in Computer Science, pages 246-259, Springer Verlag, 2002.
6. J. F. Dillon. Elementary Hadamard Difference sets. PhD Thesis, University of Maryland, 1974.
7. 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.
8. M. Fedorova and Y. V. Tarannikov. On the constructing of highly nonlinear resilient Boolean functions by means of special matrices. In Progress in Cryptology - INDOCRYPT 2001, number 2247 in Lecture Notes in Computer Science, pages 254-266. Springer Verlag, 2001.
9. 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.
10. S. Maitra and E. Pasalic. Further constructions of resilient Boolean functions with very high nonlinearity. IEEE Transactions on Information Theory, 48(7):1825-1834, July 2002.
11. S. Maitra. Autocorrelation Properties of correlation immune Boolean functions. INDOCRYPT 2001, number 2247 Lecture Notes in Computer Science. Pages 242-253. Springer Verlag, December 2001.
12. S. Maity and T. Johansson. Construction of Cryptographically Important Boolean Functions. In INDOCRYPT 2002, Volume 2551 in Lecture Notes in Computer Science, pages 234-245, Springer Verlag, 2002.
13. 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.
14. O. S. Rothaus. On bent functions. Journal of Combinatorial Theory, Series A, 20:300-305, 1976.
15. P. Sarkar and S. Maitra. Construction of nonlinear Boolean functions with important cryptographic properties. In Advances in Cryptology - EUROCRYPT 2000, number 1807 in Lecture Notes in Computer Science, pages 485-506. Springer Verlag, 2000.
16. P. Sarkar and S. Maitra. Nonlinearity bounds and constructions of resilient Boolean functions. In Advances in Cryptology - CRYPTO 2000, number 1880 in Lecture Notes in Computer Science, pages 515-532. Springer Verlag, 2000.
17. 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.
18. Y. V. Tarannikov. On resilient Boolean functions with maximum possible nonlinearity. In Progress in Cryptology - INDOCRYPT 2000, number 1977 in Lecture Notes in Computer Science, pages 19-30. Springer Verlag, 2000.
19. Y. V. Tarannikov. New constructions of resilient Boolean functions with maximal nonlinearity. In Fast Software Encryption - FSE 2001, to be published in Lecture Notes in Computer Science, pages 70-81 (in preproceedings). Springer Verlag, 2001.
20. Y. V. Tarannikov, P. Korolev and A. Botev. Autocorrelation coefficients and correlation immunity of Boolean functions. In ASIACRYPT 2001, Lecture Notes in Computer Science. Springer Verlag, 2001.
21. Y. Zheng and X. M. Zhang. Improved upper bound on the nonlinearity of high order correlation immune functions. In Selected Areas in Cryptography - SAC 2000, number 2012 in Lecture Notes in Computer Science, pages 264-274. Springer Verlag, 2000.
22. X. M. Zhang and Y. Zheng. GAC - the criterion for global avalanche characteristics of cryptographic functions. Journal of Universal Computer Science, 1(5):316-333, 1995.
23. Y. Zheng and X. M. Zhang. On relationships among propagation degree, nonlinearity and correlation immunity. In Advances in Cryptology - ASIACRYPT'00, Lecture Notes in Computer Science. Springer Verlag, 2000.