English
Related papers

Related papers: Cubic power functions with optimal second-order di…

200 papers

Functions with low c-differential uniformity have optimal resistance to some types of differential cryptanalysis. In this paper, we investigate the c-differential uniformity of power functions over finite fields. Based on some known almost…

Information Theory · Computer Science 2020-08-28 Zhengbang Zha , Lei Hu

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

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

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

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

We study the behaviour of the algebraic degree of vectorial Boolean functions when their inputs are restricted to an affine subspace of their domain. Functions which maintain their degree on all subspaces of as high a codimension as…

Commutative Algebra · Mathematics 2025-07-31 Claude Carlet , Serge Feukoua , Ana Salagean

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

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

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

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

Let $q$ be an odd prime power. Let $F_1(x)=x^{d_1}$ and $F_2(x)=x^{d_2}$ be power mappings over $\mathrm{GF}(q^2)$, where $d_1=q-1$ and $d_2=d_1+\frac{q^2-1}{2}=\frac{(q-1)(q+3)}{2}$. In this paper, we study the the boomerang uniformity of…

Information Theory · Computer Science 2022-03-02 Zhen Li , Haode Yan

Constructing $2m$-variable Boolean functions with optimal algebraic immunity based on decomposition of additive group of the finite field $\mathbb{F}_{2^{2m}}$ seems to be a promising approach since Tu and Deng's work. In this paper, we…

Cryptography and Security · Computer Science 2013-04-11 Jia Zheng , Baofeng Wu , Yufu Chen , Zhuojun Liu

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

To resist algebraic attack, a Boolean function should possess good algebraic immunity (AI). Several papers constructed symmetric functions with the maximum algebraic immunity $\lceil \frac{n}{2}\rceil $. In this correspondence we prove that…

Cryptography and Security · Computer Science 2007-05-23 Na Li , Wen-feng Qi

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

We give a geometric characterization of vectorial boolean functions with differential uniformity less or equal to 4.

Algebraic Geometry · Mathematics 2009-07-13 Yves Aubry , François Rodier

The second-order differential equation for the Uehling potential is derived explicitly. The right side of this differential equation is a linear combination of the two Macdonald's functions $K_{0}(b r)$ and $K_{1}(b r)$. This central…

Quantum Physics · Physics 2024-03-05 Alexei M. Frolov

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 derive properties of powers of a function satisfying a second-order linear differential equation. In particular we prove that the n-th power of the function satisfies an (n+1)-th order differential equation and give a simple method for…

Classical Analysis and ODEs · Mathematics 2015-07-29 Naoki Marumo , Toshinori Oaku , Akimichi Takemura

Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…

Cryptography and Security · Computer Science 2023-09-21 Jinjie Gao , Haibin Kan , Yuan Li , Jiahua Xu , Qichun Wang
‹ Prev 1 2 3 10 Next ›