6.875J/18.425J

Cryptography and Cryptanalysis (6.875J/18.425J), Fall 98

A lot of this page has been copied and appropriately modified from the corresponding course taught by Shafi Goldwasser (and TA'ed by Shaih Halevi).

Course Description

This is the first of a two-term graduate course in cryptography. We will introduce and discuss the topics of encryption, pseudo-random number generation, digital signatures, identification, two party protocols and zero-knowledge. The emphasis will be on understanding the material and the proof techniques used.

Course Staff

Lecturer: Prof. Silvio Micali. NE43-303, x3-5949, silvio@theory.lcs.mit.edu.
TA: Yevgeniy Dodis. NE43-338, x3-7583, yevgen@theory.lcs.mit.edu

Prerequisites

General ease with algorithmic concepts, elementary number theory and good understanding of discrete probability are highly recommended.

Grading

We will hand out 7 problem-sets during the term. The class grade will be based on these problem-sets and on class participation.

Handouts

Problem Set 1.
Solutions to Problem Set 1.
Problem Set 2.
Solutions to Problem Set 2.
Problem Set 3.
Solutions to Problem Set 3.
Simple Proof that GM-security implies Semantic Security.
Problem Set 4.
Solutions to Problem Set 4.
Problem Set 5.
Solutions to Problem Set 5.
Problem Set 6.
Solutions to Problem Set 6.
OWF where each bit is easy to predict (alternative solution to problem 1 in homework 6).
Problem Set 7.
Solutions to Problem Set 7.
Class Bibliography List.
Alternative Lecture Notes By Bellare and Goldwasser.