Advertisement

A New Characterization of Almost Bent Functions

  • Anne Canteaut
  • Pascale Charpin
  • Hans Dobbertin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1636)

Abstract

We study the functions from F 2 m into F 2 m 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.

Keywords

Power Function Linear Code Block Cipher Cyclic Code Bend Function 
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

  1. 1.
    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.Google Scholar
  2. 2.
    E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, 4(1):3–72, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    A. Canteaut, P. Charpin, and H. Dobbertin. Binary m-sequences with three-valued crosscorrelation: a proof of Welch’s conjecture. Submitted.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    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.CrossRefGoogle Scholar
  7. 7.
    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.zbMATHMathSciNetGoogle Scholar
  8. 8.
    H. Dobbertin. Almost perfect nonlinear power functions on GF(2n): the Niho case. Information and Computation, 1998. To appear.Google Scholar
  9. 9.
    H. Dobbertin. Almost perfect nonlinear power functions on GF(2n): the Welch case. IEEE Transactions on Information Theory, 1998. To appear.Google Scholar
  10. 10.
    R. Gold. Maximal recursive sequences with 3-valued recursive crosscorrelation functions. IEEE Transactions on Information Theory, 14:154–156, 1968.zbMATHCrossRefGoogle Scholar
  11. 11.
    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.CrossRefMathSciNetGoogle Scholar
  12. 12.
    H.D.L. Hollmann and Q. Xiang. A proof of the Welch and Niho conjectures on crosscorrelations of binary m-sequences. Submitted.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    F.J. MacWilliams and N.J.A. Sloane. The theory of error-correcting codes. North-Holland, 1977.Google Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    R.J. McEliece. Weight congruence for p-ary cyclic codes. Discrete Mathematics, 3:177–192, 1972.zbMATHCrossRefGoogle Scholar
  18. 18.
    Y. Niho. Multi-valued cross-correlation functions between two maximal linear recursive sequences. PhD thesis, Univ. Southern California, 1972.Google Scholar
  19. 19.
    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.Google Scholar
  20. 20.
    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.Google Scholar
  21. 21.
    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.Google Scholar
  22. 22.
    V. Pless. Power moment identities on weight distributions in error-correcting codes. Info. and Control, 3:147–152, 1963.CrossRefMathSciNetGoogle Scholar
  23. 23.
    D.V. Sarwate and M.B. Pursley. Crosscorrelation properties of pseudorandom and related sequences. Proceedings of the IEEE, 68(5):593–619, 1980.CrossRefGoogle Scholar
  24. 24.
    V.M. Sidelnikov. On mutual correlation of sequences. Soviet Math. Dokl., 12:197–201, 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Anne Canteaut
    • 1
  • Pascale Charpin
    • 1
  • Hans Dobbertin
    • 2
  1. 1.INRIA - projet CODESLe ChesnayFrance
  2. 2.German Information Security AgencyBonnGermany

Personalised recommendations