Advertisement

Applying Quantum Search to a Known-Plaintext Attack on Two-Key Triple Encryption

  • Phaneendra H. D. 
  • Vidya Raj C. 
  • M. S. Shivakumar
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 228)

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.

Keywords

Quantum mechanics Quantum algorithm qubits Quantum search 3DES exhaustive search 

References

  1. 1.
    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.zbMATHCrossRefGoogle Scholar
  2. 2.
    Apoorva Patel, Quantum Database Search can do without Sorting, quant-ph/0012149.Google Scholar
  3. 3.
    Bruce Schneier,(2002), Applied Cryptography, Wiley International Pvt Ltd, New Delhi.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Grover L.K. (2002), Tradeoffs in the Quantum Search Algorithm, quant-ph/0201152.Google Scholar
  6. 6.
    Nielsen M and Chaung, I (2000), Quantum Computation and Quantum Information, Cambridge University press, Cambridge, United Kingdom.zbMATHGoogle Scholar
  7. 7.
    P.C. Van Oorschot and M.J. Wiener A Known-Plaintext Attack on Two-Key Triple Encryption. Advances in Cryptology — EUROCRYPT 90 Proceedings.Google Scholar
  8. 8.
    Terry Rudolph and Dr. Lov Grover,(2002), Quantum Searching a classical database, quant-ph/0206066.Google Scholar
  9. 9.
    William Stallings, (2003), Cryptography and Network Security, Principles and Practices. Pearson Education, New Delhi.Google Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Phaneendra H. D. 
    • 1
    • 2
  • Vidya Raj C. 
    • 1
    • 2
  • M. S. Shivakumar
    • 1
    • 2
  1. 1.Department of Computer Science and EngineeringThe National Institute of EngineeringMysore, KarnatakaIndia
  2. 2.The National Institute of EngineeringMysore, KarnatakaIndia

Personalised recommendations