Proceedings ArticleDOI
Cryptanalysis of Four-Round DES Based on Genetic Algorithm
Jun Song,Huanguo Zhang,Qingshu Meng,Zhangyi Wang +3 more
- pp 2326-2329
TLDR
The results indicate that genetic algorithm is successful at breaking the four-round DES cipher, but perhaps more significantly, this is a promising method applied to break other Feistel block cipher.Abstract:
In this paper, we present a new approach for cryptanalysis of four-round DES based on genetic algorithm. An efficient fitness measure is used to find some optimum keys with higher fitness values. Some valuable bits in these optimum keys which generate apparent deviation from the other observed bits will turn up. Then, these valuable bits can be applied to find other bits. The results indicate that genetic algorithm is successful at breaking the four-round DES cipher, but perhaps more significantly, this is a promising method applied to break other Feistel block cipher.read more
Citations
More filters
Journal ArticleDOI
Cryptanalysis of an EPC Class-1 Generation-2 Standard Compliant Authentication Protocol
TL;DR: It is shown that the proposed mutual authentication protocol fails short of its security objectives, and in fact offers the same security level than the EPC standard it tried to correct, and a new EPC-friendly protocol, named Azumi, which may be considered a significant step toward the security of Gen-2 compliant tags.
Proceedings ArticleDOI
Cryptanalysis of Four-Rounded DES Using Ant Colony Optimization
TL;DR: The results of the experiments show that ACO is an effective technique for the cryptanalysis of four-rounded DES, the first time that BACO has been used for this specific problem.
Proceedings ArticleDOI
Cryptanalysis of four-rounded DES using binary particle swarm optimization
TL;DR: A highly efficient Binary PSO based cryptanalysis approach for four-rounded DES that has shown promising results over cryptanalysis of DES performed using other methods such as Genetic Algorithm.
Journal ArticleDOI
Cryptanalysis of TEA Using Quantum-Inspired Genetic Algorithms
TL;DR: Quan-tum-inspired genetic algorithms (QGAs) are used in the cryptanalysis of TEA to show that QGAs could discover distinguishers for reduced cycle TEA that are more efficient than those found by classical GAs in two earlier studies.
Book ChapterDOI
Applications of Genetic Algorithms in Cryptology
TL;DR: Findings show that the work on nature inspired computing in cryptology is minimal but the applications of genetic algorithms are increasing, and further insight research is needed to tackle various problems of modern cryptography using genetic or other evolutionary computing techniques.
References
More filters
Book ChapterDOI
Linear cryptanalysis method for DES cipher
TL;DR: A new method is introduced for cryptanalysis of DES cipher, which is essentially a known-plaintext attack, that is applicable to an only-ciphertext attack in certain situations.
Journal ArticleDOI
The Data Encryption Standard (DES) and its strength against attacks
TL;DR: Some of the safeguards against differential cryptanalysis that were built into the DES system from the beginning are shown, with the result that more than 10 15 bytes of chosen plaintext are required for this attack to succeed.
Journal ArticleDOI
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
W. Diffie,M.E. Hellman +1 more
TL;DR: For centuries, cryptography has been a valuable asset of the military and diplomatic communities as discussed by the authors, and it is so valuable that its practice has usually been shrouded in secrecy and mystery, which is why its use has been so valuable.
Book ChapterDOI
The First Experimental Cryptanalysis of the Data Encryption Standard
TL;DR: An improved version of linear cryptanalysis is described and its application to the first, successful computer experiment in breaking the full 16-round DES with high success probability if 243 random plaintexts and their ciphertexts are available.
Journal ArticleDOI
Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers
TL;DR: In this paper, a new approach to cryptanalysis based on the application of a directed random search algorithm called a genetic algorithm is proposed, which is shown that such a algorithm could be used to discover the key for a simple substitution cipher.