English
Related papers

Related papers: On CCZ-equivalence of the inverse function

200 papers

Permutations over $F_{2^{2k}}$ with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well…

Information Theory · Computer Science 2014-07-21 Jie Peng , Chik How Tan , Qichun Wang

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

Permutations of the form $F=L_1(x^{-1})+L_2(x)$ with linear functions $L_1,L_2$ are closely related to several interesting questions regarding CCZ-equivalence and EA-equivalence of the inverse function. In this paper, we show that $F$…

Combinatorics · Mathematics 2020-09-23 Faruk Göloğlu , Lukas Kölsch , Gohar Kyureghyan , Léo Perrin

Finding permutation polynomials with low differential and boomerang uniformityis an important topic in S-box designs of many block ciphers. For example, AES chooses the inverse function as its S-box, which is differentially 4-uniform and…

Information Theory · Computer Science 2020-09-21 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

Functions with low differential uniformity can be used as the s-boxes of symmetric cryptosystems as they have good resistance to differential attacks. The AES (Advanced Encryption Standard) uses a differentially-4 uniform function called…

Information Theory · Computer Science 2009-01-14 Carl Bracken , Gregor Leander

We consider the function $x^{-1}$ that inverses a finite field element $x \in \mathbb{F}_{p^n}$ ($p$ is prime, $0^{-1} = 0$) and affine $\mathbb{F}_{p}$-subspaces of $\mathbb{F}_{p^n}$ such that their images are affine subspaces as well. It…

Cryptography and Security · Computer Science 2022-07-01 Nikolay Kolomeec , Denis Bykov

Differentially 4-uniform permutations on $\gf_{2^{2k}}$ with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduced a class of functions, which are called preferred…

Information Theory · Computer Science 2014-07-22 Longjiang Qu , Yin Tan , Chao Li , Guang Gong

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

The problem of finding APN permutations of ${\mathbb F}_{2^n}$ where $n$ is even and $n>6$ has been called the Big APN Problem. Li, Li, Helleseth and Qu recently characterized APN functions defined on ${\mathbb F}_{q^2}$ of the form…

Information Theory · Computer Science 2020-09-15 Benjamin Chase , Petr Lisonek

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

Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The…

Information Theory · Computer Science 2011-10-26 Thomas W. Cusick

While the classical differential uniformity ($c=1$) is invariant under the CCZ-equivalence, the newly defined \cite{EFRST20} concept of $c$-differential uniformity, in general is not invariant under EA or CCZ-equivalence, as was observed in…

Information Theory · Computer Science 2020-08-10 Pantelimon Stanica , Aaron Geary

Multivariate Cryptography is one of the candidates for Post-quantum Cryptography. Multivariate schemes are usually constructed by applying two secret affine invertible transformations $\mathcal S,\mathcal T$ to a set of multivariate…

Cryptography and Security · Computer Science 2025-06-16 Marco Calderini , Alessio Caminata , Irene Villa

Let ${\mathcal A}$ be the class of functions $f$ that are analytic in the unit disk ${\mathbb D}$ and normalized such that $f(z)=z+a_2z^2+a_3z^3+\cdots$. Let $0<\lambda\le1$ and \[ {\mathcal U}(\lambda) = \left\{ f\in{\mathcal A}: \left…

Complex Variables · Mathematics 2021-04-26 Milutin Obradović , Nikola Tuneski

In this paper, we investigate the inverse logarithmic coefficients associated with the class $\mathcal{C}_e$ of analytic and univalent functions satisfying the subordination condition \[ 1+\frac{z f''(z)}{f'(z)} \prec e^z, \quad…

Complex Variables · Mathematics 2026-05-20 Pradip Das , Nabadwip Sarkar

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…

Substitution boxes (S-boxes) play a significant role in ensuring the resistance of block ciphers against various attacks. The Upper Boomerang Connectivity Table (UBCT), the Lower Boomerang Connectivity Table (LBCT) and the Double Boomerang…

Cryptography and Security · Computer Science 2024-04-19 Yuying Man , Nian Li , Zhen Liu , Xiangyong Zeng

Let $\es$ be the class of analytic and univalent functions in the unit disk $|z|<1$, that have a series of the form $f(z)=z+ \sum_{n=2}^{\infty}a_nz^n$. Let $F$ be the inverse of the function $f\in\es$ with the series expansion %in a disk…

Complex Variables · Mathematics 2018-11-06 S. Ponnusamy , N. L. Sharma , K. -J. Wirths

In this paper we determined explicitly the multiplicative inverses of the Dobbertin and Welch APN exponents in Z_{2^n-1}, and we described the binary weights of the inverses of the Gold and Kasami exponents. We studied the function \de(n),…

Number Theory · Mathematics 2013-04-09 Gohar M. Kyureghyan , Valentin Suder

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

Classical Analysis and ODEs · Mathematics 2019-09-24 Tamás Erdélyi
‹ Prev 1 2 3 10 Next ›