Highly nonlinear mappings

Journal of Complexity

Volumn 20, Issue 2-3, 2004, Pages 205-244

  Carlet, Claude ^a,c,d   Ding, Cunsheng ^b  

^a INRIA   (France)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c UNIVERSITÉ PARIS 8   (France)

^d Centre National de la Recherche Scientifique   (France)

Author keywords

Almost difference sets; Coding; Cryptography; Difference matrices; Difference partition; Difference sets; Functions; Generalized Hadamard matrices; Nonlinearity; Sequences

Indexed keywords

EID: 1942507994     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jco.2003.08.008     Document Type: Article

References (77)

1. A.S. Ambrosimov, Properties of bent functions of q-valued logic over finite fields, Discrete Math. Appl. 4 (4) (1994) 341-350.
2. K.T. Arasu, J.A. Jedwab, S. Sehgal, New constructions of Menon difference sets, J. Combin. Theory A 64 (1993) 329-336.
3. T. Beth, C. Ding, On almost perfect nonlinear permutations, in: Advances in Cryptology - Eurocrypt' 93, Lecture Notes in Computer Science, Vol. 765, Springer, New York, 1994, pp. 65-76.
4. T. Beth, D. Jungnickel, H. Lenz, Design Theory, Vol. 1, 2nd Edition, Cambridge University Press, Cambridge, 1999.
5. E. Biham, A. Shamir, Differential cryptanalysis of DES-like cryptosystems, J. Cryptology 4 (1) (1991) 3-72.
6. B.W. Brock, Hermitian congruence and the existence and completion of generalized Hadamard matrices, J. Combin. Theory A 49 (1988) 233-261.
7. p), Discrete Math. 112 (1993) 249-252.
8. P. Camion, A. Canteaut, Construction of t-resilient functions over a finite alphabet, in: Advances in Cryptology, EUROCRYPT'96, Lecture Notes in Computer Sciences, Vol. 1070, Springer, Berlin, 1996, pp. 283 293.
9. P. Camion, A. Canteaut, Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations, in: N. Koblitz (Ed.), Advances in Cryptology - CRYPTO'96, Lecture Notes in Computer Science, Vol. 1109, Springer, Berlin, 1996, pp. 372-386.
10. A. Canteaut, C. Carlet, P. Charpin, C. Fontaine, Propagation characteristics and correlation-immunity of highly nonlinear Boolean functions, in: Proceedings of Eurocrypt'00, Lecture Notes in Computer Science, Vol. 1807, Springer, Berlin, 2000, pp. 507-520.
11. 2m, and cross correlation of maximum-length sequences, SIAM J. Discrete Math. 13 (1) (2000) 105-138.
12. C. Carlet, Two new classes of bent functions, in: Advances in Cryptology - Eurocrypt'93, Lecture Notes in Computer Sciences, Vol. 765, Springer, Heidelberg, 1994, pp. 77-101.
13. C. Carlet, A construction of bent functions, in: Finite Fields and Applications, London Mathematical Society Lecture Notes Series 233, Cambridge University Press, Cambridge, 1996, pp. 47-58.
14. C. Carlet, Recent results on bent functions, in: Proceedings of the International Conference on Combinatorics, Information Theory and Statistics, Portland, Maine, 1999, pp. 275-291.
15. C. Carlet, On cryptographic propagation criteria for Boolean functions, Inform. and Comput. 151 (1999) 32-56.
16. C. Carlet, S. Dubuc, On generalized bent and q-ary perfect nonlinear functions, in: D. Jungnickel, H. Niederreiter (Eds.), Finite Fields and Applications, Proceedings of Fq5, Springer, Berlin, 2000, pp. 81-94.
17. C. Carlet, P. Guillot, An alternate characterization of the bentness of binary functions with uniqueness, J. Combin. Theory A 76 (1996) 328-335.
18. C. Carlet, P. Guillot, A characterization of binary bent functions, Designs, Codes and Cryptography 14 (1998) 130-140.
19. C. Carlet, P. Guillot, A new characterization of Boolean functions, in: Proceedings of AAECC'13, Hawaii, Lecture Notes in Computer Science, Vol. 1719, Springer, 1999, pp. 94-103.
20. F. Chabaud, S. Vaudenay, Links between differential and linear cryptanalysis, in: Proceedings of EUROCRYPT'94, Advances in Cryptology, Lecture Notes in Computer Science, Vol. 950, Springer, Berlin, 1995, pp. 356-365.
21. Y.Q. Chen, On the existence of abelian Hadamard difference sets and a new family of difference sets, Finite Fields Appl. 3 (1997) 234-256.
22. C.J. Colbourn, W. de Launey, Difference matrices, in: C. Colbourn, J.H. Dinitz (Eds.), Handbook of Combinatorial Designs, CRC Press, New York, 1996, pp. 287-297 (Chapter IV.11).
23. R.S. Coulter, R. Matthews, Planar functions and plans of the Lenz-Barlotti class II, Designs, Codes and Cryptography 10 (1997) 165-195.
24. T.W. Cusick, C. Ding, A. Renvall, Stream Ciphers and Number Theory, in: North-Holland Mathematical Library, Vol. 55, North-Holland/Elsevier, Amsterdam, 1998.
25. T.W. Cusick, H. Dobbertin, Some new 3-valued cross correlation functions of binary sequences, IEEE Trans. Inform. Theory 42 (1996) 1238-1240.
26. J.A. Davis, Almost difference sets and reversible difference sets, Arch. Math. 59 (1992) 595-602.
27. W. de Launey, Square GBRDs over non-abelian groups, Ars Combin. 27 (1989) 40-49.
28. W. de Launey, Generalized Hadamard matrices which are developed modulo a group, Discrete Math. 104 (1992) 49-65.
29. p) exist for all primes p, Graphs Combin. 8 (1992) 317-321.
30. J.F. Dillon, Elementary Hadamard Difference sets, Ph.D. Thesis, University of Maryland, 1974.
31. J.F. Dillon, Multiplicative difference sets via additive characters, Designs, Codes and Cryptography 17 (1999) 225-235.
32. J.F. Dillon, H. Dobbertin, Cyclic difference sets with singer parameters, Manuscript, 1999.
33. C. Ding, Binary cyclotomic generators, in: B. Preneel (Ed.), Fast Software Encryption, Lecture Notes in Computer Science, Vol. 1008, Springer, New York, 1995, pp. 29-60.
34. C. Ding, Cryptographic counter generators, TUCS Dissertations 4, Turku Centre for Computer Science, Turku, Painosalama Oy, 1997.
35. C. Ding, T. Helleseth, K.Y. Lam, Several classes of binary sequences with three-level autocorrelation, IEEE Trans. Inform. Theory 45 (7) (1999) 2601-2606.
36. C. Ding, T. Helleseth, H.M. Martinsen, New families of binary sequences with optimal three-level autocorrelation, IEEE Trans. Inform. Theory 47 (1) (2001) 428-433.
37. H. Dobbertin, Construction of bent functions and balanced Boolean functions with high nonlinearity, in: B. Preneel (Ed.), Fast Software Encryption, Lecture Notes in Computer Science, Vol. 1008, Springer, Heidelberg, 1995, pp. 61-74.
38. H. Dobbertin, One-to-one highly nonlinear functions on finite fields with characteristic 2, Appl. Algebra Eng. Comm. Comput. 9 (1998) 139-152.
39. n): the Welch case, IEEE Trans. Inform. Theory 45 (1999) 1271-1275.
40. n): the Niho case, Inform. and Comput. 151 (1999) 57-72.
41. R. Gold, Maximal recursive sequences with 3-valued recursive cross correlation functions, IEEE Trans. Inform. Theory 14 (1968) 154-156.
42. B. Gordon, W.H. Mills, L.R. Welch, Some new difference sets, Canad. J. Math. 14 (1962) 614-625.
43. 4-linearity of Kerdock, Preparata, Goethals and related codes, IEEE Trans. Inform. Theory 40 (2) (1994) 301-319.
44. T. Helleseth, C. Rong, D. Sandberg, New families of almost perfect nonlinear power mappings, IEEE Trans. Inform. Theory 45 (2) (1999) 475-485.
45. T. Helleseth, D. Sandberg, Some power mappings with low differential uniformity, Applicable Algebra Eng. Comm. Computing 8 (1997) 363-370.
46. E. Hewitt, K. Ross, Abstract Harmonic Analysis, Springer, Heidelberg, 1970.
47. X.D. Hou, q-ary bent functions constructed from chain rings, Finite Fields Appl. 4 (1998) 55-61.
48. X.D. Hou, Bent functions, Partial difference sets, and quasi-Frobenius local rings, Designs, Codes and Cryptography 20 (2000) 251-268.
49. X.D. Hou, P. Langevin, Results on bent functions, J. Combin. Theory A 80 (1997) 232-246.
50. 3 in char. 2 and some applications to cyclic codes, in: Proceedings AAECC-10, Lecture Notes in Computer Science, Vol. 673, Springer, Berlin, 1993, pp. 180-194.
51. D. Jungnickel, Difference sets, in: J. Dinitz, D.R. Stinson (Eds.), Contemporary Design Theory: A Collection of Surveys, Wiley, New York, 1992.
52. D. Jungnickel, A. Pott, Perfect and almost perfect sequences, Discrete Appl. Math. 95 (1999) 331-359.
53. D. Jungnickel, A. Pott, Difference sets: an introduction, in: A. Pott, P.V. Kumar, T. Helleseth, D. Jungnickel (Eds.), Difference Sets, Sequences and their Correlation Properties, Kluwer, Amsterdam, 1999, pp. 259-295.
54. T. Kasami, The weight enumerates for several classes of subcodes of the second order binary Reed-Muller codes, Inform. and Control 18 (1971) 369-394.
55. A.M. Kerdock, A class of low-rate nonlinear codes, Inform. and Control 20 (1972) 182-187.
56. R.G. Kraemer, Proof of a conjecture on Hadamard 2-groups, J. Combin. Theory A 63 (1993) 1-10.
57. P.V. Kumar, R.A. Scholtz, L.R. Welch, Generalized bent functions and their properties, J. Combin. Theory A 40 (1985) 90-107.
58. G. Lachaud, J. Wolfmann, The weights of the orthogonal of the extended quadratic binary Goppa codes, IEEE Trans. Inform. Theory 36 (1990) 686-692.
59. A. Lempel, M. Cohn, W.L. Eastman, A class of binary sequences with optimal autocorrelation properties, IEEE Trans. Inform. Theory 23 (1) (1977) 38-42.
60. O.A. Logachev, A.A. Salnikov, V.V. Yashchenko, Bent functions on a finite Abelian group, Discrete Math. Appl. 7 (6) (1997) 547-564.
61. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
62. A. Maschietti, Difference sets and hypherovals, Designs, Codes and Cryptography 14 (1998) 89-98.
63. M. Matsui, Linear cryptanalysis method for DES cipher, in: Advances in Cryptology - EUROCRYPT'93, Lecture Notes in Computer Science, Vol. 765, Springer, Berlin, 1994, pp. 386-397.
64. A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography, CRC Press Series on Discrete Mathematics and Its Applications, CRC Press, Boca Raton, 1996.
65. d, IEEE Trans. Inform. Theory 44 (3) (1998) 1278-1282.
66. K. Nyberg, Perfect non-linear S-boxes, in: Advances in Cryptology, EUROCRYPT'91, Lecture Notes in Computer Science, Vol. 547, Springer, Berlin, 1992, pp. 378-386.
67. K. Nyberg, Differentially uniform mappings for cryptography, in: Advances in Cryptography - Eurocrypt'93, Lecture Notes in Computer Science, Vol. 765, Springer, New York, 1994, pp. 55-64.
68. J.D. Olsen, R.A. Scholtz, L.R. Welch, Bent function sequences, IEEE Trans. Inform. Theory 28 (6) (1982) 858-864.
69. V.S. Pless, W.C. Huffman, Handbook of Coding Theory, Elsevier, Amsterdam, 1998.
70. A. Pott, Finite Geometry and Character Theory, in: Lecture Notes in Mathematics, Vol. 1601, Springer, Berlin, 1995.
71. O.S. Rothaus, On bent functions, J. Combin. Theory A 20 (1976) 300-305.
72. T. Storer, Cyclotomy and Difference Sets, Markham, Chicago, 1967.
73. T.W. Tze, S. Chanson, C. Ding, T. Helleseth, M. Parker, Logarithm authentication codes, Inform. and Comput. 184 (2003) 93-108.
74. R.J. Turyn, A special class of Williamson matrices and difference sets, J. Combin. Theory A 36 (1984) 111-115.
75. J. Wolfmann, Bent functions and coding theory, in: A. Pott, P.V. Kumar, T. Helleseth, D. Jungnickel (Eds.), Difference Sets, Sequences and their Correlation Properties, Kluwer, Amsterdam, 1999, pp. 393-417.
76. M. Xia, Some infinite class of Williamson matrices and difference sets, J. Combin. Theory A 61 (1992) 230-242.
77. Q. Xiang, Recent results on difference sets with classical parameters, in: A. Pott, P.V. Kumar, T. Helleseth, D. Jungnickel (Eds.), Difference Sets, Sequences and their Correlation Properties, Kluwer, Amsterdam, 1999, pp. 419-434.