Skip to main content
Erschienen in: Designs, Codes and Cryptography 2/2014

01.11.2014

A new large class of functions not APN infinitely often

verfasst von: Florian Caullery

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2/2014

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We show that there is no vectorial Boolean function of degree \(4e\), with some conditions on \(e\), which is APN over infinitely many extensions of its field of definition. It is a new step in the proof of the conjecture of Aubry, McGuire and Rodier.
Literatur
1.
Zurück zum Zitat Aubry Y., McGuire G., Rodier F.: A few more functions that are not APN infinitely often. In: Finite Fields: Theory and Applications. Contemporary Mathematics, vol. 518, pp. 23–31. American Mathematical Society, Providence (2010). doi:10.1090/conm/518/10193. Aubry Y., McGuire G., Rodier F.: A few more functions that are not APN infinitely often. In: Finite Fields: Theory and Applications. Contemporary Mathematics, vol. 518, pp. 23–31. American Mathematical Society, Providence (2010). doi:10.​1090/​conm/​518/​10193.
2.
Zurück zum Zitat Berger T.P., Canteaut A., Charpin P., Laigle-Chapuy Y.: On almost perfect nonlinear functions over \(f^{n}_{2}\). IEEE Trans. Inform. Theory 52(9), 4160–4170 (2006). doi:10.1109/TIT.2006.880036. Berger T.P., Canteaut A., Charpin P., Laigle-Chapuy Y.: On almost perfect nonlinear functions over \(f^{n}_{2}\). IEEE Trans. Inform. Theory 52(9), 4160–4170 (2006). doi:10.​1109/​TIT.​2006.​880036.
3.
4.
Zurück zum Zitat Bourbaki N.: Éléments de mathématique. Masson, Paris (1985). Algèbre commutative. Chapitres 5 à 7. Bourbaki N.: Éléments de mathématique. Masson, Paris (1985). Algèbre commutative. Chapitres 5 à 7.
5.
Zurück zum Zitat Byrne E., McGuire G.: Quadratic binomial APN functions and absolutely irreducible polynomials. ArXiv e-prints (2008). Byrne E., McGuire G.: Quadratic binomial APN functions and absolutely irreducible polynomials. ArXiv e-prints (2008).
6.
Zurück zum Zitat Carlet C., Charpin P., Zinoviev V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125–156 (1998). doi:10.1023/A:1008344232130. Carlet C., Charpin P., Zinoviev V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125–156 (1998). doi:10.​1023/​A:​1008344232130.
7.
Zurück zum Zitat Delgado M., Janwa H.: On the conjecture on APN functions. CoRR abs/1207.5528 (2012). Delgado M., Janwa H.: On the conjecture on APN functions. CoRR abs/1207.5528 (2012).
9.
Zurück zum Zitat Dobbertin H., Mills D., Muller E.N., Pott A., Willems W.: APN functions in odd characteristic. Discret. Math. 267(1–3), 95–112 (2003). Combinatorics 2000 (Gaeta). Dobbertin H., Mills D., Muller E.N., Pott A., Willems W.: APN functions in odd characteristic. Discret. Math. 267(1–3), 95–112 (2003). Combinatorics 2000 (Gaeta).
11.
12.
Zurück zum Zitat Férard E., Oyono R., Rodier F.: Some more functions that are not APN infinitely often. The case of Gold and Kasami exponents. In: Arithmetic, Geometry, Cryptography and Coding Theory. Contemporary Mathematics, vol. 574, pp. 27–36. American Mathematical Society, Providence (2012). doi:10.1090/conm/574/11423. Férard E., Oyono R., Rodier F.: Some more functions that are not APN infinitely often. The case of Gold and Kasami exponents. In: Arithmetic, Geometry, Cryptography and Coding Theory. Contemporary Mathematics, vol. 574, pp. 27–36. American Mathematical Society, Providence (2012). doi:10.​1090/​conm/​574/​11423.
14.
Zurück zum Zitat Janwa H., Wilson R.M.: Hyperplane sections of Fermat varieties in \(P^3\) in char 2 and some applications to cyclic codes. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (San Juan, PR, 1993). Lecture Notes in Computer Science, vol. 673, pp. 180–194. Springer, Berlin (1993). doi:10.1007/3-540-56686-4_43. Janwa H., Wilson R.M.: Hyperplane sections of Fermat varieties in \(P^3\) in char 2 and some applications to cyclic codes. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (San Juan, PR, 1993). Lecture Notes in Computer Science, vol. 673, pp. 180–194. Springer, Berlin (1993). doi:10.​1007/​3-540-56686-4_​43.
15.
Zurück zum Zitat Janwa H., McGuire G.M., Wilson R.M.: Double-error-correcting cyclic codes and absolutely irreducible polynomials over GF(2). J. Algebra 178(2), 665–676 (1995). doi:10.1006/jabr.1995.1372. Janwa H., McGuire G.M., Wilson R.M.: Double-error-correcting cyclic codes and absolutely irreducible polynomials over GF(2). J. Algebra 178(2), 665–676 (1995). doi:10.​1006/​jabr.​1995.​1372.
16.
Zurück zum Zitat Leducq E.: New families of APN functions in characteristic 3 or 5. In: Arithmetic, Geometry, Cryptography and Coding Theory. Contemporary Mathematics, vol. 574, pp. 115–123. American Mathematical Society, Providence (2012). doi:10.1090/conm/574/11419. Leducq E.: New families of APN functions in characteristic 3 or 5. In: Arithmetic, Geometry, Cryptography and Coding Theory. Contemporary Mathematics, vol. 574, pp. 115–123. American Mathematical Society, Providence (2012). doi:10.​1090/​conm/​574/​11419.
18.
Zurück zum Zitat Nyberg K.: Differentially uniform mappings for cryptography. In: Advances in Cryptology–EUROCRYPT ’93 (Lofthus, 1993). Lecture Notes in Computer Science, vol. 765, pp. 55–64. Springer, Berlin (1994). doi:10.1007/3-540-48285-7_6. Nyberg K.: Differentially uniform mappings for cryptography. In: Advances in Cryptology–EUROCRYPT ’93 (Lofthus, 1993). Lecture Notes in Computer Science, vol. 765, pp. 55–64. Springer, Berlin (1994). doi:10.​1007/​3-540-48285-7_​6.
19.
20.
Zurück zum Zitat Rodier F.: Borne sur le degré des polynômes presque parfaitement non-linéaires. In: Arithmetic, Geometry, Cryptography and Coding theory. Contemporary Mathematics, vol. 487, pp. 169–181. American Mathematical Society, Providence (2009). doi:10.1090/conm/487/09531. Rodier F.: Borne sur le degré des polynômes presque parfaitement non-linéaires. In: Arithmetic, Geometry, Cryptography and Coding theory. Contemporary Mathematics, vol. 487, pp. 169–181. American Mathematical Society, Providence (2009). doi:10.​1090/​conm/​487/​09531.
22.
Metadaten
Titel
A new large class of functions not APN infinitely often
verfasst von
Florian Caullery
Publikationsdatum
01.11.2014
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 2/2014
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-014-9956-2

Weitere Artikel der Ausgabe 2/2014

Designs, Codes and Cryptography 2/2014 Zur Ausgabe

Premium Partner