Improved differential attacks on the reduced-round SNOW-V and SNOW-Vi stream cipher

Ma, Sudong; Jin, Chenhui; Guan, Jie; Liu, Shuai

doi:10.1016/j.jisa.2022.103379

Cited by 8 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Differential attacks involve obtaining information or keys in an encrypted system by analyzing the differences between various inputs [43]. Based on our experiments, a change in 1 bit of the initial key results in nearly a 50% alteration in the bits of the key in each round.…”

Section: Differential Attacksmentioning

confidence: 98%

“…Side-channel attacks exploit information leaked through non-traditional channels, such as power consumption, electromagnetic radiation, time delays, etc., to extract round keys or sensitive data [42]. The demonstrated independence and sensitivity of our algorithm imply that even if an attacker manages to obtain the round key for a specific round, calculating the round key and initial key for other rounds becomes challenging.…”

Section: Side-channel Attacksmentioning

confidence: 99%

See 1 more Smart Citation

Advancing Key Expansion Techniques: Integrating Cross-Coupled Map Lattice and Dynamic S- Box for Superior Cryptographic Security

2024

Preprint

View full text Add to dashboard Cite

This research investigates the security loopholes inherent in the traditional Advanced Encryption Standard (AES) key expansion mechanism, notably its sequential and reversible configuration that permits the derivation of subsequent round keys from any obtained round key. To counteract these vulnerabilities, we introduce a novel key expansion strategy that leverages dynamic Substitution-boxes (S-boxes) alongside the innovative application of cross-coupled lattice mapping. Our approach includes the development of a new one-dimensional chaotic map integrated into the cross-coupled map lattice to enhance its chaotic dynamics. Utilizing this enhanced lattice, we devise a dynamic S-box generation method. This method, rooted in the cross-coupled lattice mapping of a spatiotemporal chaotic system, yields an S-box with unique security features. Rigorous testing and validation demonstrate the S-box's superior defense against a broad spectrum of cryptographic threats. Furthermore, by embedding cross-coupled lattice mapping into the key expansion routine, we elevate the algorithm's complexity and render it non-reversible. This iterative implementation of the lattice mapping negates the possibility of deducing any round key or the original key from a single round key. Exhaustive experimental analyses validate the proposed key expansion algorithm's independence and adaptability, underscoring its improved security capabilities. The algorithm exhibits robust resistance to conventional side-channel and differential attacks, performing exceptionally in real-world application scenarios. Our study delivers a groundbreaking key expansion methodology that significantly enhances cryptographic security, offering a substantial contribution to the encryption domain and strengthening the overall security infrastructure of encryption algorithms.

show abstract

Section: Differential Attacksmentioning

confidence: 98%

Section: Side-channel Attacksmentioning

confidence: 99%

Advancing Key Expansion Techniques: Integrating Cross-Coupled Map Lattice and Dynamic S- Box for Superior Cryptographic Security

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…A differential attack is a technique used to extract information or keys in an encrypted system by analyzing the differences between various inputs [52]. Experimental results…”

Section: Differential Attackmentioning

confidence: 99%

Advanced Key Expansion Algorithm Using a High-Performance Four-Dimensional Chaotic Map and a Strong S-Box for Enhanced Sensitivity and Independence

2024

Preprint

View full text Add to dashboard Cite

The round key plays a critical role in the security of block encryption algorithms, being derived from the initial key through the key expansion process to bolster security. In this study, we introduce a novel key expansion algorithm powered by a high-performance four-dimensional chaotic map and a robust S-box, notable for its sensitivity and independence of keys, thereby strengthening defense against various cryptographic attacks. We present a four-dimensional chaotic map, celebrated for its outstanding dynamic properties as confirmed through detailed behavior analysis. Additionally, we propose an S-box generation technique based on operations in the finite field GF(28), resulting in an S-box with high nonlinearity and enhanced security. This S-box is carefully crafted to eliminate typical weaknesses such as fixed points, reverse fixed points, and short periods, making it suitable for key expansion applications. Utilizing the advantages of the chaotic map and S-box, we elaborate on our key expansion algorithm and demonstrate its security effectiveness through thorough evaluation, showcasing its promise as a potent instrument in cryptographic security.

show abstract

“…Differential attack is another commonly used method in cryptanalysis. It aims to obtain key information, such as the key or plaintext, by analyzing the output differences of cryptographic algorithms when subjected to different input differences [30]. The fundamental concept behind a differential attack is to select a pair of input plaintexts with a small difference between them and observe the resulting output difference during the algorithm's execution.…”

Section: Ability To Resist Differential Attacksmentioning

confidence: 99%

Application of high performance one-dimensional chaotic map in key expansion algorithm

2023

Preprint

View full text Add to dashboard Cite

In this paper, we present a key expansion algorithm based on a high-performance one-dimensional chaotic map. Traditional one-dimensional chaotic maps exhibit several limitations, prompting us to construct a new map that overcomes these shortcomings. By analyzing the structural characteristics of classic 1D chaotic maps, we propose a high-performance 1D map that outperforms multidimensional maps introduced by numerous researchers in recent years. In block cryptosystems, the security of round keys is of utmost importance. To ensure the generation of secure round keys, a sufficiently robust key expansion algorithm is required. The security of round keys is assessed based on statistical independence and sensitivity to the initial key. Leveraging the properties of our constructed high-performance chaotic map, we introduce a chaotic key expansion algorithm. Our experimental results validate the robust security of our proposed key expansion algorithm, demonstrating its resilience against various attacks. The algorithm exhibits strong statistical independence and sensitivity to the initial key, further strengthening the security of the generated round keys.

show abstract

Improved differential attacks on the reduced-round SNOW-V and SNOW-Vi stream cipher

Cited by 8 publications

References 4 publications

Advancing Key Expansion Techniques: Integrating Cross-Coupled Map Lattice and Dynamic S- Box for Superior Cryptographic Security

Advancing Key Expansion Techniques: Integrating Cross-Coupled Map Lattice and Dynamic S- Box for Superior Cryptographic Security

Advanced Key Expansion Algorithm Using a High-Performance Four-Dimensional Chaotic Map and a Strong S-Box for Enhanced Sensitivity and Independence

Application of high performance one-dimensional chaotic map in key expansion algorithm

Contact Info

Product

Resources

About