On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions

Let f : F n 2 → F n 2 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 [1].

• Type: Conference
• Year: 2009
• Where: IMA
• Authors: Yves Edel, Alexander Pott
• Keywords: Cryptography, IMA 2009, Perfect Nonlinear Function, Set Df, Theses Sets Df