Paper 2019/994

A new family of APN quadrinomials

Lilya Budaghyan, Tor Helleseth, and Nikolay Kaleyski

Abstract

The binomial B(x)=x3+βx36 (where β is primitive in F24) over F210 is the first known example of an Almost Perfect Nonlinear (APN) function that is not CCZ-equivalent to a power function, and has remained unclassified into any infinite family of APN functions since its discovery in 2006. We generalize this binomial to an infinite family of APN quadrinomials of the form x3+a(x2i+1)2k+bx32m+c(x2i+m+2m)2k from which B(x) can be obtained by setting a=β, b=c=0, i=3, k=2. We show that for any dimension n=2m with m odd and 3m, setting (a,b,c)=(β,β2,1) and i=m2 or i=(m2)1modn yields an APN function, and verify that for n=10 the quadrinomials obtained in this way for i=m2 and i=(m2)1modn are CCZ-inequivalent to each other, to B(x), and to any other known APN function over F210.

Note: Minor update to Table 2 and one paragraph added on F13 before Corollary 1.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Boolean functionAPNdifferential uniformity
Contact author(s)
nikolay kaleyski @ uib no
History
2019-09-05: received
Short URL
https://ia.cr/2019/994
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/994,
      author = {Lilya Budaghyan and Tor Helleseth and Nikolay Kaleyski},
      title = {A new family of {APN} quadrinomials},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/994},
      year = {2019},
      url = {https://eprint.iacr.org/2019/994}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.