English
Related papers

Related papers: On the differential spectrum of a class of power f…

200 papers

We give complete and exact descriptions of spaces of ultradifferentiable functions that are closed under composition with either holomorphic or ultradifferentiable functions -- which are two distinct cases. The proof works by considering…

Classical Analysis and ODEs · Mathematics 2017-02-14 Jürgen Pöschel

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

In this paper, we address the problem of secure distributed computation in scenarios where user data is not uniformly distributed, extending existing frameworks that assume uniformity, an assumption that is challenging to enforce in data…

Information Theory · Computer Science 2025-01-28 Saar Tarnopolsky , Zirui , Deng , Vinayak Ramkumar , Netanel Raviv , Alejandro Cohen

Binary field extensions are fundamental to many applications, such as multivariate public key cryptography, code-based cryptography, and error-correcting codes. Their implementation requires a foundation in number theory and algebraic…

Information Theory · Computer Science 2024-02-20 Mohamadou Sall , M. Anwar Hasan

This paper presents new limit theorems for power variation of fractional type symmetric infinitely divisible random fields. More specifically, the random field $X = (X(\boldsymbol{t}))_{\boldsymbol{t} \in [0,1]^d}$ is defined as an integral…

Probability · Mathematics 2022-02-22 Andreas Basse-O'Connor , Vytautė Pilipauskaitė , Mark Podolskij

In this article, we introduce new notions $cc$-differential uniformity, $cc$-differential spectrum, PccN functions and APccN functions, and investigate their properties. We also introduce $c$-CCZ equivalence, $c$-EA equivalence, and…

Information Theory · Computer Science 2023-01-24 Nhan-Phu Chung , Jaeseong Jeong , Namhun Koo , Soonhak Kwon

In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…

Computational Complexity · Computer Science 2020-09-01 Rohit Agrawal

We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs - secure function evaluation (SFE) and differential privacy. While in both the goal is to privately evaluate some…

Cryptography and Security · Computer Science 2011-03-15 Amos Beimel , Kobbi Nissim , Eran Omri

The differential-linear connectivity table (DLCT), introduced by Bar-On et al. at EUROCRYPT'19, is a novel tool that captures the dependency between the two subciphers involved in differential-linear attacks. This paper is devoted to…

Information Theory · Computer Science 2025-08-05 Xi Xie , Nian Li , Qiang Wang , Xiangyong Zeng , Yinglong Du

A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work is the necessity of a broadcast channel for securely…

Cryptography and Security · Computer Science 2021-05-05 Ran Cohen , Iftach Haitner , Eran Omri , Lior Rotem

Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…

Number Theory · Mathematics 2015-06-26 Francois Rodier

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

In this article, we focus on the concept of locally-APN-ness (``APN" is the abbreviation of the well-known notion of Almost Perfect Nonlinear) introduced by Blondeau, Canteaut, and Charpin, which makes the corpus of S-boxes somehow larger…

Information Theory · Computer Science 2022-08-05 Xi Xie , Sihem Mesnager , Nian Li , Debiao He , Xiangyong Zeng

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

S-Boxes are important security components of block ciphers. We provide theoretical results on necessary or sufficient criteria for an (invertible) 4-bit S-Box to be weakly APN. Thanks to a classification of 4-bit invertible S-Boxes achieved…

Cryptography and Security · Computer Science 2016-04-01 Claudio Fontanari , Valentina Pulice , Anna Rimoldi , Massimiliano Sala

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

We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…

Cryptography and Security · Computer Science 2007-05-23 Ilia Toli

We derive a proof of security for the Differential Phase Shift Quantum Key Distribution (DPSQKD) protocol under the assumption that Eve is restricted to individual attacks. The security proof is derived by bounding the average collision…

Quantum Physics · Physics 2009-11-11 Edo Waks , Hiroki Takesue , Yoshihisa Yamamoto

Differential privacy is a mathematical framework for developing statistical computations with provable guarantees of privacy and accuracy. In contrast to the privacy component of differential privacy, which has a clear mathematical and…

Cryptography and Security · Computer Science 2020-11-13 Gilles Barthe , Rohit Chadha , Paul Krogmeier , A. Prasad Sistla , Mahesh Viswanathan

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