On the construction of balanced Boolean functions with a good algebraic immunity

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005-January, Issue , 2005, Pages

  Carlet, Claude ^a,b   Gaborit, Philippe ^c  

^a INRIA   (France)

^b UNIVERSITÉ PARIS 8   (France)

^c UNIVERSITY OF LIMOGES   (France)

Author keywords

Algebraic attacks; Algebraic degree; Boolean function; Nonlinearity; Resiliency; Stream ciphers

Indexed keywords

INFORMATION THEORY;

ALGEBRAIC IMMUNITY; BALANCED FUNCTIONS; GOOD CORRELATIONS; HIGH PROBABILITY; UPPER BOUND;

BOOLEAN FUNCTIONS;

EID: 85114373023     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523510     Document Type: Conference Paper

References (21)

1. J. Blomer, R. Karp and E. Welzl, The rank of sparse random matrices over finite fields, Random Structures Algorithms 10 (1997), no. 4, pp. 407-419.
2. A. Botev and Y. Tarannikov. Lower bounds on algebraic immunity for recursive constructions of nonlinear filters. Preprint 2004.
3. P. Camion, C. Carlet, P. Charpin, N. Sendrier, On correlation-immune functions, Advances in Cryptology: Crypto'91, Proceedings, Lecture Notes in Computer Science, V. 576 (1991), pp. 86-100.
4. m) and crosscorrelation of maximum-length sequences. SIAM Journal on Discrete Mathematics, 13(1), pp. 105-138, 2000.
5. C. Carlet. A larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction. Advances in Cryptology - CRYPT0 2002, no. 2442 in Lecture Notes in Computer Science, pp. 549-564, 2002.
6. C. Carlet. Designing bent functions and resilient functions from known ones, without extending their number of variables. Proceedings of ISIT 2005.
7. C. Carlet and E. Prouff. On plateaued functions and their constructions. Proceedings of Fast Software Encryption 2003, Lecture notes in computer science 2887, pp. 54-73, 2003.
8. C. Cooper, On the rank of random matrices, Random Structures Algorithms 16 (2000), no. 2, pp. 209-232.
9. N. Courtois and W. Meier. Algebraic Attacks on Stream Ciphers with Linear Feedback. Advances in cryptology-EUROCRYPT 2003, Lecture Notes in Computer Science 2656, pp. 346-359, Springer, 2002.
10. N. Courtois and J. Pieprzyk. Cryptanalysis of block ciphers with overdefined systems of equations. Advances in cryptology-ASIACRYPT 2002, Lecture Notes in Computer Science 2501, pp. 267-287, Springer, 2003.
11. D. K. Dalai, K. C. Gupta and S. Maitra. Results on Algebraic Immunity for Cryptographically Significant Boolean Functions. Indocrypt 2004, number 3348 in Lecture Notes in Computer Science, Springer Verlag, pp. 92-106, 2004
12. D. K. Dalai, K. C. Gupta and S. Maitra. Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity. Proceedings of FSE 2005. To appear in LNCS.
13. W. Meier, E. Pasalic and C. Carlet. Algebraic attacks and decomposition of Boolean functions. Advances in Cryptology, EUROCRYPT 2004, Lecture Notes in Computer Science, Springer Verlag 3027, pp. 474-491, 2004.
14. K. Nyberg. Perfect non-linear S-boxes, Advances in Cryptology, EUROCRYPT' 91, Springer Verlag, Lecture Notes in Computer Science 547, pp. 378-386, 1992.
15. D. Olejár and M. Stanek.”On cryptographic properties of random Boolean functions.” Journal of Universal Computer Science, vol. 4, No.8, pp. 705-717, 1998.
16. P. Sarkar and S. Maitra. Construction of nonlinear Boolean functions with important cryptographic properties. Advances in Cryptology - EUROCRYPT 2000, no. 1807 in Lecture Notes in Computer Science, Springer Verlag, pp. 485-506, 2000.
17. P. Sarkar and S. Maitra, Nonlinearity Bounds and Constructions of Resilient Boolean Functions. CRYPTO 2000, LNCS Vol. 1880, ed. Mihir Bellare, pp. 515-532 (2000).
18. N. Sendrier. On the dimension of the hull. SIAM J. Discrete Math. Vol. 10, pp. 282-293, 1997.
19. J. Seberry, X.M. Zhang and Y. Zheng. “On constructions and nonlinearity of correlation immune Boolean functions.” Advances in Cryptology - EUROCRYPT'93, LNCS 765, pp. 181-199 (1994).
20. 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.
21. E. Welzl, Rank of random matrices over GF(2), preprint available at http://www.inf.ethz.ch/personal/emo/SmallPieces.html