English
Related papers

Related papers: $4$-uniform BCT permutations from generalized butt…

200 papers

We study a class of general quadrinomials over the field of size $2^{2m}$ with odd $m$ and characterize conditions under which they are permutations with the best boomerang uniformity, a new and important parameter related to…

Information Theory · Computer Science 2020-01-03 Nian Li , Maosheng Xiong , Xiangyong Zeng

In this paper, we present infinite families of permutations of $\mathbb{F}_{2^{2n}}$ with high nonlinearity and boomerang uniformity $4$ from generalized butterfly structures. Both open and closed butterfly structures are considered. It…

Information Theory · Computer Science 2019-12-16 Kangquan Li , Chunlei Li , Tor Helleseth , Longjiang Qu

At Eurocrypt'18, Cid, Huang, Peyrin, Sasaki, and Song introduced a new tool called Boomerang Connectivity Table (BCT) for measuring the resistance of a block cipher against the boomerang attack (which is an important cryptanalysis technique…

Cryptography and Security · Computer Science 2019-03-05 Sihem Mesnager , Chunming Tang , Maosheng Xiong

In EUROCRYPT 2018, Cid et al. \cite{BCT2018} introduced a new concept on the cryptographic property of S-boxes: Boomerang Connectivity Table (BCT for short) for evaluating the subtleties of boomerang-style attacks. Very recently, BCT and…

Cryptography and Security · Computer Science 2019-05-20 Kangquan Li , Longjiang Qu , Bing Sun , Chao Li

This paper makes the first bridge between the classical differential/boomerang uniformity and the newly introduced $c$-differential uniformity. We show that the boomerang uniformity of an odd APN function is given by the maximum of the…

Information Theory · Computer Science 2024-08-07 Mohit Pal , Pantelimon Stanica

Recently, a new structure called butterfly introduced by Perrin et at. is attractive for that it has very good cryptographic properties: the differential uniformity is at most equal to 4 and algebraic degree is also very high when exponent…

Information Theory · Computer Science 2023-05-11 Shihui Fu , Xiutao Feng

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

Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…

Combinatorics · Mathematics 2025-01-28 Kirpa Garg , Sartaj Ul Hasan , Pantelimon Stanica

Let $\mathbb{F}_q$ be a finite field of characteristic $p$. In this paper we prove that the $c$-Boomerang Uniformity, $c \neq 0$, for all permutation monomials $x^d$, where $d > 1$ and $p \nmid d$, is bounded by $d^2$. Further, we utilize…

Number Theory · Mathematics 2024-11-08 Matthias Johann Steiner

We consider the boomerang uniformity of an infinite class of (locally-APN) power maps and show that its boomerang uniformity over the finite field $\F_{2^n}$ is $2$ and $4$, when $n \equiv 0 \pmod 4$ and $n \equiv 2 \pmod 4$, respectively.…

Information Theory · Computer Science 2021-09-17 Sartaj Ul Hasan , Mohit Pal , Pantelimon Stanica

A substitution box (S-box) in a symmetric primitive is a mapping $F$ that takes $k$ binary inputs and whose image is a binary $m$-tuple for some positive integers $k$ and $m$, which is usually the only nonlinear element of the most modern…

Information Theory · Computer Science 2023-05-23 Kwang Ho Kim , Sihem Mesnager , Ye Bong Kim

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

Block ciphers use S-boxes to create confusion in the cryptosystems. Such S-boxes are functions over $\mathbb{F}_{2^{n}}$. These functions should have low differential uniformity, high nonlinearity, and high algebraic degree in order to…

Cryptography and Security · Computer Science 2021-03-22 Yan-Ping Wang , WeiGuo Zhang , Zhengbang Zha

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

High Energy Physics - Theory · Physics 2009-10-31 P. Bantay

We defined in~\cite{EFRST20} a new multiplicative $c$-differential, and the corresponding $c$-differential uniformity and we characterized the known perfect nonlinear functions with respect to this new concept, as well as the inverse in any…

Information Theory · Computer Science 2020-04-27 Pantelimon Stanica

Parker and L\^e introduced random butterfly transforms (RBTs) as a preprocessing technique to replace pivoting in dense LU factorization. Unfortunately, their FFT-like recursive structure restricts the dimensions of the matrix. Furthermore,…

Numerical Analysis · Mathematics 2024-10-14 Neil Lindquist , Piotr Luszczek , Jack Dongarra

Feistel Boomerang Connectivity Table (FBCT) is an important cryptanalytic technique on analysing the resistance of the Feistel network-based ciphers to power attacks such as differential and boomerang attacks. Moreover, the coefficients of…

Cryptography and Security · Computer Science 2024-09-20 Huan Zhou , Xiaoni Du , Xingbin Qiao , Wenping Yuan

In this paper, we present several new constructions of differentially 4-uniform permutations over $\F_{2^{2m}}$ by modifying the values of the inverse function on some subsets of $\F_{2^{2m}}$. The resulted differentially 4-uniform…

Information Theory · Computer Science 2023-07-19 Zhengbang Zha , Lei Hu , Siwei Sun , Jinyong Shan

In this paper, we investigate the differential and boomerang properties of a class of binomial $F_{r,u}(x) = x^r(1 + u\chi(x))$ over the finite field $\mathbb{F}_{p^n}$, where $r = \frac{p^n+1}{4}$, $p^n \equiv 3 \pmod{4}$, and $\chi(x) =…

Information Theory · Computer Science 2026-01-07 Namhun Koo , Soonhak Kwon

In this paper we develop a bubble tree structure for a degenerating class of Riemannian metrics satisfying some global conformal bounds on compact manifolds of dimension 4. Applying the bubble tree structure, we establish a gap theorem, a…

Differential Geometry · Mathematics 2007-05-23 Alice Chang , Jie Qing , Paul Yang
‹ Prev 1 2 3 10 Next ›