cryptanalysis of tea using quantum-inspired genetic algorithms使用量子激发遗传算法所密码分析的茶.pdfVIP

J. Software Engineering Applications, 2010, 3: 50-57 doi:10.4236/jsea.2010.31006 Published Online January 2010 (http://www.SciRP.org/journal/jsea) Cryptanalysis of TEA Using Quantum-Inspired Genetic Algorithms Wei Hu Department of Computer Science, Houghton College, One Willard Avenue, Houghton, NY, USA. Email: wei.hu@ Received September 10th, 2009; revised October 9th, 2009; accepted October 16th, 2009. ABSTRACT The Tiny Encryption Algorithm (TEA) is a Feistel block cipher well known for its simple implementation, small memory footprint, and fast executio n speed. In two previous studies, genetic algorithms (GAs) were employed to investigate the randomness of TEA output, based on which distinguishers for TEA could be designed. In this study, we used quan- tum-inspired genetic algorithms (QGAs) in the cryptanalysis of TEA. Quantum chromosomes in QGAs have the advan- tage of containing more information than the binary counterpart of the same length in GAs, and therefore generate a more diverse solution pool. We showed that QGAs could discover distinguishers for reduced cycle TEA that are more efficient than those found by classical GAs in two earlier studies. Furthermore, we applied QGAs to break four-cycle and five-cycle TEAs, a considerably harder problem, which the prior GA approach failed to solve. Keywords : Cryptanalysis, Distinguisher, Feistel Block Cipher, Genetic Algorithms, Optimization, Quantum Computing, TEA 1. Introduction in TEA is defined as two Feistel rounds. The SHIFT, ADD, and XOR operations in TEA provide the necessary The Tiny Encryption Algorithm (TEA), a Feistel block diffusion of the statistics of the plaintext in the ciphertext cipher notable for its simplicity of description and im-