On bent and highly nonlinear balanced/resilient functions and their algebraic immunities

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

Volumn 3857 LNCS, Issue , 2006, Pages 1-28

  Carlet, Claude ^a,b  

^a INRIA   (France)

^b UNIVERSITÉ PARIS 8   (France)

Author keywords

Algebraic attack; Algebraic degree; Boolean function; Nonlinearity; Resiliency; Stream cipher

Indexed keywords

ALGEBRAIC IMMUNITY; CORRELATION IMMUNITY; N-VARIABLE FUNCTIONS; PRIMARY CONSTRUCTIONS;

BOOLEAN FUNCTIONS; CORRELATION METHODS; CRYPTOGRAPHY; FUNCTION EVALUATION; PROBLEM SOLVING;

CONTROL NONLINEARITIES;

EID: 33745667321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11617983_1     Document Type: Conference Paper

References (63)

1. E.F. Assmus and Key, J. D. Designs and their Codes, Cambridge Univ. Press.
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, pp. 86-100, 1991.
4. A. Canteaut and Trabbia, M. Improved fast correlation attacks using parity-check equations of weight 4 and 5, Advanced in Cryptology-EUROCRYPT 2000. Lecture notes in computer science 1807, pp. 573-588, 2000.
5. C. Carlet. Partially-bent functions, Designs Codes and Cryptography, 3, 135-145 (1993)
6. and proceedings of CRYPTO' 92, Advances in Cryptology, Lecture Notes in Computer Science 740, Springer Verlag, pp. 280-291, 1993.
7. C. Carlet. Two new classes of bent functions, EUROCRYPT' 93, Advances in Cryptology, Lecture Notes in Computer Science 765, Springer Verlag, pp. 77-101, 1994.
8. C. Carlet. Generalized Partial Spreads, IEEE Transactions on Information Theory, vol 41, number 5, pp. 1482-1487, 1995.
9. C. Carlet. A construction of bent functions. Finite Fields and Applications, London Mathematical Society, Lecture Series 233, Cambridge University Press, pp. 47-58, 1996.
10. C. Carlet. More correlation-immune and resilient functions over Galois fields and Galois rings. Advances in Cryptology, EUROCRYPT' 97, Lecture Notes in Computer Science 1233, 422-433, Springer Verlag, 1997.
11. 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.
12. C. Carlet. On the coset weight divisibility and nonlinearity of resilient and correlation-immune functions, Proceedings of SETA '01 (Sequences and their Applications 2001), Discrete Mathematics and Theoretical Computer Science, Springer, pp. 131-144, 2001.
13. C. Carlet. A larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction. Advances in Cryptology - CRYPTO 2002, no. 2442 in Lecture Notes in Computer Science, pp. 549-564, 2002.
14. C. Carlet. On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions. Special Issue "Complexity Issues in Coding and Cryptography", dedicated to Prof. Harald Niederreiter on the occasion of his 60th birthday, Journal of Complexity 20, pp. 182-204, 2004.
15. 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.
16. C. Carlet. On the degree, nonlinearity, algebraic thickness and non-normality of Boolean functions, with developments on symmetric functions. IEEE Transactions on Information Theory, vol. 50, pp. 2178-2185, 2004.
17. C. Carlet. Concatenating indicators of flats for designing cryptographic functions. Design, Codes and Cryptography volume 36, Number 2, pp.189-202, 2005.
18. C. Carlet. Designing bent functions and resilient functions from known ones, without extending their number of variables. Proceedings of International Symposium on Information Theory 2005.
19. C. Carlet. Boolean Functions for Cryptography and Error Correcting Codes. Chapter of the monography Boolean Methods and Models, Y. Crama and P. Hammer eds, Cambridge University Press, to appear (winter 2005-2006).
20. C. Carlet, D. K. Dalai, K. C. Gupta and S. Maitra. Algebraic Immunity for Cryptographically Significant Boolean Functions: Analysis and Construction. Preprint.
21. C. Carlet, H. Dobbertin and G. Leander. Normal extensions of bent functions. IEEE Transactions on Information Theory, vol. 50, no. 11, pp. 2880-2885, 2004.
22. C. Carlet and P. Gaborit. Hyper-bent functions and cyclic codes. To appear in the Journal of Combinatorial Theory, Series A, 2005.
23. C. Carlet and P. Gaborit. On the construction of balanced Boolean functions with a good algebraic immunity. Proceedings of International Symposium on Information Theory 2005. To appear.
24. C. Carlet and P. Sarkar. Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions. Finite fields and Applications 8, pp. 120-130, 2002.
25. C. Carlet and J.L. Yucas. Piecewise Constructions of Bent and Almost Optimal Boolean Functions. To appear in Designs, Codes and Cryptography, 2005.
26. N. Courtois. Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. Advances in cryptology-CRYPTO 2003, Lecture Notes in Computer Science 2729, pp. 177-194, Springer, 2003.
27. 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.
28. 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.
29. D. K. Dalai, K. C. Gupta and S. Maitra. Results on Algebraic Immunity for Cryptographically Significant Boolean Functions. Indocrypt 2004, pp. 92-106, number 3348 in Lecture Notes in Computer Science, Springer Verlag, 2004.
30. D. K. Dalai, K. C. Gupta and S. Maitra. Cryptographically Significant Boolean functions: Construction and Analysis in terms of Algebraic Immunity. Fast Software Encryption 2005, Lecture Notes in Computer Science 3557, pp. 98-111, 2005.
31. J. F. Dillon. Elementary Hadamard Difference sets. Ph. D. Thesis, Univ. of Maryland, 1974.
32. J. F. Dillon. Elementary Hadamard Difference sets, Proc. Sixth S-E Conf. Comb. Graph Theory and Comp., F. Hoffman et al. (Eds), Winnipeg Utilitas Math, pp. 237-249, 1975.
33. J. F. Dillon and H. Dobbertin. New cyclic difference sets with Singer parameters. Finite Fields and Their Applications 10, pp. 342-389, 2004.
34. H. Dobbertin. Construction of bent functions and balanced Boolean functions with high nonlinearity. Fast Software Encryption, Second International Workshop, Lecture Notes in Computer Science 1008, pp. 61-74, 1995.
35. H. Dobbertin, G. Leander, A. Canteaut, C. Carlet, P. Felke and P. Gaborit. Construction of Bent Functions via Niho Power Functions. To appear in the Journal of Combinatorial Theory, Series A, 2005.
36. G. Gong. On Existence and Invariant of Algebraic Attacks. Technical report, 2004. http://www.cacr.math.uwaterloo.ca/techreports/2004/corr2004-17.pdf
37. P. Hawkes and G. G. Rose. Rewriting variables: the complexity of fast algebraic attacks on stream ciphers. Cryptology ePrint Archive, Report 2004/081, 2004. http://eprint.iacr.org/2004/081.
38. X.-D. Hou. New constructions of 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.
39. X.-D. Hou, Group actions on binary resilient functions. Appl. Algebra Eng. Commun. Comput. 14(2), pp. 97-115, 2003.
40. X.-D. Hou and P. Langevin. Results on bent functions, Journal of Combinatorial Theory, Series A, 80, pp. 232-246, 1997.
41. T. Johansson and Jönsson, F. Improved fast correlation attack on stream ciphers via convolutional codes. Advances in Cryptology - EUROCRYPT'99, number 1592 in Lecture. Notes in Computer Science, pp. 347-362, 1999.
42. T. Johansson and Jönsson, F. Fast correlation attacks based on turbo code techniques. Advances in Cryptology - CRYPTO'99, number 1666 in Lecture Notes in Computer Science, pp. 181-197, 1999.
43. K. Khoo, G.-E. Tan, H.-K. Lee and G. Gong. Comparision of Boolean function design. Proceedings of International Symposium on Information Theory 2005.
44. r Niho exponents. Proceedings of the Workshop on Coding and Cryptography 2005, Bergen, pp. 454-461, 2005.
45. G. Leander. Monomial bent functions. Proceedings of the Workshop on Coding and Cryptography 2005, Bergen, pp. 462-470, 2005.
46. F. J. Mac Williams and N. J. Sloane. The theory of error-correcting codes, Amsterdam, North Holland, 1977.
47. S. Maity and S. Maitra. Minimum distance between bent and 1-resilient Boolean functions. Proceedings of Fast Software Encryption 2004, LNCS 3017, pp. 143-160, 2004.
48. W. Meier and O. Staffelbach. Nonlinearity Criteria for Cryptographic Functions, Advances in Cryptology, EUROCRYPT' 89, Lecture Notes in Computer Science 434, pp. 549-562, Springer Verlag, 1990.
49. 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.
50. 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.
51. n/2-2. Proceedings of the Workshop on Coding and Cryptography 2003, pp. 365-374, 2003.
52. Olsen, J. D., Scholtz, R. A. and L. R. Welch. Bent function sequences, IEEE Trans. on Inf. Theory, vol IT-28, no 6, 1982.
53. E. Pasalic. Degree optimized resilient Boolean functions from Maiorana-McFarland class. In 9th IMA Conference on Cryptography and Coding, 2003.
54. O. S. Rothaus. On "bent" functions, J. Comb. Theory, 20A, 300-305, 1976.
55. 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.
56. 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.
57. 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.
58. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information theory, V. IT-30, No 5, pp. 776-780, 1984.
59. Siegenthaler, T. Decrypting a Class of Stream Ciphers Using Ciphertext Only. IEEE Transactions on Computer, V. C-34, No 1, pp. 81-85, 1985.
60. L. Simpson, E. Dawson, J. Golic and W. Millan. LILI Keystream generator, Proceedings of SAC'2000, Lecture Notes in Computer Science 1807, Springer, pp. 248-261, 2001; cf. www.isrc.qut.edu.au/lili/.
61. Y. V. Tarannikov. On resilient Boolean functions with maximum possible non-linearity. Proceedings of INDOCRYPT 2000, Lecture Notes in Computer Science 1977, pp. 19-30, 2000.
62. Xiao Guo-Zhen and Massey, J. L. A Spectral Characterization of Correlation-Immune Combining Functions. IEEE Trans. Inf. Theory, Vol IT 34, no 3, pp. 569-571, 1988.
63. Y. Zheng and X. M. Zhang. Plateaued functions. ICICS'99, Lecture Notes in Computer Science, Heidelberg, Ed., Springer-Verlag, vol. 1726, pp. 284-300, 1999.