Abstract
The process of disguising a plaintext into ciphertext is called encryption and back into plaintext is called decryption. A cryptographic algorithm, is also called a cipher, is the mathematical function used for encryption and decryption. Many algorithms are available for this purpose. Triple DES is such an algorithm. Encryption using triple DES is possible in two different ways; they are triple DES with two keys and triple DES with three different keys. Cryptanalysis can be used to recover the plaintext of a message from the ciphertext without access to or knowing the key. Exhaustive key search remains the most practical and efficient attack on Triple DES with two keys. The principles of quantum mechanics can be used to build and analyze a quantum computer and its algorithms. Quantum searching is one such algorithm. The key search in Triple DES with two keys is possible using quantum search algorithm, which is more efficient compare to any other methods. In this paper we are presenting how quantum search can be used to crack Triple DES with two keys searching for a key.
Chapter PDF
References
Amardeep Singh and Sarbjeet Singh, (2003), Applying quantum search to automated test pattern generation for VLSI circuits, International Journal of Quantum In formation, Vol. 1 No. 1, 79–91.
Apoorva Patel, Quantum Database Search can do without Sorting, quant-ph/0012149.
Bruce Schneier,(2002), Applied Cryptography, Wiley International Pvt Ltd, New Delhi.
Grover L.K, (1996), A Fast Quantum mechanical Algorithm for Database Search, In proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp.212–219, quant-ph/9605043.
Grover L.K. (2002), Tradeoffs in the Quantum Search Algorithm, quant-ph/0201152.
Nielsen M and Chaung, I (2000), Quantum Computation and Quantum Information, Cambridge University press, Cambridge, United Kingdom.
P.C. Van Oorschot and M.J. Wiener A Known-Plaintext Attack on Two-Key Triple Encryption. Advances in Cryptology — EUROCRYPT 90 Proceedings.
Terry Rudolph and Dr. Lov Grover,(2002), Quantum Searching a classical database, quant-ph/0206066.
William Stallings, (2003), Cryptography and Network Security, Principles and Practices. Pearson Education, New Delhi.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Phaneendra, H.D., Vidya Raj, C., Shivakumar, M.S. (2006). 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. IIP 2006. IFIP International Federation for Information Processing, vol 228. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-44641-7_18
Download citation
DOI: https://doi.org/10.1007/978-0-387-44641-7_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-44639-4
Online ISBN: 978-0-387-44641-7
eBook Packages: Computer ScienceComputer Science (R0)