Abstract
Recently, a quick and simple way of creating very efficient distinguishers for cryptographic primitives such as block ciphers or hash functions, was presented and proved useful by the authors. In this paper, this cryptanalytic attack (named genetic cryptanalysis after its use of genetic algorithms) is shown to be successful when applied over reduced-round versions of the block cipher XTEA. Efficient distinguishers for XTEA are proposed for up to 4 cycles (8 rounds). Additionally, a variant of this genetic attack is also introduced, and their results over the block cipher TEA presented, which are the most powerful published to date.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hernandez, J.C. and Isasi, P., “Finding Efficient Distinguishers for Cryptographic Mappings, with an Application to the Block Cipher TEA,”Proc. of the 2003 Congress on Evolutionary Computation CEC 2003, pp. 341–348, IEEE Press, 2003.
Knudsen, L. and Meier, W., “Correlations in RC6 with a Reduced Number of Rounds,”Proc. of the Seventh Fast Software Encryption Workshop, Springer-Verlag, 2000.
Shimoyama, T., Takeuchi, K. and Hayakawa, J., “Correlation Attack to the Block Cipher RC5 and the Simplified Variants of RC6,”Proc. of the Third AES Candidate Conference AES3, 2000.
Wheeler, D. and Needham, R., “TEA, A Tiny Encryption Algorithm,”Proc. of the 1995 Fast Software Encryption Workshop, pp. 97–110, Springer-Verlag, 1995.
Wagner, D., Kelsey, J. and Schneier, B., “Related-Key Cryptoanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2 and TEA,”Proc. of the ICICS’97 Conference, pp. 233–246, Springer-Verlag, 1997.
Moon, D., Kyungdeok, H. and Wonil, L., et al., “Impossible Differential Crypt-analysis of Reduced Round XTEA and TEA,”Proc. of the Fast Software Encryption, FSE 2002, Springer LNCS, 2365, pp. 49–60, Leuven, Belgium, February 4–6, 2002.
Kelsey, J., Schneier, B. and Wagner, D., “Modn Cryptoanalysis with Applications against RC5P and M6,”Proc. of the 1999 Fast Software Encryption Workshop, pp. 139–155, Springer-Verlag, 1999.
Forre, R., “The Strict Avalanche Criterion: Special Properties of Boolean Functions and Extended Definition,”Advances in Cryptology — Proc. of CRYPTO’88, LNCS, 403, pp. 450–468, Springer-Verlag, 1988.
Biham, E., Biryukov, A. and Shamir, A., “Cryptanalysis of Skipjack Reduced to 31 rounds Using Impossible Differentials,”Technion Computer Science Department Technical Report CS0947-1998.
Author information
Authors and Affiliations
Corresponding author
Additional information
Julio César Hernández Castro, Ph.D.: He received Graduate Degree in Mathematics at Complutense University, M.Sc. in Coding Theory and Network Security at Valladolid University, and a Ph.D. in Computer Science at Carlos III University. His current research is fundamentally oriented to find and develop applications of techniques of artificial intelligence to cryptography and computer security. He has published more than 50 papers in cryptography, cryptanalysis and network security at International Journals and Conferences. He loves chess and go. At this moment, he is a Postdoctoral researcher at LIFL, Universite de Lille I, France.
Pedro Isasi Viñuela: He received Graduate and Doctor in Computer science by the Polytechnical University of Madrid in 1994. Currently he is Professor of Computational Sciences and Artificial Intelligence in the Department of Computer Science in Carlos III University. His research is focused on the field of Artificial intelligence, on problems of Optimization and automatic learning, in evolutionary systems and in artificial neural networks. He has published two books in the area.
About this article
Cite this article
Hernández Castro, J.C., Isasi Viñuela, P. New results on the genetic cryptanalysis of TEA and reduced-round versions of XTEA. New Gener Comput 23, 233–243 (2005). https://doi.org/10.1007/BF03037657
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037657