Abstract
We present a quantum mechanical meet-in-the-middle search algorithm inosculating the quantum computing theory with cryptanalysis method and basing on the Grover’s algorithm and the meet-in- the-middle attack, which can solve the three-key triple-DES in O(56 256) steps and with O(256) memory cost. The computational complexity is apparently reduced, compared with that of the existing algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Diffie W, Hellman M. Exhaustive cryptanalysis of the NBS data encryption standard. SIAM J Comput, 1977, 10: 74–84
Merkle R, Hellman M. On the security of multiple encryption. Commun ACM, 1981, 24: 465–467
FIPS 46. Data Encryption Standard (DES). Washington: Federal Information Processing Standards Publication, 1977
Shen C X, Zhang H G, Feng D G, et al. Survey of information security (in Chinese). Sci China Ser F-Inf Sci, 2007, 37: 129–150
FIPS 197. Advanced Encryption Starndard (AES). Washington: Federal Information Processing Standards Publication, 2001
Wei Y Z, Hu Y P. Predigestion of new related-key attack on AES-192 and AES-256 (in Chinese). Sci China Ser F-Inf Sci, 2009, 39: 246–253
Tuchman W. Hellman presents no shortcut solutions to DES. IEEE Spectrum. 1979, 16: 40–41
Schneier B. Applied Cryptography. 2nd ed. New York: John Wiley & Sons Press, 1996. 253–254
Phaneendra H D, Vidya R C, Shivakumar M S. Applying quantum search to a Known-Plaintext attack on two-key triple encryption. In: Shi Z, Shimohara K, Feng D, eds. Intelligent Information Processing III, Vol 228. Boston: Springer, 2006. 171–178
Feynman R. Simulating physics with computers. Int Theor Phys, 1982, 21: 467–488
Chen W, Han Z F, Mo X F. Active phase compensation of quantum key distribution system (in Chinese). Chinese Sci Bull, 2007, 52: 2221–2225
Gao F, Guo F Z, Wen Q Y. Efficiency compare of different detection strategies in Ping-pong protocol (in Chinese). Sci China Ser G-Phys Mech Astron, 2009, 39: 161–166
Simon D R. On the power of quantum computation. SIAM J Comput, 1997, 26: 1474–1483
Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput, 1997, 26: 1484–1509
Rivest R, Shamir A, Adleman L. On Digital Signatures and Public-key Cryptosystems. MIT Laboratory for Computer Science Technical Report. 1979
Grover L K. A fast quantum mechanics algorithm for database search. In: Proceeding of the 28th ACM Symposium on Theory of Computation. New York: ACM Press, 1996. 212–219
Long G L. Grover algorithm with zero theoretical failure rate. Phys Rev A, 2001, 64: 022307
Long G L, Zhang W L, Li Y S, et al. Arbitrary phase rotation can not be used in Grover’s quantum search algorithm. Commun Theor Phys, 1999, 32: 335–338
Long G L, Li Y S, Zhang W L, et al. Phase matching in quantum searching. Phys Lett A, 1999, 262: 27–34
Long G L, Xiao L, Sun Y. Phase matching condition for quantum search with a generalized quantum database. Phys Lett A, 2002, 294: 143–152
Alfred J M, Paul C O, Scott A V. Handbook of Applied Cryptography. Washington: CRC Press LLC, 1997. 117–119
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Zhong, P., Bao, W. Quantum mechanical meet-in-the-middle search algorithm for Triple-DES. Chin. Sci. Bull. 55, 321–325 (2010). https://doi.org/10.1007/s11434-009-0532-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11434-009-0532-5