International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Another class of quadratic APN binomials over $\F_{2^n}$: the case $n$ divisible by 4

Authors:
Lilya Budaghyan
Claude Carlet
Gregor Leander
Download:
URL: http://eprint.iacr.org/2006/428
Search ePrint
Search Google
Abstract: We exhibit an infinite class of almost perfect nonlinear quadratic binomials from $\mathbb{F}_{2^{n}}$ to $\mathbb{F}_{2^{n}}$ with $n=4k$ and $k$ odd. We prove that these functions are CCZ-inequivalent to known APN power functions when $k\ne 1$. In particular it means that for $n=12,20,28$, they are CCZ-inequivalent to any power function.
BibTeX
@misc{eprint-2006-21919,
  title={Another class of quadratic APN binomials over $\F_{2^n}$: the case $n$ divisible by 4},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / Affine equivalence, Almost bent, Almost perfect nonlinear, CCZ-equivalence, Differential uniformity, Nonlinearity, S-box, Vectorial Boolean function.},
  url={http://eprint.iacr.org/2006/428},
  note={ lilya@science.unitn.it 13479 received 17 Nov 2006, last revised 27 Nov 2006},
  author={Lilya Budaghyan and Claude Carlet and Gregor Leander},
  year=2006
}