Designs, Codes and Cryptography

, Volume 82, Issue 3, pp 617–627 | Cite as

On the conjecture on APN functions and absolute irreducibility of polynomials



An almost perfect nonlinear (APN) function (necessarily a polynomial function) on a finite field \(\mathbb {F}\) is called exceptional APN, if it is also APN on infinitely many extensions of \(\mathbb {F}\). In this article we consider the most studied case of \(\mathbb {F}=\mathbb {F}_{2^n}\). A conjecture of Janwa–Wilson and McGuire–Janwa–Wilson (1993/1996), settled in 2011, was that the only monomial exceptional APN functions are the monomials \(x^n\), where \(n=2^k+1\) or \(n={2^{2k}-2^k+1} \) (the Gold or the Kasami exponents, respectively). A subsequent conjecture states that any exceptional APN function is one of the monomials just described. One of our results is that all functions of the form \(f(x)=x^{2^k+1}+h(x)\) (for any odd degree h(x), with a mild condition in few cases), are not exceptional APN, extending substantially several recent results towards the resolution of the stated conjecture. We also show absolute irreducibility of a class of multivariate polynomials over finite fields (by repeated hyperplane sections, linear transformations, and reductions) and discuss their applications.


Almost perfect nonlinear (APN) Cyclic codes Deligne estimate  Lang–Weil estimate Absolutely irreducible polynomial CCZ-equivalence  EA-equivalence Gold function Kasami function 

Mathematics Subject Classification

94A60 20C05 05B10 11T71 



The authors are thankful to R.M. Wilson, B. Mishra, H.F. Mattson, Jr., F. Castro, F. Piñero for helpful discussions, and the referees for helpful suggestions.


  1. 1.
    Aubry Y., McGuire G., Rodier F.: A few more functions that are not APN infinitely often. Finite Fields: Theory and Applications. Contemporary Mathematics, vol. 518, pp. 23–31. American Mathematical Society, Providence (2010).Google Scholar
  2. 2.
    Berger T.P., Canteaut A., Charpin P., Laigle-Chapuy Y.: On almost perfect nonlinear functions over \(F^n_2\). IEEE Trans. Inf. Theory 52(9), 4160–4170 (2006).Google Scholar
  3. 3.
    Budaghyan L., Carlet C., Leander G.: Constructing new APN functions from known ones. Finite Fields Appl. 15(2), 150–159 (2009).Google Scholar
  4. 4.
    Byrne E., McGuire G.: Quadratic binomial APN functions and absolutely irreducible polynomials. arXiv:0810.4523v1 (2008).
  5. 5.
    Carlet C., Charpin P., Zinoviev V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125–156 (1998).Google Scholar
  6. 6.
    Caullery F.: A new large class of functions not APN infinitely often. Des. Codes Cryptogr. 73(2), 601–614 (2014).Google Scholar
  7. 7.
    Delgado M., Janwa H.: On the conjecture on APN functions. arXiv:1207.5528 (2012).
  8. 8.
    Delgado M., Janwa H.: Further results on exceptional APN functions. AGCT-India (2013)
  9. 9.
    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).Google Scholar
  10. 10.
    Férard E., Oyono R., Rodier F.: More functions that are not APN infinitely often. The Case of Gold and Kasami Exponents Arithmetic, Geometry, Cryptography and Coding Theory. Contemporary Mathematics, vol. 574, pp. 27–36. American Mathematical Society, Providence (2012). doi: 10.1090/conm/574/11423.
  11. 11.
    Hernando F., McGuire G.: Proof of a conjecture on the sequence of exceptional numbers, classifying cyclic codes and APN functions. J. Algebra 343, 78–92 (2011).Google Scholar
  12. 12.
    Janwa H., Wilson R.M.: Hyperplane sections of Fermat varieties in \({\bf P}^3\) and applications to cyclic codes. 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).Google Scholar
  13. 13.
    Janwa H., Wilson R.M.: Rational points on the Klein quartic and the binary cyclic codes \(\langle {\bf {m_1 m_7}}\rangle \). IEEE Trans. Inf. Theory (to appear).Google Scholar
  14. 14.
    Janwa H., McGuire G., Wilson R.M.: Double-error-correcting cyclic codes and absolutely irreducible polynomials over \({{\rm GF}}(2)\). J. Algebra 178(2), 665–676 (1995).Google Scholar
  15. 15.
    Jedlicka D.: APN monomials over \({{\rm GF}}(2^n)\). Finite Fields Appl. 13(4), 1006–1028 (2007).Google Scholar
  16. 16.
    Lidl R., Niederreiter H.: Finite fields. Encyclopedia of Mathematics and Its Applications, vol. 20, 2nd edn. Cambridge University Press, Cambridge (1997). With a foreword by P. M. Cohn.Google Scholar
  17. 17.
    Nyberg, K.: Differentially uniform mappings for cryptography. 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.
  18. 18.
    Rodier F.: Borne sur le degré des polynômes presque parfaitement non-linéaires. Arithmetic, Geometry, Cryptography and Coding Theory. Contemporary Mathematics, vol. 487, pp. 169–181. American Mathematical Society, Providence (2009).Google Scholar
  19. 19.
    Schmidt W.: Equations Over Finite Fields: An Elementary Approach, 2nd edn. Kendrick Press, Heber City (2004).Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Mathematics and PhysicsUniversity of Puerto Rico (UPR)CayeyUSA
  2. 2.Department of MathematicsUniversity of Puerto Rico (UPR)San JuanUSA

Personalised recommendations