SearcharxivSearch

arXiv · 2310.13775

The second-order zero differential spectra of some APN and other maps over finite fields

Abstract

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 provide a major impetus in the analysis of the security of the Feistel network-based ciphers. In the same paper, a characterization of almost perfect nonlinear functions (APN) over fields of even characteristic in terms of second-order zero differential uniformity was also given. Here, we find a sufficient condition for an odd or even function over fields of odd characteristic to be an APN function, in terms of second-order zero differential uniformity. Moreover, we compute the second-order zero differential spectra of several APN or other low differential uniform functions, and show that our considered functions also have low second-order zero differential uniformity, though it may vary widely, unlike the case for even characteristic when it is always zero.

Explore related subjects

Keep this discovery

BibTeXRIS

Kirpa Garg, Sartaj Ul Hasan, Constanza Riera, Pantelimon Stanica. 2023-10-20. The second-order zero differential spectra of some APN and other maps over finite fields. https://doi.org/10.1142/s0219498825410026

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

A New Algebraic Algorithm for LWE

The Learning With Errors (LWE) problem, introduced by Regev in 2005, is central to modern cryptography and post-quantum security. The algorithms to solve the search version of the problem, Search-LWE, can be broadly categorised into algebraic, combinatorial and lattice-based. In this work we propose a new algebraic algorithm for the Search-LWE problem. At a high level, the algorithm combines linear-algebraic techniques with S-polynomial-based methods from Groebner basis computation. We provide a direct complexity analysis of our algorithm, avoiding semi-regularity assumptions and complexity bounds derived from the degree of regularity. Our algorithm achieves a polynomial improvement in complexity over prior results that use Groebner basis methods to solve Search-LWE.

cs.CR

Eavesdropping on Goal-Oriented Communication: Timing Attacks and Countermeasures

Goal-oriented communication is a new paradigm that considers the meaning of transmitted information to optimize communication. One possible application is the remote monitoring of a process under communication costs: scheduling updates based on goal-oriented considerations can significantly reduce transmission frequency while maintaining high-quality tracking performance. However, goal-oriented scheduling also opens a timing-based side-channel that an eavesdropper may exploit to obtain information about the state of the remote process, even if the content of updates is perfectly secure. In this work, we study an eavesdropping attack against pull-based goal-oriented scheduling for the tracking of remote Markov processes. We provide a theoretical framework for defining the effectiveness of the attack and of possible countermeasures, as well as a practical heuristic that can provide a balance between the performance gains offered by goal-oriented communication and the information leakage.

eess.SY

The revised boomerang connectivity tables and their connection to the Difference Distribution Table

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 Extended Boomerang Connectivity Table (EBCT), the Lower Boomerang Connectivity Table (LBCT), and the Upper Boomerang Connectivity Table (UBCT). In fact, these tables offer improved methods over the usual Boomerang Connectivity Table (BCT) for analyzing the security of S-boxes against boomerang-style attacks. Here, we put in context these new EBCT, LBCT, and UBCT concepts by connecting them to the DDT for a differentially $δ$-uniform function and also determine the EBCT, LBCT, and UBCT entries of three classes of differentially $4$-uniform power permutations, namely, Gold, Kasami and Bracken-Leander. We also determine the Double Boomerang Connectivity Table (DBCT) entries of the Gold function. As byproducts of our approach, we obtain some previously published results quite easily.

cs.CR