Unique Number: 50540
Office: GDC 4.508
Office Hours: TTh 3:30-4:30
|Textbook:||Jonathan Katz and Yehuda Lindell, Introduction to Modern Cryptography|
This undergraduate course is an introduction to cryptography,
covering the mathematical techniques behind computer security.
It includes methods to communicate secretly and authenticate data
in the presence of adversarial attacks.
We will show how to do seemingly impossible tasks, such as how two
parties can communicate secretly even if they didn't agree on a secret
To do this properly, we'll need to give precise definitions and
computational assumptions, so that we can rigorously prove security.
This course will be very mathematical, relying on probability
and number theory and mathematical proof.
A list of topics and approximate times follows.
|Prerequisites:||CS 331 or 331H. Naturally, you also need the prerequisites and corequisites for CS 331, including Discrete Math (CS 311 or 311H), Probability (SDS 321 or M 362K), and Linear Algebra (SDS 329C, Math 340L, or Math 341). Probability is essential, so make sure you know it well. Number theory is helpful but not required.|