English
Related papers

Related papers: Quadratic Binomial APN Functions and Absolutely Ir…

200 papers

In this work, we study functions that can be obtained by restricting a vectorial Boolean function $F \colon \mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$ to an affine hyperplane of dimension $n-1$ and then projecting the output to an…

Information Theory · Computer Science 2022-03-29 Christof Beierle , Gregor Leander , Léo Perrin

We will present many strong partial results towards a classification of exceptional planar/PN monomial functions on finite fields. The techniques we use are the Weil bound, Bezout's theorem, and Bertini's theorem.

Algebraic Geometry · Mathematics 2024-05-01 Fernando Hernando , Gary McGuire , Francisco Monserrat

We give all the polynomials functions of degree 20 which are APN over an infinity of field extensions and show they are all CCZ-equivalent to the function $x^5$, which is a new step in proving the conjecture of Aubry, McGuire and Rodier.

Information Theory · Computer Science 2013-01-28 Florian Caullery

In this paper, we show that there is no vectorial Boolean function of degree 4e, with e satisfaying certain conditions, which is APN over infinitely many extensions of its field of definition. It is a new step in the proof of the conjecture…

Information Theory · Computer Science 2013-10-01 Florian Caullery

The authors' previous results on the arity gap of functions of several variables are refined by considering polynomial functions over arbitrary fields. We explicitly describe the polynomial functions with arity gap at least 3, as well as…

Rings and Algebras · Mathematics 2013-06-05 Miguel Couceiro , Erkko Lehtonen , Tamás Waldhauser

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Number Theory · Mathematics 2024-09-09 Jonathan W. Bober , Lara Du , Dan Fretwell , Gene S. Kopp , Trevor D. Wooley

APN permutations in even dimension are vectorial Boolean functions that play a special role in the design of block ciphers. We study their properties, providing some general results and some applications to the low-dimension cases. In…

Cryptography and Security · Computer Science 2017-03-24 Marco Calderini , Massimilano Sala , Irene Villa

APN functions play a central role as building blocks in the design of many block ciphers, serving as optimal functions to resist differential attacks. One of the most important properties of APN functions is their linearity, which is…

Combinatorics · Mathematics 2026-05-19 Sophie Hannah Bénéteau , Nicolas Goluboff , Lukas Kölsch , Divyesh Vaghasiya

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt

Let $P(x)$ be an irreducible quadratic polynomial in $\mathbb{Z}[x]$. We show that for almost all $n$, $P(n)$ does not lie in the range of Euler's totient function.

Number Theory · Mathematics 2018-11-01 Noah Lebowitz-Lockard

We study the nonlinearity of functions defined on a finite field with 2^m elements which are the trace of a polynomial of degree 7 or more general polynomials. We show that for m odd such functions have rather good nonlinearity properties.…

Number Theory · Mathematics 2007-05-23 Eric Férard , François Rodier

In this paper we compute the Fourier spectra of some recently discovered binomial APN functions. One consequence of this is the determination of the nonlinearity of the functions, which measures their resistance to linear cryptanalysis.…

Discrete Mathematics · Computer Science 2008-12-18 Carl Bracken , Eimear Byrne , Nadya Markin , Gary McGuire

In his paper Almost-Primes Represented by Quadratic Polynomials, Iwaniec proved that the polynomial n^2 + 1 takes on values with at most two prime factors (counted with multiplicity) infinitely often. He states that "in order to avoid…

Number Theory · Mathematics 2019-10-08 Vishaal Kapoor

In a recent work, Beierle, Brinkmann and Leander presented a recursive tree search for finding APN permutations with linear self-equivalences in small dimensions. In this paper, we describe how this search can be adapted to find many new…

Information Theory · Computer Science 2021-12-24 Christof Beierle , Gregor Leander

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

Number Theory · Mathematics 2007-05-23 Arnaud Bodin , Pierre Dèbes , Salah Najib

We prove that functions $f:\f{2^m} \to \f{2^m}$ of the form $f(x)=x^{-1}+g(x)$ where $g$ is any non-affine polynomial are APN on at most a finite number of fields $\f{2^m}$. Furthermore we prove that when the degree of $g$ is less then 7…

Algebraic Geometry · Mathematics 2009-01-28 Gregor Leander , François Rodier

The purpose of this paper is to detail the article of Carlet. Along the way I recall some interesting results in the theory of finite fields, I give (new) proofs of some known results, and then I generalize the construction of a family of…

Information Theory · Computer Science 2011-07-20 Zahid Mounir

Generalized almost perfect nonlinear (GAPN) functions were defined to satisfy some generalizations of basic properties of almost perfect nonlinear (APN) functions for even characteristic. In this paper, we study monomial GAPN functions for…

Combinatorics · Mathematics 2017-08-03 Masamichi Kuroda

We use the Weil bound of multiplicative character sums together with some recent results of N. Boston and R. Jones, to show that the critical orbit of quadratic polynomials over a finite field of $q$ elements is of length $O(q^{3/4})$,…

Number Theory · Mathematics 2009-09-28 Alina Ostafe , Igor E. Shparlinski

In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…

Combinatorics · Mathematics 2025-01-08 Hiroaki Taniguchi , Alexandr Polujan , Alexander Pott , Razi Arshad