CS 276 Cryptography-syllabus

# A Concrete Introduction to Higher Algebra, 2nd Edition

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

CS 276: Cryptography CS 276: Cryptography Overview CS 276 is a graduate class on cryptography offered in the Spring 2002 semester. Instructors: Luca Trevisan and David Wagner. Time: 12:30--2:00pm, Tuesdays and Thursdays. Location: 306 Soda. Prerequisites: CS 170 or equivalent. Web page: http://www.cs.berkeley.edu/~daw/cs276/ This class teaches the theory, foundations and applications of modern cryptography. In particular, we treat cryptography from a complexity-theoretic viewpoint. In recent years, researchers have found many practical applications for these theoretical results, and so we will also discuss their impact along the way and how one may use the theory to design secure systems. Schedule macro files for scribes are here Jan 22: [L] Basic motivating scenarios for cryptography. Definition of one-way functions, trapdoor functions, and permutations. Basics on number theory, RSA. [notes] Jan 24: [L] Rabin's function, definitions of security. [notes] Jan 29: [L] Hard-core predicates, the Goldwasser-Micali cryptosystem. [notes] Jan 31: [L] Proof of the Goldreich-Levin Theorem [notes] Feb 5: [D] Stronger definitions of security (non-malleability, chosen cyphertext attacks) [notes] Feb 7: [D] Relations between notions of security; The random oracle model [notes] For more on random oracles, see this paper . David covered the schemes in Sections 3.1 and 3.2 in class on Feb 7. Feb 12: [D] IND-CCA2 implies NM-CCA2; information-theoretic security, the one-time pad, Shannon's results on perfect encryption. [notes] file:///C|/Documents%20and%20Settings/Linda%20Grau. ..y-H2/CS276/CS%20276%20%20Cryptography-syllabus.htm (1 of 5) [2/4/2008 11:43:12 AM]

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

View Full Document
CS 276: Cryptography Also, the first homework (ps) (pdf) is now available. New: the homework was updated Feb 17 to fix an error in Problem 4(a). Feb 14: [L] Definition of one-way functions, weak and strong one-way functions. [notes] Feb 19: [D] Building PRG's from OWF's. The Blum-Micali-Yao construction of a pseudorandom generator. Increasing the stretching factor of a PRG. [notes] Feb 21: [L] Constructions of pseudorandom generators from one-way functions. The Goldreich-
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/04/2008 for the course CS 276 taught by Professor Trevisan during the Spring '02 term at Berkeley.

### Page1 / 5

CS 276 Cryptography-syllabus - CS 276: Cryptography CS...

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

View Full Document
Ask a homework question - tutors are online