Three-stage quantum cryptography protocol

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

The Three-stage quantum cryptography protocol, also known as Kak's three-stage protocol[1] is a method of data encryption that uses random polarization rotations by both Alice and Bob, the two authenticated parties, that was proposed by Subhash Kak.[2] In principle, this method can be used for continuous, unbreakable encryption of data if single photons are used.[3] It is different from methods of QKD (quantum key distribution) for it can be used for direct encryption of data, although it could also be used for exchanging keys.

Alice and Bob communicate safely using random polarization rotations.

The basic idea behind this method is that of sending secrets (or valuables) through an unreliable courier by having both Alice and Bob place their locks on the box containing the secret, which is also called double-lock cryptography. Alice locks the box with the secret in it and it is transported to Bob, who sends it back after affixing his own lock. Alice now removes her lock (after checking that it has not been tampered with) and sends it back to Bob who, similarly unlocks his lock and obtains the secret. In the braided form, only one-pass suffices but here Alice and Bob share an initial key.[4][5]

This protocol has been proposed as a method for secure communication that is entirely quantum unlike quantum key distribution in which the cryptographic transformation uses classical algorithms[6]

The basic polarization rotation scheme has been implemented in hardware by Pramode Verma in the quantum optics laboratory of the University of Oklahoma.[7] [8][9] In this method more than one photon can be used in the exchange between Alice and Bob and, therefore, it opens up the possibility of multi-photon quantum cryptography.[10] This works so long as the number of photons siphoned off by the eavesdropper is not sufficient to determine the polarization angles. A version that can deal with the man-in-the-middle attack has also been advanced.[11]

Parakh analyzed the three-stage protocol under rotational quantum errors and proposed a modification that would correct these errors.[12] One interesting feature of the modified protocol is that it is invariant to the value of rotational error and can therefore correct for arbitrary rotations.

References[edit]

  1. ^ Cardinal, David (2019), Quantum Cryptography Demystified: How It Works in Plain Language. Extreme Tech, March 11. [1]
  2. ^ Kak, S., A three-stage quantum cryptography protocol. Foundations of Physics Letters, vol. 19, pp.293-296, 2006.
  3. ^ Chen, Y. et al, Embedded security framework for integrated classical and quantum cryptography in optical burst switching networks. Security and Communication Networks, vol. 2, pp. 546-554, 2009.
  4. ^ Thomas, J.H. Variations on Kak’s three stage quantum cryptography protocol. https://arxiv.org/abs/0706.2888
  5. ^ Darunkar, B. and P.Verma, "The braided single-stage protocol for quantum-secure communication," SPIE.DDS Conf., Baltimore, MD, May 5-9, 2014.
  6. ^ Thapliyal, K. and Pathak, A. Kak’s three-stage protocol of secure quantum communication revisited. Quantum Information Processing, vol. 17, 2018[2]
  7. ^ A multi-photon approach to quantum cryptography http://www.kurzweilai.net/a-multi-photon-approach-to-quantum-cryptography [accessed Feb 10, 2015]
  8. ^ Quantum optics lab. http://www.ou.edu/coe/tcom/research/quantum-optics1.html [accessed Feb 10, 2015]
  9. ^ Verma, P.K. et al. (2019), Multi-photon Quantum Secure Communication. Springer. [3]
  10. ^ Mandal, S. et al. Multi-photon implementation of three-stage quantum cryptography protocol. International Conference on Information Networking, Bangkok, 2013.
  11. ^ Chan, K.W.C. et al, Multi-photon quantum key distribution based on double-lock encryption. arXiv: https://arxiv.org/abs/1503.05793
  12. ^ Parakh, A. and vanBrandwijk, J. Correcting Rotational Errors in Three Stage QKD. Proceedings of 23rd International Conference on Telecommunications, Thessaloniki, Greece, May 16-18, 2016.