Javascript must be enabled to continue!
Cryptanalysis on Reduced-Round 3D and Saturnin
View through CrossRef
Abstract3D is an Advanced Encryption Standard (AES)-like cipher employed 3D structure proposed in 2008. The main innovation of 3D is the multi-dimensional state, generalizing the design of Rijndael and allowing block sizes beyond the 256-bit boundary. Saturnin, a lightweight block cipher has been selected as a second-round candidate in the National Institute of Standards and Technology standardization for lightweight cryptography. It also employs a 3D structure and provides high security against quantum and classic attacks. The exchange-equivalence attacks proposed by Bardeh and Rønjom consider how quadruples of plaintexts confirm distinguishable properties for AES. It is similar to the principle of yoyo attack, but it can find a longer number of rounds of distinguisher. In this paper, we investigate the exchange-equivalence attack on 3D and yoyo attack on Saturnin. Our new results turn out to be the first secret-key chosen plaintext distinguisher for 10-round 3D. The complexity of the distinguisher is about $2^{364.2}$ in terms of data, memory and computational complexity. For Saturnin, we propose the first six-super-round impossible differential yoyo attack, which is suitable for the two-S-layer version. Compared with the previous impossible differential attacks in the design report of Saturnin, the attacks presented here are the best in terms of the complexity under the chosen-plaintext scenario.
Title: Cryptanalysis on Reduced-Round 3D and Saturnin
Description:
Abstract3D is an Advanced Encryption Standard (AES)-like cipher employed 3D structure proposed in 2008.
The main innovation of 3D is the multi-dimensional state, generalizing the design of Rijndael and allowing block sizes beyond the 256-bit boundary.
Saturnin, a lightweight block cipher has been selected as a second-round candidate in the National Institute of Standards and Technology standardization for lightweight cryptography.
It also employs a 3D structure and provides high security against quantum and classic attacks.
The exchange-equivalence attacks proposed by Bardeh and Rønjom consider how quadruples of plaintexts confirm distinguishable properties for AES.
It is similar to the principle of yoyo attack, but it can find a longer number of rounds of distinguisher.
In this paper, we investigate the exchange-equivalence attack on 3D and yoyo attack on Saturnin.
Our new results turn out to be the first secret-key chosen plaintext distinguisher for 10-round 3D.
The complexity of the distinguisher is about $2^{364.
2}$ in terms of data, memory and computational complexity.
For Saturnin, we propose the first six-super-round impossible differential yoyo attack, which is suitable for the two-S-layer version.
Compared with the previous impossible differential attacks in the design report of Saturnin, the attacks presented here are the best in terms of the complexity under the chosen-plaintext scenario.
Related Results
Practical Attacks on Reduced-Round 3D and Saturnin
Practical Attacks on Reduced-Round 3D and Saturnin
Abstract3D, an advanced encryption standard-like cipher employed three-dimensional structure, was proposed in 2008. Its recommended number of rounds is 22. Although the longest key...
Iøjnefaldende arkitektur – Nordens middelalderlige rundkirker
Iøjnefaldende arkitektur – Nordens middelalderlige rundkirker
Conspicuous architecture. Medieval round churches in ScandinaviaThe aim of this article is partly to argue why round churches were built and partly to present an updated overview o...
Differential, Linear, and Meet‐in‐the‐Middle Attacks on the Lightweight Block Cipher RBFK
Differential, Linear, and Meet‐in‐the‐Middle Attacks on the Lightweight Block Cipher RBFK
Randomized butterfly architecture of fast Fourier transform for key cipher (RBFK) is the lightweight block cipher for Internet of things devices in an edge computing environment. A...
Deep Learning-Based Cryptanalysis of a Simplified AES Cipher
Deep Learning-Based Cryptanalysis of a Simplified AES Cipher
Recently, Deep Neural Networks have shown great deal of reliability and applicability as its applications spread in different areas. This paper proposes a cryptanalysis model based...
SCF Equations for T/Y and K Square-to-Round Tubular Joint
SCF Equations for T/Y and K Square-to-Round Tubular Joint
Summary
A parametric stress analysis of T/Y and K square-to-round tubular joints subjected to axial loads and in-plane and out-of-plane bending moments has been p...
Linear Cryptanalysis
Linear Cryptanalysis
Applications of cryptography are plenty in everyday life. This guidebook is about the security analysis or 'cryptanalysis' of the basic building blocks on which these applications ...
Selecting Rotation Constants on SIMON-Type Ciphers
Selecting Rotation Constants on SIMON-Type Ciphers
In 2013, a lightweight block cipher SIMON is proposed by NSA. This paper tries to investigate this design criterion in terms of resisting against impossible differential cryptanaly...
Differential–Linear Approximations of CHAM
Differential–Linear Approximations of CHAM
CHAM is a family of lightweight block ciphers designed for resource-constrained environments like IoT devices and embedded systems, which require low power consumption and high per...

