Abstract
Cryptanalysis with genetic algorithm has attracted much interest in recent years. This paper presents an approach for the cryptanalysis of two-round DES based on genetic algorithm. However, cryptanalysis of two-round DES using genetic algorithm is usually a difficult task. In this paper, we adopt known plaintext attack and produce a variety of optimum keys based on fitness function. Furthermore, we count every bit of optimal keys one by one, and find some valuable bits, which generate a significant deviation from the other observed bits. Finally, the 56-bit key is successfully gained without searching the whole search space. The experimental result indicates that this is a promising method and can be adopted to handle other complex block ciphers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI (1975)
Gold, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA (1989)
Clark, J.A.: Invited Paper. In: Nature-Inspired Cryptography: Past, Present and Future. CEC-2003, Canberra, Australia, December 2003, IEEE, Los Alamitos (2003)
Spillman, R.: Cryptanalysis of Knapsack Ciphers Using Genetic Algorithms. Cryptologia XVII(4), 367–377 (1993)
Spillman, R., Janssen, M., Nelson, B., Kepner, M.: Use of A Genetic Algorithm in the Cryptanalysis of simple substitution Ciphers. Cryptologia XVII(1), 187–201 (1993)
Clark, A.: Modern Optimisation Algorithms for Cryptanalysis, pp. 258–262. IEEE, Los Alamitos (1994)
Lin, F.-T., Kao, C.-Y.: A Genetic Algorithm for Ciphertext-Only Attack in Cryptanalysis, pp. 650–654. IEEE, Los Alamitos (1995)
Clark, A., Dawson, E.: Optimisation Heuristics for the Automated Cryptanalysis of Classical Ciphers. Journal of Combinatorial Mathematics and Combinatorial Computing, Papers in honour of Anne Penfold Street 28, 63–86 (1998)
Clark, A.J.: Optimisation Heuristics for Cryptology, PhD thesis, Queensland. University of Technology (1998)
Hernández, J.C., et al.: Genetic Cryptoanalysis of Two Rounds TEA. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J.J., Hoekstra, A.G. (eds.) Computational Science - ICCS 2002. LNCS, vol. 2331, pp. 1024–1031. Springer, Heidelberg (2002)
Laskari, E.C., Meletiouc, G.C., Stamatioud, Y.C., Vrahatis, M.N.: Evolutionary computation based cryptanalysis: A first study, pp. 823–830. Elsevier, Amsterdam (2005)
Hernández, J.C., et al.: Easing collision finding in cryptographic primitives with genetic algorithms, pp. 535–539. IEEE, Los Alamitos (2002)
Russell, M., Clark, J.A., Stepney, S.: Using Ants to Attack a Classical Cipher. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 146–147. Springer, Heidelberg (2003)
Morelli, R., Walde, R., Servos, W.: A Study of Heuristic Approaches for Breaking short Cryptograms. International Journal on Artificial Intelligence Tools 13(1), 45–64 (2004)
Bafghi, A.G., Sadeghiyan, B.: Finding Suitable Differential Characteristics for Block Ciphers with Ant Colony Technique, pp. 418–423. IEEE, Los Alamitos (2004)
Clark, J.A., Jacob, J.L., Stepney, S.: The Design of S-Boxes by Simulated Annealing, pp. 1533–1537. IEEE, Los Alamitos (2004)
Albassal, E.A.M.B., Abdel-Moneim, A.W.: Genetic Algorithm Cryptanalysis Of The Basic Substitution Permutation Network, pp. 471–475. IEEE, Los Alamitos (2004)
Garici, M.A., Drias, H.: Cryptanalysis of Substitution Ciphers Using Scatter Search. In: Mira, J.M., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 31–40. Springer, Heidelberg (2005)
Coppersmith, D.: The data encryption standard (DES) and its strength against attacks. IBM Journal of Research and Development 38(3), 243–250 (1994)
National Bureau of Standards: Data Encryption Standard, FIPS-Pub.46. National Bureau of Standards, US Department of Commerce, Washington DC (1977)
Diffie, W., Hellman, M.: Exhaustive Cryptanalysis of the NBS Data Encryption Standard. IEEE Computer 10(6), 74–84 (1977)
Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386–397. Springer, Heidelberg (1994)
Matsui, M.: The First Experimental Cryptanalysis of the Data Encryption Standard. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 1–11. Springer, Heidelberg (1994)
Biham, E., Shamir, A.: Differential Cryptanalysis of the Data Encryption Standard. Springer, Heidelberg (1993)
Biham, E., Dunkelman, O., Keller, N.: Enhancing Differential-Linear Cryptanalysis. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 254–266. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, J., Zhang, H., Meng, Q., Wang, Z. (2007). Cryptanalysis of Two-Round DES Using Genetic Algorithms. In: Kang, L., Liu, Y., Zeng, S. (eds) Advances in Computation and Intelligence. ISICA 2007. Lecture Notes in Computer Science, vol 4683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74581-5_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-74581-5_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74580-8
Online ISBN: 978-3-540-74581-5
eBook Packages: Computer ScienceComputer Science (R0)