On designs and multiplier groups constructed from Almost Perfect Nonlinear functions

Coauthor A. Pott.

In Cryptography and Coding -- Twelfth IMA International Conference, IMACC 2009 (M. G. Parker, ed.), LNCS 5921 (2009), 383-401.

doi: 10.1007/978-3-642-10868-6_23

Errata in the printed version:

Page 393, the paragraph before Proposition 7: "It turns out that in all known examples with n <=8 so far, ..." should be "It turns out that in all known examples with n <= 9 so far, ..."
Moreover delete the following sentence in []-brackets.

The errors are corrcted in the attached PDF.


Let f:F2n to F2n be an almost perfect nonlinear function (APN). The set Df:={(a,b) : f(x+a)-f(x)=b has two solutions} can be used to distinguish APN functions up to equivalence. We investigate the multiplier groups of theses sets Df. This extends earlier work done by the authors.

Download the preprint as pdf

| home | List of publications |