Constructing new APN functions through relative trace functions

Abstract

In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66(11): 7081-7087, 2020] considered an infinite family of quadrinomials over F2n of the form x3+a(x2s+1)2k+bx3· 2m+c(x2s+m+2m)2k, where n=2m with m odd. They proved that such kind of quadrinomials can provide new almost perfect nonlinear (APN) functions when (3,m)=1, k=0 , and (s,a,b,c)=(m-2,ω, ω2,1) or ((m-2)-1~ mod~n,ω, ω2,1) in which ω∈F4 F2. By taking a=ω and b=c=ω2, we observe that such kind of quadrinomials can be rewritten as a Trnm(bx3)+aq Trnm(cx2s+1), where q=2m and Trnm(x)=x+x2m for n=2m. Inspired by the quadrinomials and our observation, in this paper we study a class of functions with the form f(x)=a Trnm(F(x))+aq Trnm(G(x)) and determine the APN-ness of this new kind of functions, where a ∈ F2n such that a+aq≠ 0, and both F and G are quadratic functions over F2n. We first obtain a characterization of the conditions for f(x) such that f(x) is an APN function. With the help of this characterization, we obtain an infinite family of APN functions for n=2m with m being an odd positive integer: f(x)=a Trnm(bx3)+aq Trnm(b3x9) , where a∈ F2n such that a+aq≠ 0 and b is a non-cube in F2n .

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…