Oct 2026· IACR Communications in Cryptology· Vol 3· 0 citations· 57 references
TL;DR
The structure of LS-designs enables us to derive non-trivial mathematical upper bounds on the minimum number of active S-boxes in their linear and differential trails, and it is shown how such mathematical bounds can be used in complement with tool-based bounds obtained from SAT solvers.
Abstract
LS-designs, proposed at FSE 2014, are a conceptually simple family of block ciphers, where a bitslice S-box and a linear L-box are independently applied to the state. They are known for enabling efficiently masked implementations against side-channel attacks. In this paper, we consolidate the understanding of their security against linear and differential cryptanalysis. For this purpose, we first show that the structure of LS-designs enables us to derive non-trivial mathematical upper bounds on the minimum number of active S-boxes in their linear and differential trails. These bounds are a convenient addition to existing lower bounds based on the L-box branch number, as they provide a direct indication on the security claims' tightness. We then show how such mathematical bounds can be used in complement with tool-based bounds obtained from SAT solvers. Applied to the (128-bit, non-involutive) cipher Fantomas, this allows us to confirm the tightness of existing results on the number of active S-boxes for up to 16 rounds. We also show that our theoretical upper bound and SAT-based search are applicable to NSA's low-latency cipher ARADI, which uses L-boxes that vary over the rounds. We hope these results can facilitate the design space exploration of new LS-designs, possibly operating on larger states.
A new, two-step approach to the construction of highly nonlinear S-boxes, with group-theoretic underpinnings, and is incorporated into a multi-round grayscale image-encryption scheme based on fixed S-box substitution, key- and nonce-dependent position permutation, SHA-256-based keystream whitening, and a final bidirect...
A. Razzaque, Hafiza Zara Mustafa, Dilshad Alghazzawi et al.· PLoS ONE· 0 citations
Error-correcting codes are a useful tool in cryptography, being used both to design schemes whose hardness relies on coding theory problems (the area typically known as code-based cryptography) but also as a building block in other contexts, such as proof systems and associated cryptographic argument systems. Among all...
We revisit DM-RSA, an RSA variant that uses two independent moduli, whose original version was broken by H{\aa}stad's attack and contained an incorrect compromise-tolerance claim. We give a formal treatment of its repaired variant, DM-RSA-OAEP: (i) a complete IND-CCA2 security proof in the random-oracle model via a two...
This work proposes CCHPC1.1, an arbitrary-order masked gadget construction that improves Constant-Cycle Hardware Private Circuits (CCHPC) while preserving security in the Robust but Relaxed (RR) d-probing model and under the Probe- Isolating Non-Interference (PINI) composability notion.
Daniel Lammers, Lukas Weber, A. Moradi· IACR Transactions on Cryptog...· 0 citations
The compressed permutation oracle has been used to analyze the quantum security of a number of cryptographic constructions which resisted prior techniques. However, these analyses were fundamentally limited by the poor soundness of the method: the technique was proven sound only up to $O(N^{1/12})$ queries to permutati...
The MPC-in-the-Head paradigm is widely used to build post-quantum digital signatures as it provides a versatile way to design Proofs of Knowledge based on hard problems. Despite similarities among the MPC-in-the-Head based schemes, differences in size and performance persist among these schemes, fundamentally determine...
L. Bidoux, Jesús-Javier Chi-Domínguez, Eduardo Ochoa-Jiménez· IACR Communications in Crypt...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.