Stanford Root

Schedule

Stanford Root

Schedule

CS 258

Quantum Cryptography

UNITS:3
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

This course will give an overview of how the development of quantum computers will fundamentally change the landscape of modern cryptography. This course will cover both the threats and opportunities of quantum computers for cryptography, and will include the following topics: A study of quantum algorithms for attacking classical cryptography; Cryptographic tools that resist such attacks; Quantum protocols such as quantum money that achieve never-before-possible capabilities. The course is intended for advanced undergraduates and masters students.

Syllabus for selected term:
View Autumn 2026 Syllabus

Sections

1 Term
Lecture 1Open
ID: 6354
0 / 999 enrolled
DAYS:Monday, Wednesday
TIME:9:30 AM – 10:50 AM
LOCATION:CODAB90
INSTRUCTOR:
Zhandry, Mark
3units

CS 258: Quantum Cryptography

3 units · Letter or Credit/No Credit

This course will give an overview of how the development of quantum computers will fundamentally change the landscape of modern cryptography. This course will cover both the threats and opportunities of quantum computers for cryptography, and will include the following topics: A study of quantum algorithms for attacking classical cryptography; Cryptographic tools that resist such attacks; Quantum protocols such as quantum money that achieve never-before-possible capabilities. The course is intended for advanced undergraduates and masters students.

Offered in Autumn 2026 at Stanford University.

Autumn 2026 sections

  • Lecture — Monday Wednesday 9:30 AM – 10:50 AM — CODAB90 — Zhandry, Mark (Graduate)

More CS courses

  • CS 251: Cryptocurrencies and blockchain technologies
  • CS 254: Computational Complexity
  • CS 254B: Computational Complexity II
  • CS 255: Introduction to Cryptography
  • CS 256: Algorithmic Fairness
  • CS 257: Introduction to Automated Reasoning
  • CS 259Q: Quantum Computing
  • CS 261: Combinatorial Optimization (CME 310, MS&E 315)
  • CS 265: Randomized Algorithms and Probabilistic Analysis (CME 309)
  • CS 266Z: Robust Algorithms in the Face of Uncertainty
  • CS 269I: Incentives in Computer Science (MS&E 206)
  • CS 270: Modeling Biomedical Systems (BMDS 210)

All CS courses · All departments