Quantum Cryptography
Code: TBD · Credits: 4 · Hours: 60 · Type: ELECTIVE
Quantum computing breaks the asymmetric primitives — RSA, ECC, classical Diffie-Hellman — that underpin most of today's authenticated key exchange. This elective covers both halves of the response: quantum key distribution (using quantum mechanics for unconditional secrecy on the wire) and post-quantum cryptography (classical algorithms believed hard against quantum attackers).
Key topics
- Quantum mechanics primer: superposition, entanglement, the no-cloning theorem.
- Quantum key distribution: BB84, E91, B92, decoy-state protocols.
- QKD network architectures: trusted-node networks, satellite QKD.
- Post-quantum cryptography families: lattice-based (Kyber, Dilithium), code-based (Classic McEliece), hash-based (SPHINCS+, XMSS), multivariate, isogeny.
- NIST PQC standardisation outcomes (FIPS 203/204/205, 2024).
- Hybrid TLS, crypto-agility, and migration planning.
- Quantum-safe deadlines for NRB / IRD / banking sector in Nepal.
Learning outcomes
By the end of this subject, a student should be able to:
- Explain the BB84 protocol and the security argument behind unconditional secrecy.
- Compare the main PQC families on performance, key size, and maturity.
- Plan a phased migration for a real PKI to hybrid + then PQC-only.
- Identify which standards organisations and regulators have already mandated PQC timelines.
Further reading
- NIST PQC project pages and FIPS 203 / 204 / 205.
- Bernstein & Lange, Post-Quantum Cryptography (Nature, 2017).
- Nielsen & Chuang, Quantum Computation and Quantum Information.
- ETSI QKD specifications.
Chapter notes
Detailed chapter-by-chapter notes for this subject are still being written. The topic outline above mirrors the published syllabus. If you'd like to help draft a chapter, see the contributing guide.
· min read