English
Related papers

Related papers: On the Conjecture on APN Functions

200 papers

We introduce a new concept, the APN-defect, which can be thought of as measuring the distance of a given function $G:\mathbb{F}_{2^n} \rightarrow \mathbb{F}_{2^n}$ to the set of almost perfect nonlinear (APN) functions. This concept is…

Information Theory · Computer Science 2024-06-12 Nurdagül Anbar , Tekgül Kalaycı , Alev Topuzoğlu

The goal of this paper is to study Goldbach's conjecture for rings of regular functions of affine algebraic varieties over a field. Among our main results, we define the notion of Goldbach condition for Newton polytopes, and we prove in a…

Number Theory · Mathematics 2023-12-29 Alberto F. Boix , Danny A. J. Gómez-Ramírez

Classical planar functions are functions from a finite field to itself and give rise to finite projective planes. They exist however only for fields of odd characteristic. We study their natural counterparts in characteristic two, which we…

Combinatorics · Mathematics 2014-01-13 Kai-Uwe Schmidt , Yue Zhou

In 2021, Calderini et al. introduced a construction for APN functions on $\mathbb{F}_{2^{2m}}$ in bivariate form $$ f(x,y)=\big(xy,\, x^{2^r+1} + x^{2^{r+m/2}} y^{2^{m/2}} + bxy^{2^r} + cy^{2^r+1}\big),\quad r < m/2,\quad \gcd(r, m) = 1. $$…

Number Theory · Mathematics 2025-11-07 Daniele Bartoli , Marco Calderini , Giuseppe Marino , Francesco Pavese

We consider a generalisation of a conjecture by Patterson and Wiedemann from 1983 on the Hamming distance of a function from $\mathbb{F}_q^n$ to $\mathbb{F}_q$ to the set of affine functions from $\mathbb{F}_q^n$ to $\mathbb{F}_q$. We prove…

Combinatorics · Mathematics 2019-09-17 Kai-Uwe Schmidt

Recently, the investigation of Partially APN functions has attracted a lot of attention. In this paper, with the help of resultant elimination and MAGMA, we propose several new infinite classes of 0-APN power functions over…

Information Theory · Computer Science 2022-10-28 Tao Fu , Haode Yan

Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of…

Number Theory · Mathematics 2012-05-04 Elodie Leducq

In this paper we give a new family of APN trinomials of the form $X^{2^k+1} + (\mathsf{tr}^{n}_{m}(X))^{2^k+1}$ on $\mathbb{F}_{2^n}$ where $\mathsf{gcd}(k,n)=1$ and $n = 2m = 4t$, and prove its important properties. The family satisfies…

Number Theory · Mathematics 2014-11-13 Faruk Gologlu

Dave Benson conjectured in 2020 that if $G$ is a finite $2$-group and $V$ is an odd-dimensional indecomposable representation of $G$ over an algebraically closed field $\Bbbk$ of characteristic $2$, then the only odd-dimensional…

Representation Theory · Mathematics 2023-03-16 George Cao , Kent B. Vashaw

In a prior paper \cite{EFRST20}, two of us, along with P. Ellingsen, P. Felke and A. Tkachenko, 1defined a new (output) multiplicative differential, and the corresponding $c$-differential uniformity, which has the potential of extending…

Information Theory · Computer Science 2021-03-23 Sihem Mesnager , Constanza Riera , Pantelimon Stanica , Haode Yan , Zhengchun Zhou

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

Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…

Information Theory · Computer Science 2022-10-20 Haode Yan , Sihem Mesnager , Xiantong Tan

We study trivariate permutation polynomials over $\mathbb{F}_{2^{m}}$ extending two APN permutation families of Li--Kaleyski (IEEE Trans. Inform. Theory, 2024) by allowing the scalar parameter to vary over $\mathbb{F}_{2^m}^*$. For \[…

Number Theory · Mathematics 2026-03-17 Daniele Bartoli , Pantelimon Stanica

The polynomial affine gravity is an alternative model of gravity whose fundamental field is the affine connection, and it is invariant under the complete group of diffeomorphisms. In 3+1 dimensions the field equations generalise those of…

General Relativity and Quantum Cosmology · Physics 2022-12-16 José Perdiguero , Oscar Castillo-Felisola

Constructing permutation polynomials over finite fields, particularly those with simple algebraic structure in multiple variables, is a fundamental problem with applications in cryptography and coding theory. Recently, Li and Kaleyski (IEEE…

Number Theory · Mathematics 2026-02-24 Daniele Bartoli , Mohit Pal , Pantelimon Stanica , Tommaso Toccotelli

Functions with low differential uniformity have relevant applications in cryptography. Recently, functions with low $c$-differential uniformity attracted lots of attention. In particular, so-called APcN and PcN functions (generalization of…

Combinatorics · Mathematics 2021-02-05 Daniele Bartoli , Marco Calderini

Standard probability theory has been extremely successful but there are some conceptually possible scenarios, such as fair infinite lotteries, that it does not model well. For this reason alternative probability theories have been…

Logic · Mathematics 2016-08-10 Hazel Brickhill , Leon Horsten

In 2008, Langevin and Leander determined the dual function of three classes of monomial bent functions with the help of Stickelberger's theorem: Dillon, Gold and Kasami. In their paper, they proposed one very strong condition such that…

Information Theory · Computer Science 2021-07-06 Honggang Hu , Bei Wang , Xianhong Xie , Yiyuan Luo

The purpose of this paper is to present the extended definitions and characterizations of the classical notions of APN and maximum nonlinear Boolean functions to deal with the case of mappings from a finite group K to another one N with the…

Cryptography and Security · Computer Science 2011-09-26 Laurent Poinsot , Alexander Pott

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…

Combinatorics · Mathematics 2007-05-23 Thomas W. Cusick , Yuan Li , Pantelimon Stanica