6.875/18.425 Cryptography & Cryptanalysis
Spring 2010
Instructor: Silvio Micali
TA: Alessandro Chiesa
Lecture:
TR2.30-4
(32-141)
Recitation: W10-11
(34-301)
Office Hours: F1.30-2.30
(G5 elevator lounge)
Information:
This course features a rigorous introduction to modern cryptography, with an emphasis on the fundamental cryptographic primitives of public-key encryption, digital signatures, pseudo-random number generation, and basic protocols and their computational complexity requirements.
Announcements
Course VI Underground Guide Evaluations
Hello Class,
Please take the time to fill out the course evaluations (these are now a 10pt extra-credit problem in Problem Set 8).
These are very useful to us, and will directly affect how we improve the class in future semesters;
so please be candid, and say what you really liked and what you really did not like!
Follow this link (you can do that anytime until May 16, 11:59pm):
https://sixweb.mit.edu/student/evaluate/6.875-s2010
Please take the time to fill out the course evaluations (these are now a 10pt extra-credit problem in Problem Set 8).
These are very useful to us, and will directly affect how we improve the class in future semesters;
so please be candid, and say what you really liked and what you really did not like!
Follow this link (you can do that anytime until May 16, 11:59pm):
https://sixweb.mit.edu/student/evaluate/6.875-s2010
Announced on 03 May 2010 12:45 p.m. by Alessandro Chiesa
Mistake in Problem 3 of PS3
One of you brought to my attention that the definition of
"indistinguishability" in Problem 3 of Problem Set 3 is
wrong.
A new, corrected version is now up, so please make sure to use the new definition (or else you will have trouble solving the problem).
A new, corrected version is now up, so please make sure to use the new definition (or else you will have trouble solving the problem).
Announced on 03 March 2010 12:02 p.m. by Alessandro Chiesa
Additional problem added to Problem Set 1
Problem Set 1 has been updated to include a 6th problem on
sampling efficiently generators modulo a prime (in response to a
question that came up in lecture today).
Now you can choose to do any 4 of the 6 problems, intead of any 4 of the (formerly) 5 problems. Again, when turning in the problem set, please indicate which problems you want us to grade.
And, of course, if you have extra time, we do encourage you to still work through all the problems.
Now you can choose to do any 4 of the 6 problems, intead of any 4 of the (formerly) 5 problems. Again, when turning in the problem set, please indicate which problems you want us to grade.
And, of course, if you have extra time, we do encourage you to still work through all the problems.
Announced on 04 February 2010 10:45 p.m. by Alessandro Chiesa
Sign-Up Sheet
Please do not forget to send Ale (alexch@csail.mit.edu) the
information requested on Handout 2. We will add you to the class
mailing list only then.
Also, starting from tomorrow, at the beginning of each lecture, we will have a piece of paper going around the class; please write your name on it so we know you were there.
See you tomorrow!
Also, starting from tomorrow, at the beginning of each lecture, we will have a piece of paper going around the class; please write your name on it so we know you were there.
See you tomorrow!
Announced on 03 February 2010 8:23 p.m. by Alessandro Chiesa
