Stanford Root

Schedule

Stanford Root

Schedule

CS 255

Introduction to Cryptography

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

For advanced undergraduates and graduate students. Theory and practice of cryptographic techniques used in computer security. Topics: encryption (symmetric and public key), digital signatures, data integrity, authentication, key management, PKI, zero-knowledge protocols, and real-world applications. Prerequisite: basic probability theory.

Syllabus for selected term:
View Winter 2027 Syllabus

Sections

1 Term
Lecture 1Open
ID: 6455
0 / 999 enrolled
DAYS:Monday, Wednesday
TIME:3 PM – 4:20 PM
LOCATION:TBD
INSTRUCTOR:
Sidhu, Jasdeep, Aggarwal, Anushree, Litchev, Yavor, Le, Jack, Kim, Jaehyung+1 more
3units
Discussion 1Closed
ID: 6664
DAYS:Friday
TIME:1:30 PM – 2:20 PM
LOCATION:TBD
3units

CS 255: Introduction to Cryptography

3 units · Letter or Credit/No Credit

For advanced undergraduates and graduate students. Theory and practice of cryptographic techniques used in computer security. Topics: encryption (symmetric and public key), digital signatures, data integrity, authentication, key management, PKI, zero-knowledge protocols, and real-world applications. Prerequisite: basic probability theory.

Offered in Winter 2027 at Stanford University.

Winter 2027 sections

  • Discussion — Friday 1:30 PM – 2:20 PM (Graduate)
  • Lecture — Monday Wednesday 3:00 PM – 4:20 PM — Sidhu, Jasdeep, Aggarwal, Anushree, Litchev, Yavor, Le, Jack, Kim, Jaehyung, Boneh, Dan (Graduate)

More CS courses

  • CS 247S: Service Design (SYMSYS 195S)
  • CS 248A: Computer Graphics: Rendering, Geometry, and Image Manipulation
  • CS 248B: Fundamentals of Computer Graphics: Animation and Simulation
  • CS 251: Cryptocurrencies and blockchain technologies
  • CS 254: Computational Complexity
  • CS 254B: Computational Complexity II
  • CS 256: Algorithmic Fairness
  • CS 257: Introduction to Automated Reasoning
  • CS 258: Quantum Cryptography
  • CS 259Q: Quantum Computing
  • CS 261: Combinatorial Optimization (CME 310, MS&E 315)
  • CS 265: Randomized Algorithms and Probabilistic Analysis (CME 309)

All CS courses · All departments