Cryptanalysis of four-rounded DES using binary particleswarm optimization

Authors:
Waseem Shahzad;Abdul Basit Siddiqui;Farrukh Aslam Khan
Affiliations:
FAST National University of Computer and Emerging Sciences, Islamabad, Pakistan;FAST National University of Computer and Emerging Sciences, Islamabad, Pakistan;FAST National University of Computer and Emerging Sciences, Islamabad, Pakistan
Venue:
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Year:
2009

Citing 8
Cited 1

Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers

Cryptologia
The Data Encryption Standard (DES) and its strength against attacks

IBM Journal of Research and Development
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Genetic Cryptoanalysis of Two Rounds TEA

ICCS '02 Proceedings of the International Conference on Computational Science-Part III
The First Experimental Cryptanalysis of the Data Encryption Standard

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Finding suitable differential characteristics for block ciphers with Ant colony technique

ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Cryptanalysis of substitution ciphers using scatter search

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
On the computation of all global minimizers through particle swarm optimization

IEEE Transactions on Evolutionary Computation

Cryptanalysis of four-rounded DES using binary artificial immune system

ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cryptanalysis of feistel ciphers is difficult due to their high nonlinearity and autocorrelation. On the other hand, substitution ciphers are easily breakable due to their simpler encryption process. In this paper, a highly efficient Binary Particle Swarm Optimization (PSO) based cryptanalysis approach for four-rounded Data Encryption Standard (DES) is presented. Several optimum keys are generated in different runs of the algorithm on the basis of their fitness value and finally, the real key is found by guessing every individual bit. The robustness of the proposed technique is also checked for eight-rounded DES. Our approach shows promising results when compared with the cryptanalysis of DES performed by other techniques such as Genetic Algorithm (GA).