English

APN trinomials and hexanomials

Number Theory 2014-11-13 v1 Combinatorics

Abstract

In this paper we give a new family of APN trinomials of the form X2k+1+(trmn(X))2k+1X^{2^k+1} + (\mathsf{tr}^{n}_{m}(X))^{2^k+1} on F2n\mathbb{F}_{2^n} where gcd(k,n)=1\mathsf{gcd}(k,n)=1 and n=2m=4tn = 2m = 4t, and prove its important properties. The family satisfies for all n=4tn = 4t an interesting property of the Kim function which is, up to equivalence, the only known APN function equivalent to a permutation on F22m\mathbb{F}_{2^{2m}}. As another contribution of the paper, we consider a family of hexanomials gC,kg_{C,k} which was shown to be differentially 2gcd(m,k)2^{\mathsf{gcd}(m,k)}-uniform by Budaghyan and Carlet (2008) when a quadrinomial PC,kP_{C,k} has no roots in a specific subgroup. In this paper, for all (m,k)(m,k) pairs, we characterize, construct and count all CF2nC \in \mathbb{F}_{2^n} satisfying the condition. Bracken, Tan and Tan (2014) and Qu, Tan and Li (2014) constructed some elements CC satisfying the condition when m2or4(mod6)m \equiv 2 \textrm{or} 4 \pmod{6} and m0(mod6)m \equiv 0 \pmod{6} respectively, both requiring gcd(m,k)=1\mathsf{gcd}(m,k) = 1. Bluher (2013) proved that such CC exists if and only if kmk \ne m without characterizing, constructing or counting those CC. To prove the results, we effectively use a Trace-00/Trace-11 (relative to the subfield F2m\mathbb{F}_{2^m}) decomposition of F2n\mathbb{F}_{2^n}.

Cite

@article{arxiv.1411.2981,
  title  = {APN trinomials and hexanomials},
  author = {Faruk Gologlu},
  journal= {arXiv preprint arXiv:1411.2981},
  year   = {2014}
}

Comments

19 pages; submitted Feb 12, 2014; updated Jul 29, 2014

R2 v1 2026-06-22T06:55:26.232Z