Designing bent functions and resilient functions from known ones, without extending their number of variables

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005-January, Issue , 2005, Pages

  Carlet, Claude ^a  

^a INRIA   (France)

Author keywords

Algebraic Degree; Algebraic immunity; Bentness; Boolean Function; Nonlinearity; Resiliency

Indexed keywords

INFORMATION THEORY;

ALGEBRAIC IMMUNITY; BENT FUNCTION; BOOLEAN BENT-FUNCTIONS; RESILIENT FUNCTION;

BOOLEAN FUNCTIONS;

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

References (15)

1. 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.
2. C. Carlet, (1995). Generalized Partial Spreads, IEEE Transactions on Information Theory, vol 41, number 5, 1482-1487.
3. C. Carlet. Recent results on binary bent functions. International Conference on Combinatorics, Information Theory and Statistics; Journal of Combinatorics, Information and System Sciences, Vol. 24, Nos. 3-4, pp. 275-291 (1999)
4. 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.
5. C. Carlet. On the secondary constructions of resilient and bent functions. Proceedings of the Workshop on Coding, Cryptography and Combinatorics 2003, published by Birkhäuser Verlag, K. Feng, H. Niederreiter and C. Xing Eds., pp. 3-28, 2004.
6. C. Carlet. Improving the algebraic immunity of resilient and nonlinear functions and constructing bent functions. Preprint. http://eprint.iacr.org/, 2004.
7. C. Carlet and P. Gaborit. On the construction of balanced Boolean functions with a good algebraic immunity. Proceedings of ISIT'2005.
8. C. Carlet and J.L. Yucas. Piecewise Constructions of Bent and Almost Optimal Boolean Functions. To appear in Designs, Codes and Cryptography, 2005.
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. F. J. Mac Williams and N. J. Sloane (1977). The theory of errorcorrecting codes, Amsterdam, North Holland.
11. 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.
12. E. Pasalic, T. Johansson, S. Maitra and P. Sarkar. New constructions of resilient and correlation immune Boolean functions achieving upper bounds on nonlinearity. Proceedings of the Workshop on Coding and Cryptography 2001, published by Electronic Notes in Discrete Mathematics, Elsevier, vo. 6, pp. 425-434, 2001.
13. O. S. Rothaus. On "bent" functions. J. Comb. Theory, 20A, pp. 300-305, 1976.
14. 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).
15. Y. V. Tarannikov. On resilient Boolean functions with maximum possible nonlinearity. Proceedings of INDOCRYPT 2000, Lecture Notes in Computer Science 1977, pp. 19-30, 2000.