Lectures: MWF 9:00-9:50 in Annenberg 101
Description:
This course will give a broad overview of cryptographic techniques with an emphasis on modern tools based on prime numbers. We discuss many basic protocols from classical tools to DES, RSA and discrete logarithms and applications such as digital signatures, secure protocols, secret sharing, secure computation and zero-knowledge proofs. As time permits we will explore connections between cryptography, coding theory and quantum mechanics.
This course is designed for undergraduates. A course in discrete mathematics (like EECS 310) is strongly recommended.
Textbook: Introduction to Cryptography with Coding Theory, 2nd edition by Wade Trappe and Lawrence Washington.
Assignments