**Course Description:**

Cryptology is the study of the design and analysis of various encryption schemes, and related topics. The plan is to study the basics of the subject and then touch on several recent developments.

**Grading:** Homework 30%, Midterm: 30%, Final: 40%.
Homework should be stapled and submitted on time; late homework will *not*
be accepted. Your lowest homework score will be dropped. Graduate students
will be given additional problems in the homeworks and exams.

**Approximate syllabus**
(Subject to adjustment): We will cover some (not all) material from
Chapters 2, 4, 6, 7, 8, 9, 12, 14 and 16 from the textbook. We may also touch
upon the Advanced Encryption Standard, protocols such as SSL, and other
such topics if time permits. The required mathematics will be
developed as we go along.

The mid-term and final exam will be closed-book and closed-notes;
calculators and
other computing equipment will **not** be permitted.

The final exam is scheduled by the University to be on
Wednesday, December 20, 2006, from 8-10 AM in the classroom.
The mid-term will also be in class at the usual class time (10 - 10:50 AM),
on Wednesday, October 18, 2006.

- Section 1.1 (up to the end of Section 1.1.1)
- Chapter 2 (the initial part up to the end of Section 2.3; for the Vigenere cipher, you only need to know how to encode using it, and are not required to know the attacks on it)
- Section 2.9
- Chapter 3 (the initial part up to the end of Section 3.7)
- Section 4.2
- Section 4.5 (only the ECB and CBC modes)
- Section 4.7
- Section 4.8 (just the basic idea -- you don't need to know about "salt")
- Section 6.1,
- Section 6.2.2 (just the initial part, where we see an efficient attack -- you don't need to know how to prevent this attack)
- Section 6.3 (all the material up to the beginning of the Solvay-Strassen Test -- you don't need to know the Solvay-Strassen Test)
- Section 6.4 (only the initial part -- Fermat Factorization and the p - 1 Factoring Algorithm)
- Section 6.6
- Section 6.7
- Section 7.1
- The initial part of Section 7.2, up to the end of Section 7.2.1

- Section 1.1 (up to the end of Section 1.1.1),
- Chapter 2 (the initial part up to the end of Section 2.3),
- Section 2.9,
- Chapter 3 (the initial part up to the end of Section 3.7),
- Section 3.9,
- Section 4.2,
- Section 4.5 (only the ECB and CBC modes),
- Section 4.7,
- Section 4.8 (just the basic idea -- you don't need to know about "salt"),
- Section 6.1,
- Section 6.2.2 (just the initial part, where we see an efficient attack -- you don't need to know how to prevent this attack),
- Section 6.3 (all the material up to the beginning of the Solvay-Strassen Test -- you don't need to know the Solvay-Strassen Test),
- Section 6.4 (only the initial part -- Fermat Factorization and the p - 1 Factoring Algorithm),
- Section 6.6 and Section 6.7,
- All of Chapter 7, EXCEPT FOR Section 7.2.3,
- Section 8.1, Section 8.2, and Section 8.4,
- Section 8.6 (you DO NOT need to know the PROOF of the main theorem of this section, which shows that one-way functions and the random oracle model yield ciphertext-indistinguishability; all else in this section is included),
- Chapter 9,
- Chapter 12,
- Chapter 14,
- Chapter 16 (the initial part up to the end of Section 16.2), and
- Section 16.5.

Midterm solutions

Mid term stats:

Undergrad Max Score: 30/30

Undergrad Median Score: 23/30

Grad Max Score: 38/38

Grad Median Score: 38/38

Homework |
Solution |
Undergrad - Max score | Undergrad - Median score | Grad - Max score | Grad - Median score |

Homework 1, due Sep. 15 | 47/50 | 36/50 | 53/55 | 46/55 | |

Homework 2, due Sep. 25 | 40/40 | 33/40 | 40/40 | 38/40 | |

Homework 3, due Oct. 04 | 35/35 | 30/35 | 50/50 | 46/50 | |

Homework 4, due Oct. 13 | 30/30 | 20/30 | 40/40 | 35/40 | |

Homework 5, due Oct. 30 | 37/40 | 28.5/40 | 55/55 | 53/55 | |

Homework 6, due Nov. 10 | 45/45 | 30/45 | 45/45 | 45/45 | |

Homework 7, due Nov. 20 | 35/35 | 28/35 | 50/50 | 48.5/50 | |

Homework 8, due Dec. 06 | 75/75 | 54/75 | 90/90 | 86/90 |

To further exhibit your commitment to academic integrity, remember to sign the Honor Pledge on all examinations and assignments: "I pledge on my honor that I have not given or received any unauthorized assistance on this examination (assignment)."