Generalized Almost Perfect Nonlinear Binomials and Trinomials Over Fields of Prime-Square Order
Abstract
Let p>3 be a prime. We show that, for each integer d with p ≤ d ≤ 2(p-1), there exists a generalized almost perfect nonlinear (GAPN) binomial or trinomial over Fp2 of algebraic degree d. We start by deriving sufficient conditions for the function G Fp2 → Fp2, X Xd1 + u Xd2 to be GAPN in the case where one of the terms of G is GAPN. We then give explicit constructions of GAPN binomials over Fp2 of any odd algebraic degree between p and 2(p-1) and, in the case where p is not a Mersenne prime, also of any even algebraic degree in this range. To obtain GAPN functions of even algebraic degree also in the general case, we finally show how to construct GAPN trinomials over Fp2 of any even algebraic degree between p and 2(p-1) by applying a characterization of a special form of GAPN binomials by \"Ozbudak and Salagean. Our constructed functions are the first GAPN functions of even algebraic degree over extension fields of odd characteristic reported so far.
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.