WOMANIUM QUANTUM : DAY 2 ❯ Quantum Key Distribution: Classical cryptography and limitations (QWorld)

WOMANIUM QUANTUM : DAY 2 ❯ Quantum Key Distribution: Classical cryptography and limitations (QWorld)

by Dr. Aeysha Khalique · View the channel on PSI

Formal & Physical Sciences Physics PHPhysicsPHQQuantum physics (quantum mechanics and quantum field theory)
🎙 Dr. Aeysha Khalique 👥 3K 📅 July 4, 2023 ⏱ 55 min 👁 2K 📄 tutorial 🧭 2026-10-09
Available in: English (current) Français

Keywords

symmetric cryptographyasymmetric cryptographyRSAperfect secrecyquantum computing

Summary

This is the first session of a WOMANIUM Quantum workshop on quantum key distribution, delivered by Dr. Aeysha Khalique. The lecture introduces classical cryptography and explains why it becomes insufficient in the presence of quantum computers. It begins by distinguishing symmetric and asymmetric encryption, with historical examples such as the Caesar cipher, the scytale, and the Enigma machine. The RSA algorithm is then described, including a step-by-step numerical example using prime factors 53 and 59, showing how a message ‘hi’ is encrypted and decrypted with public and private keys. The speaker emphasizes that classical security relies on the computational difficulty of prime factorization and discrete logarithms. The discussion then moves to Shor’s algorithm, which could efficiently factor large numbers and thus break RSA and other one-way functions. Finally, the one-time pad is presented as a mathematically secure classical cipher, though it requires a random key as long as the message. The lecture sets up the motivation for quantum key distribution by showing that classical cryptographic protocols are not future-proof against quantum attacks.

172 words

Critical Evaluation

Value of the Information & Strength of the Argument

The lecture offers a clear pedagogical value by building a step-by-step reasoning from ancient ciphers to modern RSA, and finally to the one-time pad. The worked RSA example with concrete numbers makes the abstract mathematical concepts tangible and helps the viewer appreciate the role of one-way functions. The argumentation is coherent: classical security is based on assumed computational hardness, not on mathematical guarantees; therefore, a sufficiently powerful quantum computer running Shor’s algorithm could break these schemes. The contrast between the easy-to-break historical ciphers and the computationally secure but not perfectly secure RSA highlights why the one-time pad, despite being perfect, requires key distribution — a problem that QKD aims to solve. However, the treatment remains introductory: no formal definitions of security or complexity theory are provided, and the quantum algorithm is only sketched, not analyzed.

Scientific Rigor, Source Quality, Title Accuracy

The talk is structured and accurate on the main cryptographic points, but it does not cite any external papers or textbooks during the lecture. The only links in the video description are the WOMANIUM Quantum website and schedule pages, which do not serve as references for the scientific content. Several historical details are imprecise: the Enigma machine was used during World War II, not World War I, and the perfect secrecy of the one-time pad was formally proved by Claude Shannon in 1949, not by Gilbert Vernam in 1926. The title matches the content very well; it explicitly mentions classical cryptography and its limitations, which is exactly what the session covers.

261 words

Title / Content Match

The title accurately reflects the lecture’s focus on classical cryptography and its limitations, positioning it as the first step toward quantum key distribution.

Quality & Reliability

7/10

The lecture is pedagogically solid and the main cryptographic explanations are correct, particularly the RSA worked example and the one-time-pad description. However, it contains minor historical inaccuracies (Enigma is associated with WWII rather than WWI, and the one-time-pad perfect secrecy proof is due to Shannon, not Vernam alone) and no external literature is cited. This yields a good but not flawless reliability score.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Contribution & Novelties

The main contribution of this session is educational: it builds a clear conceptual bridge from classical cryptographic primitives (Caesar, Enigma, RSA) to the fundamental limitation that computational hardness is vulnerable to a quantum attacker, thereby motivating quantum key distribution. It does not present new research but offers a useful narrative for learners entering the field.

For further exploration:

  • RSA (cryptosystem) — The public-key cryptosystem explained with a numerical example in the lecture.
  • Shor’s algorithm — The quantum algorithm that efficiently factors large numbers and breaks RSA.
  • One-time pad — The perfectly secure classical cipher described at the end of the session.
  • Quantum key distribution — The broader topic of the workshop, which builds on the limitations discussed here.
  • BB84 — The first QKD protocol, referenced conceptually as the next step in the series.

133 words

Radar Profile

The radar profile shows moderate scores across all dimensions, with quantitative content and technical level slightly above the middle, while reliability is held back by minor historical inaccuracies and the absence of explicit scientific citations.

Reliability 7/10