Implications of indistinguishable encryptions in the presence of an eavesdropper.
Textbook Section 3.2.2
Friday, September 30, 2011
Wednesday, September 28, 2011
Lecture 4
Instructions for finding Assignment 1 are on the assignments page. Due Friday October 7th.
Formal definition of indistinguishable encryptions in the presence of an eavesdropper. Textbook section 3.1-3.2.1.
Formal definition of indistinguishable encryptions in the presence of an eavesdropper. Textbook section 3.1-3.2.1.
Monday, September 26, 2011
Friday, September 23, 2011
Wednesday, September 21, 2011
Lecture 1
Introduction of class, overview of non-modern cryptography and basic principles of modern crypto.
Textbook Chapter 1
Complexity Vidcast - Bill's Enigma
Textbook Chapter 1
Complexity Vidcast - Bill's Enigma
Monday, May 23, 2011
Course Information
EECS 395/495-0-21: Introduction to Cryptography
Fall 2011
Lecturer: Lance Fortnow
Grader: Arefin Huq
Lectures: MWF 1:00-1:50 in Tech LG66
For undergraduate CS majors this course can be used for either the Theory or Security depth requirement.
Description:
Lecturer: Lance Fortnow
Grader: Arefin Huq
Lectures: MWF 1:00-1:50 in Tech LG66
For undergraduate CS majors this course can be used for either the Theory or Security depth requirement.
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 advanced undergraduates and graduate students. There are no official prerequisites but math knowledge of the level of Discrete Math (EECS 310) will be assumed. There will be no programming in the course.
Textbook: Modern Cryptography by Katz and Lindell. Errata
This course is designed for advanced undergraduates and graduate students. There are no official prerequisites but math knowledge of the level of Discrete Math (EECS 310) will be assumed. There will be no programming in the course.
Textbook: Modern Cryptography by Katz and Lindell. Errata
Subscribe to:
Posts (Atom)