On almost perfect nonlinear functions over F2n

IEEE Transactions on Information Theory

Volumn 52, Issue 9, 2006, Pages 4160-4170

  Berger, Thierry P ^a   Canteaut, Anne ^b   Charpin, Pascale ^b   Laigle Chapuy, Yann ^b  

^a Centre National de la Recherche Scientifique   (France)

^b INRIA   (France)

Author keywords

Almost bent function; Almost perfect nonlinear (APN) function; Permutation polynomial; Power function

Indexed keywords

FINITE ELEMENT METHOD; FUNCTION EVALUATION; POLYNOMIALS; PRINCIPAL COMPONENT ANALYSIS; PROBABILITY;

ALMOST BENT FUNCTION; ALMOST PERFECT NONLINEAR FUNCTION; PERMUTATION POLYNOMIAL; POWER FUNCTION;

NONLINEAR SYSTEMS;

EID: 33748579937     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.880036     Document Type: Article

References (32)

1. T. Bending and D. F. Der Flass, "Crooked functions, bent functions, and distance regular graphs," Electron. J. Combin., vol. 5, no. 1, 1998, R34.
2. T. P. Berger, A. Canteaut, P. Charpin, and Y. Laigle-Chapuy, "On almost perfect nonlinear functions," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005.
3. T. P. Berger, A. Canteaut, P. Charpin, and Y. Laigle-Chapuy, Almost perfect nonlinear functions Res. Rep. INRIA, RR-5774, 2005 [Online]. Available: Http://www.inria.fr/rrrt/
4. E. Biham and A. Shamir, "Differential cryptanalysis of des-like cryptosystems," J. Cryptol., vol. 4, no. 1, pp. 3-72, 1991.
5. L. Budaghyan, C. Carlet, P. Felke, and G. Leander, An Infinite Class of Quadratic APN Functions Which are not Equivalent to Power Mappings Cryptology ePrint Archive Rep. 2005/359, 2005 [Online]. Available: Http:/ /eprint.iacr.org/
6. L. Budaghyan, C. Carlet, and A. Pott, "New constructions of almost bent and almost perfect nonlinear polynomials," in Proc. Workshop on Coding and Cryptography - WCC 2005, Bergen, Norway, Mar. 2005, pp. 306-315.
7. L. Budaghyan, C. Carlet, and A. Pott, "New classes of almost bent and almost perfect nonlinear polynomials," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1141-1152, Mar. 2006.
8. A. Canteaut, C. Carlet, P. Charpin, and C. Fontaine, "Propagation characteristics and correlation-immunity of highly nonlinear boolean functions," in Advances in Cryptology - Eurocrypt 2000 Volume 1807 of Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2000, pp. 507-522.
9. A. Canteaut, C. Carlet, P. Charpin, and C. Fontaine,, "On cryptographic properties of the cosets of R(1,m)," IEEE Trans. Inf. Theory, vol. 47, no. 4, pp. 1494-1513, May 2001.
10. A. Canteaut, P. Charpin, and H. Dobbertin, "Binary m-sequences with three-valued crosscorrelation: A proof of welch conjecture," IEEE Trans. Inf. Theory, vol. 46, no. 1, pp. 4-8, Jan. 2000.
11. A. Canteaut, P. Charpin, and H. Dobbertin, "Weight divisibility of cyclic codes, highly nonlinear functions on GF(2 m) and crosscorrelation of maximum-length sequences," SIAM J. Discr. Math., vol. 13, no. 1, pp. 105-138, 2000.
12. C. Carlet, "Partially-bent functions," Des., Codes, Cryptogr., no. 3, pp. 135-145, 1993
13. C. Carlet, P. Charpin, and V. Zinoviev, "Codes, bent functions and permutations suitable for DES-like cryptosystems," Des., Codes, Cryptogr., vol. 15, no. 2, pp. 125-156, 1998.
14. L. Carlitz, "Explicit evaluation of certain exponential sums," Math. Scand., vol. 44, pp. 5-16, 1979.
15. F. Chabaud and S. Vaudenay, "Links between differential and linear cryptanalysis," in Advances in Cryptology - EUROCRYPT'94 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1995, vol. 950, pp. 356-365.
16. -1 and Kloosterman sums," Finite Fields Appl., to be published.
17. P. Charpin, A. Tietäväinen, and V. Zinoviev, "On binary cyclic codes with minimum distance d = 3," Probl. Inf. Transm., vol. 33, no. 4, pp. 287-296, 1997.
18. n): A new class for n divisible by 5," in Proc. Finite Fields and Applications Fq5. Berlin, Germany: Springer-Verlag, 2000, pp. 113-121.
19. Y. Edel, G. Kyureghyan, and A. Pott, "A new APN function which is not equivalent to a power mapping," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 744-747, Feb. 2006.
20. T. Helleseth, "Some results about the cross-correlation function between two maximal linear sequences," Discr. Math., vol. 16, pp. 209-232, 1976.
21. J. W. P. Hirschfeld, Projective Geometries Over Finite Fields, 2nd ed. London, U.K.: Clarendon, 1998, Oxford Mathematical Monographs.
22. n," Discr. Appl. Math., vol. 154, pp. 313-325, 2006.
23. G. Lachaud and J. Wolfmann, "The weights of the Orthogonals of the extended quadratic binary Goppa codes," IEEE Trans. Inf. Theory, vol. 36, no. 3, pp. 686-692, May 1990.
24. R. Lidl and H. Niederreiter, Finite Fields. Cambridge, U.K.: Cambridge Univ. Press, 1983.
25. K. Nyberg, "Differentially uniform mappings for cryptography," in Advances in Cryptology - EUROCRYPT'93, Volume 765 of Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1993, pp. 55-64.
26. K. Nyberg, "S-boxes and round functions with controllable linearity and differential uniformity," in Fast Software Encryption - FSE'94 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1995, vol. 1008, pp. 111-130.
27. K. Nyberg and L. R. Knudsen, "Provable security against differential cryptanalysis," in Advances in Cryptology - CRYPTO'92 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1993, vol. 740, pp. 566-574.
28. K. Nyberg and L. R. Knudsen, "Provable security against a differential attack," J. Cryptol., vol. 8, no. 1, 1995.
29. S. E. Payne, "A complete determination of translation ovoids in finite Desarguian planes," Lincei - Rend. Sc. Fis. Mat. E Nat., vol. LI, Nov. 1971.
30. E. R. V. Dam and D. F. D. Flass, Codes, Graphs, and Schemes from Nonlinear Functions, Tilburg Univ., Tilburg, The Netherlands, Tech. Rep., Res. Memo., FEW 790, May 2000.
31. X.-M. Zhang and Y. Zheng, "GAC - The criterion for global avalanche characterics of cryptographic functions," J. Universal Comp. Sci., vol. 1, no. 5, pp. 320-337, 1995.
32. Y. Zheng and X.-M. Zhang, "Plateaued functions," in Information and Communication Security, ICICS'99 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1726, pp. 284-300.