Top

Cryptography and Communications

Published in:

01-12-2011

Functions of degree 4e that are not APN infinitely often

Author: François Rodier

Published in: Cryptography and Communications | Issue 4/2011

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

We prove a necessary condition for some polynomials of degree 4e (e an odd number) to be APN over \(\mathbb{F}_{q^n}\) for large n, and we investigate the polynomials f of degree 12.

previous article De Bruijn sequences and complexity of symmetric functions

next article Quadratic forms of codimension 2 over certain finite fields of even characteristic

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Aubry, Y., McGuire, G., Rodier, F.: A few more functions that are not APN infinitely often. In: McGuire, G., et al. (eds.) Finite Fields: Theory and Applications, Ninth International conference Finite Fields and Applications, Contemporary Math. n° 518, pp. 23–31. AMS, Providence (2010)

Berger, T., Canteaut, A., Charpin, P., Laigle-Chapuy, Y.: On almost perfect nonlinear functions over \(F_2^n\). IEEE Trans. Inf. Theory 52(9), 4160–4170 (2006)MathSciNetMATHCrossRef

Budaghyan, L., Carlet, C., Felke, P., Leander, G.: An infinite class of quadratic APN functions which are not equivalent to power mappings. Cryptology ePrint Archive, n° 2005/359

Byrne, E., McGuire, G.: On the non-existence of quadratic APN and crooked functions on finite fields. WCC 2005 Conference Extended Abstracts (2005)

Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Designs Codes Cryptogr. 15(2), 125–156 (1998)MathSciNetMATHCrossRef

Dillon, J.: APN Polynomials: An Update. Fq9, International Conference on Finite Fields and their Applications, July 2009

Edel, Y., Kyureghyan, G., Pott, A.: A new APN function which is not equivalent to a power mapping. IEEE Trans. Inf. Theory 52(2), 744–747 (2006)MathSciNetCrossRef

Edel, Y., Pott, A.: A new almost perfect nonlinear function which is not quadratic. Adv. Math. Commun. 3(1), 59–81 (2009)MathSciNetMATHCrossRef

Hernando, F., McGuire, G.: Proof of a conjecture on the sequence of exceptional numbers, classifying cyclic codes and APN functions. J. Algebra (2009). arXiv:0903.2016v3 [cs.IT]

10.

Janwa, H., Wilson, R.M.: Hyperplane sections of Fermat varieties in P ³ in char. 2 and some applications to cyclic codes. In: Cohen, G., Mora, T., Moreno, O. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings AAECC-10, Lecture Notes in Computer Science, vol. 673, pp. 180–194. Springer, New York (1993)

11.

Jedlicka, D.: APN monomials over GF(2ⁿ) for infinitely many n. Finite Fields Appl. 13(4), 1006–1028 (2007)MathSciNetMATHCrossRef

12.

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)

13.

Rodier, F.: Bornes sur le degré des polynômes presque parfaitement non-linéaires. In: Lachaud, G., Ritzenthaler, C., Tsfasman, M. (eds.) Arithmetic, Geometry, Cryptography and Coding Theory, Contemporary Math. no. 487, pp. 169–181. AMS, Providence. arXiv:math/0605232v3 [math.AG] (2009)

Title: Functions of degree 4e that are not APN infinitely often
Author: François Rodier
Publication date: 01-12-2011
Publisher: Springer US
Published in: Cryptography and Communications / Issue 4/2011
Print ISSN: 1936-2447
Electronic ISSN: 1936-2455
DOI: https://doi.org/10.1007/s12095-011-0050-6

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Other articles of this Issue 4/2011

A character theoretic approach to planar functions

On the dimension of an APN code

Towards a spectral approach for the design of self-synchronizing stream ciphers

A note on Yao’s theorem about pseudo-random generators

Quadratic forms of codimension 2 over certain finite fields of even characteristic

Crosscorrelation of m-sequences, exponential sums, bent functions and Jacobsthal sums

Premium Partner