English
Related papers

Related papers: Low differentially uniform permutations from Dobbe…

200 papers

Functions with low differential uniformity can be used in a block cipher as S-boxes since they have good resistance to differential attacks. In this paper we consider piecewise constructions for permutations with low differential…

Information Theory · Computer Science 2020-09-22 Marco Calderini

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

Differential uniformity is a significant concept in cryptography as it quantifies the degree of security of S-boxes respect to differential attacks. Power functions of the form $F(x)=x^d$ with low differential uniformity have been…

Information Theory · Computer Science 2020-12-09 Nian Li , Yanan Wu , Xiangyong Zeng , Xiaohu Tang

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

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

S-boxes are an important primitive that help cryptographic algorithms to be resilient against various attacks. The resilience against specific attacks can be connected with a certain property of an S-box, and the better the property value,…

Neural and Evolutionary Computing · Computer Science 2022-12-12 Marko Djurasevic , Domagoj Jakobovic , Luca Mariot , Sihem Mesnager , Stjepan Picek

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

Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secret-key block ciphers. This choice directly induces the classical version of the differential attack by the use of…

Discrete Mathematics · Computer Science 2011-01-14 Laurent Poinsot

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

We study the relation among some security parameters for vectorial Boolean functions which prevent attacks on the related block cipher. We focus our study on a recently-introduced security criterion, called weak differential uniformity,…

Cryptography and Security · Computer Science 2016-11-11 R. Aragona , M. Calderini , D. Maccauro , M. Sala

Civino et al. (2019) have shown how some diffusion layers can expose a Substitution-Permutation Network to vulnerability from differential cryptanalysis when employing alternative operations coming from groups isomorphic to the translation…

Cryptography and Security · Computer Science 2025-10-30 Marco Calderini , Roberto Civino , Riccardo Invernizzi

Substitution boxes (S-boxes) play a significant role in ensuring the resistance of block ciphers against various attacks. The Difference Distribution Table (DDT), the Feistel Boomerang Connectivity Table (FBCT), the Feistel Boomerang…

Information Theory · Computer Science 2023-09-06 Yuying Man , Sihem Mesnager , Nian Li , Xiangyong Zeng , Xiaohu Tang

In this paper we generalize Dillon's switching method to characterize the exact $c$-differential uniformity of functions constructed via this method. More precisely, we modify some PcN/APcN and other functions with known $c$-differential…

Information Theory · Computer Science 2022-04-20 Chunlei Li , Constanza Riera , Pantelimon Stanica

Specific vectorial boolean functions, such as S-Boxes or APN functions have many applications, for instance in symmetric ciphers. In cryptography they must satisfy some criteria (balancedness, high nonlinearity, high algebraic degree,…

Cryptography and Security · Computer Science 2014-11-11 Jean-Guillaume Dumas , Jean-Baptiste Orfila

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

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

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

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

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

Recently, a new concept called the $c$-differential uniformity was proposed by Ellingsen et al. (2020), which allows to simplify some types of differential cryptanalysis. Since then, finding functions having low $c$-differential uniformity…

Information Theory · Computer Science 2022-06-27 Jaeseong Jeong , Namhun Koo , Soonhak Kwon
‹ Prev 1 2 3 10 Next ›