English
Related papers

Related papers: Kim-type APN functions are affine equivalent to Go…

200 papers

Establishing the CCZ-equivalence of a pair of APN functions is generally quite difficult. In some cases, when seeking to show that a putative new infinite family of APN functions is CCZ inequivalent to an already known family, we rely on…

Combinatorics · Mathematics 2011-01-10 Eimear Byrne , Carl Bracken , Gary McGuire , Gabriele Nebe

Almost Perfect Nonlinear (APN) functions are very useful in cryptography, when they are used as S-Boxes, because of their good resistance to differential cryptanalysis. An APN function $f:\mathbb{F}_{2^n}\rightarrow\mathbb{F}_{2^n}$ is…

Number Theory · Mathematics 2016-02-09 Moises Delgado , Heeralal Janwa

In this paper, we classify $(q,q)$-biprojective almost perfect nonlinear (APN) functions over $\mathbb{LL} \times \mathbb{LL}$ under the natural left and right action of $\mathrm{GL}(2,\mathbb{LL})$ where $\mathbb{LL}$ is a finite field of…

Combinatorics · Mathematics 2022-06-03 Faruk Göloğlu

In the independent works by Kalgin and Idrisova and by Beierle, Leander and Perrin, it was observed that the Gold APN functions over $\mathbb{F}_{2^5}$ give rise to a quadratic APN function in dimension 6 having maximum possible linearity…

Information Theory · Computer Science 2023-02-28 Christof Beierle , Claude Carlet

In this paper, we present two new infinite classes of APN functions over $\gf_{{2^{2m}}}$ and $\gf_{{2^{3m}}}$, respectively. The first one is with bivariate form and obtained by adding special terms,…

Information Theory · Computer Science 2021-05-19 Kangquan Li , Yue Zhou , Chunlei Li , Longjiang Qu

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

We consider exceptional APN functions on ${\bf F}_{2^m}$, which by definition are functions that are not APN on infinitely many extensions of ${\bf F}_{2^m}$. Our main result is that polynomial functions of odd degree are not exceptional,…

Algebraic Geometry · Mathematics 2009-11-13 Yves Aubry , Gary Mcguire , François Rodier

In this extended abstract, we computationally check and list the CCZ-inequivalent APN functions from infinite families on $\mathbb{F}_2^n$ for n from 6 to 11. These functions are selected with simplest coefficients from CCZ-inequivalent…

Cryptography and Security · Computer Science 2017-09-25 Bo Sun

We show that the there exists an infinite family of APN functions of the form $F(x)=x^{2^{s}+1} + x^{2^{k+s}+2^k} + cx^{2^{k+s}+1} + c^{2^k}x^{2^k + 2^s} + \delta x^{2^{k}+1}$, over $\gf_{2^{2k}}$, where $k$ is an even integer and…

Information Theory · Computer Science 2011-10-17 Carl Bracken , Chik How Tan , Tan Yin

The only known example of an almost perfect nonlinear (APN) permutation in even dimension was obtained by applying CCZ-equivalence to a specific quadratic APN function. Motivated by this result, there have been numerous recent attempts to…

Let $n$ be an even number such that $n\equiv 0 \pmod{4}$. We show that a power function $x^d$, with $d=2^{\frac{n+2}{2}}+2^{\frac{n-2}{2}}-1$, on $\mathbb{F}_{2^n}$ is an APN function of degree $n/2$ which is CCZ-equivalent to Kasami…

Number Theory · Mathematics 2020-04-28 Augustine Musukwa , Massimiliano Sala

All almost perfect nonlinear (APN) permutations that we know to date admit a special kind of linear self-equivalence, i.e., there exists a permutation $G$ in their CCZ-equivalence class and two linear permutations $A$ and $B$, such that $G…

Information Theory · Computer Science 2021-06-28 Christof Beierle , Marcus Brinkmann , Gregor Leander

We systematically analyze a class of hexanomial functions over finite fields of characteristic $2$ proposed by Dillon (2006) as candidates for almost perfect nonlinear (APN) functions, significantly extending earlier partial-APN results.…

Number Theory · Mathematics 2026-02-24 Daniele Bartoli , Giovanni Giuseppe Grimaldi , Pantelimon Stanica

For a given function $F$ from $\mathbb F_{p^n}$ to itself, determining whether there exists a function which is CCZ-equivalent but EA-inequivalent to $F$ is a very important and interesting problem. For example, K\"olsch \cite{KOL21} showed…

Information Theory · Computer Science 2023-08-11 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

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

An almost perfect nonlinear (APN) function (necessarily a polynomial function) on a finite field $\mathbb{F}$ is called exceptional APN, if it is also APN on infinitely many extensions of $\mathbb{F}$. In this article we consider the most…

Information Theory · Computer Science 2012-07-25 Moises Delgado , Heeralal Janwa

In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66(11): 7081-7087, 2020] considered an infinite family of quadrinomials over $\mathbb{F}_{2^{n}}$ of the form $x^3+a(x^{2^s+1})^{2^k}+bx^{3\cdot 2^m}+c(x^{2^{s+m}+2^m})^{2^k}$, where…

Information Theory · Computer Science 2021-01-28 Lijing Zheng , Haibin Kan , Yanjun Li , Jie Peng , Deng Tang

The investigation of partially APN functions has attracted a lot of research interest recently. In this paper, we present several new infinite classes of 0-APN power functions over $\mathbb{F}_{2^n}$ by using the multivariate method and…

Information Theory · Computer Science 2022-12-12 Yuying Man , Shizhu Tian , Nian Li , Xiangyong Zeng

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

The inverse function $x \mapsto x^{-1}$ on $\mathbb{F}_{2^n}$ is one of the most studied functions in cryptography due to its widespread use as an S-box in block ciphers like AES. In this paper, we show that, if $n\geq 5$, every function…

Information Theory · Computer Science 2021-03-09 Lukas Kölsch
‹ Prev 1 2 3 10 Next ›