Javascript must be enabled to continue!
Problems and Progressive Cryptanalysis of Prominent Block Ciphers
View through CrossRef
Practical cracking of Data Encryption Standard (DES) and mathematical cracking of Advanced Encryption Standard (AES) is seriously questionable despite the fact that AES retains good length of the encryption key, but still all encryption rounds have been cracked mathematically. Therefore, there is a need to revisit the cracking excursion of these well-known cryptosystems to inquire into potential discrepancies associated with them and to evolve the design of future block ciphers. Thus, this study aims to enlighten the cryptanalysis journey of AES and DES, including all DES variants (TDES, DESX and DEX+) to discuss latent weaknesses, issues and problems associated with these block ciphers. To accomplish this review task, quality of related studies was collected from several well-known research repositories and each study was critically analyzed. Earlier review-efforts were found relatively marginal in scope, capacity and are not up-to-date with the latest issues, and cryptanalysis results thereby differ with this work. The resultant discussion shows that known parameters like static substitution, static permutation, fixed block size and repeated encryption rounds with a similar set of encryption operations support the crackers in executing effective cryptanalysis in symmetric block ciphers. Therefore, encrypting the secret data with too many repeated encryption rounds with identical encryption operations is not as effective in enhancing the security of symmetric block cipher as it is usually believed.
Title: Problems and Progressive Cryptanalysis of Prominent Block Ciphers
Description:
Practical cracking of Data Encryption Standard (DES) and mathematical cracking of Advanced Encryption Standard (AES) is seriously questionable despite the fact that AES retains good length of the encryption key, but still all encryption rounds have been cracked mathematically.
Therefore, there is a need to revisit the cracking excursion of these well-known cryptosystems to inquire into potential discrepancies associated with them and to evolve the design of future block ciphers.
Thus, this study aims to enlighten the cryptanalysis journey of AES and DES, including all DES variants (TDES, DESX and DEX+) to discuss latent weaknesses, issues and problems associated with these block ciphers.
To accomplish this review task, quality of related studies was collected from several well-known research repositories and each study was critically analyzed.
Earlier review-efforts were found relatively marginal in scope, capacity and are not up-to-date with the latest issues, and cryptanalysis results thereby differ with this work.
The resultant discussion shows that known parameters like static substitution, static permutation, fixed block size and repeated encryption rounds with a similar set of encryption operations support the crackers in executing effective cryptanalysis in symmetric block ciphers.
Therefore, encrypting the secret data with too many repeated encryption rounds with identical encryption operations is not as effective in enhancing the security of symmetric block cipher as it is usually believed.
Related Results
On Statistical Testing of Block Ciphers
On Statistical Testing of Block Ciphers
Block ciphers form one of the main classes of cryptographic algorithms. One of the challenges in development of block ciphers, like any other cryptographic algorithms, is the analy...
Practical Attacks of Round-Reduced SIMON Based on Deep Learning
Practical Attacks of Round-Reduced SIMON Based on Deep Learning
Abstract
At CRYPTO’19, Gohr built a bridge between deep learning and cryptanalysis. Based on deep neural networks, he trained neural distinguishers of SPECK32/64. Be...
An efficient permutation approach for SbPN-based symmetric block ciphers
An efficient permutation approach for SbPN-based symmetric block ciphers
AbstractIt is challenging to devise lightweight cryptographic primitives efficient in both hardware and software that can provide an optimum level of security to diverse Internet o...
Generalized differential-linear cryptanalysis of block cipher
Generalized differential-linear cryptanalysis of block cipher
Differential-linear cryptanalysis of block ciphers was proposed in 1994. It turns out to be more efficient in comparison with (separately) differential and linear cryptanalytic met...
Codes and Provable Security of Ciphers
Codes and Provable Security of Ciphers
While the design of block ciphers that are provably secure against all attacks, still eludes us, it is possible to make designs that resist differential and linear cryptanalysis, w...
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...
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...
Accelerating the Best Trail Search on AES-Like Ciphers
Accelerating the Best Trail Search on AES-Like Ciphers
In this study, we accelerate Matsui’s search algorithm to search for the best differential and linear trails of AES-like ciphers. Our acceleration points are twofold. The first exp...

