• DocumentCode
    2651217
  • Title

    On a construction of quadratic APN functions

  • Author

    Budaghyan, Lilya ; Carlet, Claude ; Leander, Gregor

  • Author_Institution
    Dept. of Inf., Univ. of Bergen, Bergen, Norway
  • fYear
    2009
  • fDate
    11-16 Oct. 2009
  • Firstpage
    374
  • Lastpage
    378
  • Abstract
    In a recent paper, the authors introduced a method for constructing new quadratic APN functions from known ones. Applying this method, they obtained the function x3 + trn(x9) which is APN over F2n for any positive integer n. The present paper is a continuation of this work. We give sufficient conditions on linear functions L1 and L2 from F2n to itself such that the function L1(x3) + L2(x9) is APN over F2n. We show that this can lead to many new cases of APN functions. In particular, we get two families of APN functions x3 + a-1 tr3 n(a3x9 + a6x18) and x3 + a-1 tr3 n(a6x18 + a12x36) over F2n for any n divisible by 3 and a ¿ F2n*. We prove that for n = 9, these families are pairwise different and differ from all previously known families of APN functions, up to the most general equivalence notion, the CCZ-equivalence. We also investigate further sufficient conditions under which the conditions on the linear functions L1 and L2 are satisfied.
  • Keywords
    Boolean functions; cryptography; transforms; CCZ-equivalence; Walsh transform; almost bent function; almost perfect nonlinear; cryptanalysis; quadratic APN functions; vectorial Boolean function; Boolean functions; Conferences; Gold; Information theory; Lead; Nonlinear equations; Sufficient conditions; Almost bent; Almost perfect nonlinear; CCZ-equivalence; Nonlinearity; S-box; Vectorial Boolean function;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 2009. ITW 2009. IEEE
  • Conference_Location
    Taormina
  • Print_ISBN
    978-1-4244-4982-8
  • Electronic_ISBN
    978-1-4244-4983-5
  • Type

    conf

  • DOI
    10.1109/ITW.2009.5351383
  • Filename
    5351383