Cryptography from Quantum mechanical viewpoint

Cryptography is an art and science of secure communication. Here the sender and receiver are guaranteed the security through encryption of their data, with the help of a common key. Both the parties should agree on this key prior to communication. The cryptographic systems which perform these tasks are designed to keep the key secret while assuming that the algorithm used for encryption and decryption is public. Thus key exchange is a very sensitive issue. In modern cryptographic algorithms this security is based on the mathematical complexity of the algorithm. But quantum computation is expected to revolutionize computing paradigm in near future. This presents a challenge amongst the researchers to develop new cryptographic techniques that can survive the quantum computing era. This paper reviews the radical use of quantum mechanics for cryptography.

💡 Research Summary

The paper begins by outlining the foundations of classical cryptography, emphasizing that security rests on a public algorithm paired with a secret key and that key exchange is the most vulnerable phase. Modern public‑key systems such as RSA and elliptic‑curve cryptography rely on the presumed computational hardness of integer factorization and discrete‑logarithm problems. The advent of Shor’s algorithm, however, threatens these schemes because a sufficiently large quantum computer could solve those problems in polynomial time, rendering current public‑key infrastructures insecure.

In response, the authors turn to quantum mechanics as a source of new cryptographic primitives. Quantum key distribution (QKD) enables two parties to share a secret key by transmitting quantum states—typically polarized photons—over a physical channel. Any eavesdropping attempt inevitably disturbs the quantum states, producing detectable errors. The paper reviews the seminal BB84 protocol, which uses four polarization states and two measurement bases to encode random bits, and the E91 protocol, which exploits entangled photon pairs to achieve device‑independent security.

A substantial portion of the analysis is devoted to security proofs. Unconditional (information‑theoretic) security is established by bounding an eavesdropper’s accessible information using trace distance and von Neumann entropy. Recent advances in device‑independent QKD are discussed, where violation of Bell inequalities guarantees security even when measurement devices are imperfect or maliciously altered.

Practical implementation challenges are examined in depth. Fiber attenuation, detector inefficiency, and photon‑number‑splitting attacks limit real‑world performance. Decoy‑state techniques mitigate multi‑photon vulnerabilities, while satellite‑based QKD experiments have demonstrated key exchange over thousands of kilometers, paving the way for a global quantum network. Because quantum memories and fault‑tolerant quantum error‑correcting codes are not yet mature, the authors advocate a hybrid approach that combines post‑quantum cryptography (PQC) with QKD for near‑term deployment.

Beyond key distribution, the paper briefly surveys related quantum‑based cryptographic services, including quantum random number generation, quantum authentication, and quantum digital signatures, all of which derive security from the no‑cloning theorem and quantum entanglement rather than computational hardness.

The conclusion identifies key research directions: scaling quantum hardware, extending security proofs to more realistic models, standardizing protocols, and improving the efficiency of quantum‑classical hybrid schemes. As quantum technologies mature, cryptography is poised to shift from a reliance on mathematical difficulty to a foundation built on fundamental physical laws.