English
Related papers

Related papers: In-depth analysis of S-boxes over binary finite fi…

200 papers

The Feistel Boomerang Connectivity Table ($\rm{FBCT}$), which is the Feistel version of the Boomerang Connectivity Table ($\rm{BCT}$), plays a vital role in analyzing block ciphers' ability to withstand strong attacks, such as boomerang…

Information Theory · Computer Science 2024-08-22 Yuxuan Lu , Sihem Mesnager , Nian Li , Lisha Wang , Xiangyong Zeng

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

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

Boukerrou et al. (IACR Trans. Symmetric Cryptol. 2020(1), 331-362) introduced the notion of Feistel Boomerang Connectivity Table (FBCT), the Feistel counterpart of the Boomerang Connectivity Table (BCT), and the Feistel boomerang uniformity…

Information Theory · Computer Science 2023-10-31 Yuying Man , Nian Li , Zejun Xiang , Xiangyong Zeng

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

It is well-known that functions over finite fields play a crucial role in designing substitution boxes (S-boxes) in modern block ciphers. In order to analyze the security of an S-box, recently, three new tables have been introduced: the…

Cryptography and Security · Computer Science 2025-01-28 Kirpa Garg , Sartaj Ul Hasan , Constanza Riera , Pantelimon Stanica

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

In EUROCRYPT 2018, Cid $et\;al.$ introduced a new concept on the cryptographic property of S-boxes to evaluate the subtleties of boomerang-style attacks. This concept was named as boomerang connectivity table (BCT for short) . For a power…

Cryptography and Security · Computer Science 2022-02-01 Ziying Zhang , Haode Yan , Zhen Li

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

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

Let $q = p^m$, where $p$ is an odd prime number and $m$ is a positive integer. In this paper, we examine the finite field $\mathbb{F}_{q^2}$, which consists of $q^2$ elements. We first present an alternative method to determine the…

Cryptography and Security · Computer Science 2025-01-15 Sihem Mesnager , Huawei Wu

The Feistel Boomerang Connectivity Table (FBCT) was proposed as the feistel counterpart of the Boomerang Connectivity Table. The entries of the FBCT are actually related to the second-order zero differential spectrum. Recently, several…

Information Theory · Computer Science 2024-10-17 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

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

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

This paper deals with Niho functions which are one of the most important classes of functions thanks to their close connections with a wide variety of objects from mathematics, such as spreads and oval polynomials or from applied areas,…

Information Theory · Computer Science 2023-05-25 Zhexin Wang , Sihem Mesnager , Nian Li , Xiangyong Zeng

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

The Feistel Boomerang Connectivity Table and the related notion of $F$-Boomerang uniformity (also known as the second-order zero differential uniformity) has been recently introduced by Boukerrou et al.~\cite{Bouk}. These tools shall…

Information Theory · Computer Science 2023-10-24 Kirpa Garg , Sartaj Ul Hasan , Constanza Riera , Pantelimon Stanica

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

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

Vectorial Boolean functions are crucial building-blocks in symmetric ciphers. Different known attacks on block ciphers have resulted in diverse cryptographic criteria for vectorial Boolean functions, such as differential uniformity and…

Information Theory · Computer Science 2019-08-21 Anne Canteaut , Lukas Kölsch , Chao Li , Chunlei Li , Kangquan Li , Longjiang Qu , Friedrich Wiemer
‹ Prev 1 2 3 10 Next ›