Abstract
We study the functions from F m2 into F m2 for odd m which oppose an optimal resistance to linear cryptanalysis. These functions are called almost bent. It is known that almost bent functions are also almost perfect nonlinear, i.e. they also ensure an optimal resistance to differential cryptanalysis but the converse is not true. We here give a necessary and sufficient condition for an almost perfect nonlinear function to be almost bent. This notably enables us to exhibit some infinite families of power functions which are not almost bent.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. Beth and C. Ding. On almost perfect nonlinear permutations. In Advances in Cryptology-EUROCRYPT’93, number 765 in Lecture Notes in Computer Science, pages 65–76. Springer-Verlag, 1993.
E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, 4(1):3–72, 1991.
A. Canteaut, P. Charpin, and H. Dobbertin. Binary m-sequences with three-valued crosscorrelation: a proof of Welch’s conjecture. Submitted.
A. Canteaut, P. Charpin, and H. Dobbertin. Couples de suites binaires de longueur maximale ayant une corrélation croisée à trois valeurs: conjecture de Welch. Comptes Rendus de l’Académie des Sciences de Paris, t. 328, Série I, pages 173–178, 1999.
C. Carlet, P. Charpin, and V. Zinoviev. Codes, bent functions and permutations suitable for DES-like cryptosystems. Designs, Codes and Cryptography, 15:125–156, 1998.
F. Chabaud and S. Vaudenay. Links between differential and linear cryptanalysis. In Advances in Cryptology-EUROCRYPT’94, number 950 in Lecture Notes in Computer Science, pages 356–365. Springer-Verlag, 1995.
P. Charpin, A. Tietavainen, and V. Zinoviev. On binary cyclic codes with minimum distance d = 3. Problems of Information Transmission, 33(4):287–296, 1997.
H. Dobbertin. Almost perfect nonlinear power functions on GF(2n): the Niho case. Information and Computation, 1998. To appear.
H. Dobbertin. Almost perfect nonlinear power functions on GF(2n): the Welch case. IEEE Transactions on Information Theory, 1998. To appear.
R. Gold. Maximal recursive sequences with 3-valued recursive crosscorrelation functions. IEEE Transactions on Information Theory, 14:154–156, 1968.
S.W. Golomb. Theory of transformation groups of polynomials over GF(2) with applications to linear shift register sequences. Information Sciences, 1:87–109, 1968.
H.D.L. Hollmann and Q. Xiang. A proof of the Welch and Niho conjectures on crosscorrelations of binary m-sequences. Submitted.
T. Kasami. Weight distributions of Bose-Chaudhuri-Hocquenghem codes. In Proceedings of the conference on combinatorial mathematics and its applications, pages 335–357. The Univ. of North Carolina Press, 1968.
T. Kasami. The weight enumerators for several classes of subcodes of the second order binary Reed-Muller codes. Information and Control, 18:369–394, 1971.
F.J. MacWilliams and N.J.A. Sloane. The theory of error-correcting codes. North-Holland, 1977.
M. Matsui. Linear cryptanalysis method for DES cipher. In Advances in Cryptology-EUROCRYPT’93, number 765 in Lecture Notes in Computer Science. Springer-Verlag, 1994.
R.J. McEliece. Weight congruence for p-ary cyclic codes. Discrete Mathematics, 3:177–192, 1972.
Y. Niho. Multi-valued cross-correlation functions between two maximal linear recursive sequences. PhD thesis, Univ. Southern California, 1972.
K. Nyberg. Differentially uniform mappings for cryptography. In Advances in Cryptology-EUROCRYPT’93, number 765 in Lecture Notes in Computer Science, pages 55–64. Springer-Verlag, 1993.
K. Nyberg. Linear approximation of block ciphers. In A. De Santis, editor, Advances in Cryptology-EUROCRYPT’94, number 950 in Lecture Notes in Computer Science. Springer-Verlag, 1994.
K. Nyberg and L.R. Knudsen. Provable security against differential cryptanalysis. In Advances in Cryptology-CRYPTO’92, number 740 in Lecture Notes in Computer Science, pages 566–574. Springer-Verlag, 1993.
V. Pless. Power moment identities on weight distributions in error-correcting codes. Info. and Control, 3:147–152, 1963.
D.V. Sarwate and M.B. Pursley. Crosscorrelation properties of pseudorandom and related sequences. Proceedings of the IEEE, 68(5):593–619, 1980.
V.M. Sidelnikov. On mutual correlation of sequences. Soviet Math. Dokl., 12:197–201, 1971.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Canteaut, A., Charpin, P., Dobbertin, H. (1999). A New Characterization of Almost Bent Functions. In: Knudsen, L. (eds) Fast Software Encryption. FSE 1999. Lecture Notes in Computer Science, vol 1636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48519-8_14
Download citation
DOI: https://doi.org/10.1007/3-540-48519-8_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66226-6
Online ISBN: 978-3-540-48519-3
eBook Packages: Springer Book Archive