CS201Fall07 Syllabus

Introduction to Modern Cryptography: Principles and Protocols (Chapman & Hall/CRC Cryptography and Network Security Series)

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
3.3 CS 201: Introduction to Cryptography Fall Quarter, 2007 Instructor: Stanislaw Jarecki Class time: M-W, 3:30-5 Room: ICS 243 Prerequisites: ICS 6A and ICS 161/261, also see below Textbook: Jonathan Katz, Yehuda Lindell,"Introduction to Modern Cryptography". Office hours: Tuesday and Thursday 10:30-12. I'm also usually around most of the time, except lunch hour and 2-3 MWF when I teach ICS.6D, and you are welcome to stop by anytime. I always keep an open door and if I'm talking to someone I can interrupt and answer a quick question or at least arrange some other time you can stop by. You can also email me first at stasio@ics.uci.edu , or check if I'm in my office before you come, at extension x4-8878. I very much encourage you to use the office hours and ask me to explain things you don't understand. Course Schedule: Week Dates Homewor k Subjects Reading Week 1 Oct 1 Intro to Modern Cryptography Classical Cryptosystems Chapter 1 (except section 1.3, which is optional) Chapter 2 (except section 2.4, which is optional) Week 2 Oct 8 Hmw1 / Solutions1 Private-Key Encryption: Definition and its Implications Chapter 3, Sections 3.1 and 3.2. In Wednesday lecture we gave as one implication the hardness of predicting any particular bit of a random plaintext. This proof is in the textbook as a proof of Claim 3.10.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Week 3 Oct 15 Pseudorandom Number Generator Encryption of Fixed- Length Messages Stream Cipher Sections 3.3 and 3.4 Week 4 Oct 22 Hmw2 / Solutions2 Chosen Plaintext / Ciphertext Security Pseudorandom Functions (Strong) Pseudorandom Permutations Modes of Operation of a Block Cipher Sections 3.5 - 3.7, example of hybrid argument in the proof of
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

CS201Fall07 Syllabus - 3.3 CS 201: Introduction to...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online