MODERN CRYPTOGRAPHY
Giuseppe Ateniese
Course # 600.442

---

Announcements

• Midterm is on Tue, Mar 24 (in class)
• First in-class assignment on Tue Feb 24.
• Note that we meet in JHUISI Conference Romm (Wyman Park Building, 4th Floor) and NOT in Hods 311.
• Course slides are available. Please click here.
• The main textbook for this class is: Introduction to Modern Cryptography, by Jonathan Katz and Yehuda Lindell. Chapman and Hall/CRC Press. See below for other sources.

Course Information

This is a Combined Course for advanced undergraduate and graduate students. This course is classified as "Analysis".

Prereq (Strongly Recommended): Number Theory and Discrete Math courses, at least one System course.

Grading: T = 0.4 * (Final) + 0.3 * (Assignments) + 0.3 * (Midterm)

Meetings: TTh 3-4:15 PM, JHUISI Conference Romm (Wyman Park Building, 4th Floor).
Office: 418, JHUISI (Wyman Park Building, 4th Floor)
Office hours: TTh 4:30-5:30pm
Teaching Assistants: TBD

TA's office hours: TBD

Computer Science Academic Integrity Code

Syllabus

"This course focuses on cryptographic algorithms, formal definitions, hardness assumptions, and proofs of security. Topics include number-theoretic problems, pseudo-randomness, block and stream ciphers, public-key cryptography, message authentication codes, and digital signatures."

Topics Covered:

• Introduction to crypto
  • Terminology
  • Security Aspects
  • Attack Models
  • Classical Cryptography
  • Shift Cipher
  • Substitution Cipher
  • Vigenere Cipher
  • Basic Cryptanalysis
• Conventional Encryption
  • Attacks on Encryption Schemes
  • Perfect Security
  • Cipher Machines
  • Modes of Operation (ECB, CBC, CFB, OFB)
  • Multiple Encryption
  • DES, Triple-DES, DES-X
  • RC4 Stream Cipher
  • Attacks on WEP
  • AES
• Pseudo-random Number Generators (PRNGs)
  • Random and Pseudorandom Numbers
  • Next-bit Test
  • Removing Biases
  • ANSI X9.17 Generator
  • Blum-Blum-Shub Generator
  • Statistical Tests
  • NIST and DIEHARD
• Hash Functions and MAC
  • Standard hashes (MD5, SHA-1, SHA-256/384/512, RIPEMD-160)
  • Birthday Attack
  • Collision-freeness and recent attacks
  • Message Authentication Code (MAC) Algorithms
  • Authenticated Encryption
• Key Establishment and Public-key Cryptography
  • Diffie-Hellman (DH)
  • Attacks on DH
  • A-DH and Perfect Forward Secrecy
  • DHP and DDHP
  • RSA, Rabin, OAEP-RSA
  • Attacks on RSA
  • ElGamal
  • Attacks on ElGamal
  • Semantic Security and Chosen-ciphertext Security
  • Provably Secure Schemes
• Integrity and Digital Signature
  • RSA, Schnorr, DSS, Nyberg-Rueppel, Merkle One-time Signature
  • Attacks on Digital Signatures
  • Unforgeable Schemes
• Protocols
  • Authentication Protocols
  • Digital Payment Systems
  • Secret Sharing
  • Ientity-based Cryptography
  • Zero-knowledge Protocols

Assignments

• Final
  • Where?: TBD
  • When?: TBD
• Midterm
  • Where?: JHUISI Conference Room
  • When?: Tue Mar 24, 2009
• Assignments
  • Tue Feb 24, 2009.
  • (TBD)

Textbooks/Sources

• Joan Daemen and Vincent Rijmen, The Design of Rijndael- AES The Advanced Encryption Standard, Springer-Verlag.
• Douglas R. Stinson, Cryptography (Theory and Practice), CRC Press.
• William Stallings, Cryptography and Network Security, Principles and Practice, Prentice Hall.
• Handbook of Applied Cryptography, Alfred J. Menezes, Paul C. Oorschot, and Scott A. Vanstone, CRC Press.