Known inifinte families of quadratic APN polynomials over GF(2^n)

From Boolean
N∘ Functions Conditions References
C1-C2 x2s+1+u2k−1x2ik+2mk+s n=pk,gcd⁡(k,3)=gcd⁡(s,3k)=1,p∈{3,4},i=skmodp,m=p−i,n≥12,u primitive in 𝔽2n∗ [1]
C3 sxq+1+x2i+1+xq(2i+1)+cx2iq+1+cqx2i+q q=2m,n=2m,gcd(i,m)=1,c∈𝔽2n,s∈𝔽2n∖𝔽q,X2i+1+cX2i+cqX+1 has no solution x s.t. xq+1=1 [2]
C4 x3+a−1Trn(a3x9) a≠0 [3]
C5 x3+a−1Trn3(a3x9+a6x18) 3|n, a≠0 [4]
C6 x3+a−1Trn3(a6x18+a12x36) 3|n,a≠0 [4]
C7-C9 ux2s+1+u2kx2−k+2k+s+vx2−k+1+wu2k+1,x2s+2k+s n=3k,gcd⁡(k,3)=gcd⁡(s,3k)=1,v,w∈𝔽2k,vw≠1,3|(k+s)u primitive in 𝔽2n∗ [5]
C10 (x+x2m)2k+1+u′(ux+u2mx2m)(2k+1)2i+u(x+x2m)(ux+u2mx2m) n=2m,m⩾2 even, gcd⁡(k,m)=1, and i⩾2 even u primitive in 𝔽2n∗,u′∈𝔽2m not a cube  [6]
C11 a2x22m+1+1+b2x2m+1+1+ax22m+2+bx2m+2+(c2+c)x3 n=3m,m odd L(x)=ax22m+bx2m+cx satisfies the conditions in lemma 8 of [3] [7]
  1. ↑ L. Budaghyan, C. Carlet, G. Leander, Two Classes of Quadratic APN Binomials Inequivalent to Power Functions, IEEE Trans. Inform. Theory 54(9), 2008, pp. 4218-4229
  2. ↑ L. Budaghyan and C. Carlet. Classes of Quadratic APN Trinomials and Hexanomials and Related Structures. {\em IEEE Trans. Inform. Theory}, vol. 54, no. 5, pp. 2354-2357, 2008.
  3. ↑ L. Budaghyan, C. Carlet and G.Leander, Constructinig new APN functions from known ones, Finite Fields and their applications, vol.15, issue 2, Apr. 2009, pp. 150-159.
  4. ↑ 4.0 4.1 L. Budaghyan, C. Carlet and G.Leander, On a Construction of quadratic APN functions, Proceedings of IEEE information Theory workshop ITW'09, Oct. 2009, 374-378.
  5. ↑ Bracken, C., Byrne, E., Markin, N., & Mcguire, G. (2011). A few more quadratic APN functions. Cryptography and Communications, 3(1), 43-53.
  6. ↑ Göloğlu, Faruk. Almost perfect nonlinear trinomials and hexanomials. Finite Fields and Their Applications 33 (2015): 258-282.
  7. ↑ Villa, I., Budaghyan, L., Calderini, M., Carlet, C., & Coulter, R. On Isotopic Construction of APN Functions. SETA 2018