Introduction to Cryptography (CS 6377) 
 Time and Location  : Fr 9:30am-12:15pm ECSS 2.311

Instructor:	Murat Kantarcioglu
Office Hours & Location :	Friday 12:30-1:30pm, 3pm-4pm @ECSS 3.225

Teaching Assistant:	Robert Nix, rcn06200@utdallas.edu
Office Hours & Location:	T.B.D

Prerequisites:

CS 5333 and CS 5343

Grading:

• Homeworks %20   (5 homeworks, each worth 4%)
• Project         %20  (Group project (up to 3 people) that requires programming)
• Midterm       %15  (In class)
• Quizes         %10  (Two-three, done randomly on any given day)
  
• Final            %35  (In class)
• Class Part.  %5    (Bonus for Class Participation)

 Course Topics: (tentative)

· Computational number theory and Discrete Probability, Block ciphers, Pseudorandom functions  Symmetric encryption, Hash functions, Message authentication, Number-theoretic primitives   Asymmetric encryption, Digital signatures

Textbook:
Cryptography: Theory and Practice, Third Edition
Douglas R. Stinson, Chapman& Hall/CRC Press

Course Outline (Tentative):

Week 1, Jan. 14	Introduction to Modern Cryptogprahpy (slides) Perfect Secrecy and One-time Pad   (slides)  (Chapter 2.1-2.3)
Week 2, Jan. 21	Block Ciphers and  The Data Encryption Standard  (Chapter 3.1, 3.5) slides The Advanced Encryption Standard slides  (Chapter 3.6) Block Cipher Modes of Operation  (slides) (Chapter 3.7)
Week 3, Jan. 28	Secure Symmetric Encryption ( slides for the next three lectures) Lectures will be based on the following paper (pdf). Only the security of the XOR scheme under chosen plaintext attack will be covered. You can just read the pages 6-7, section 4 and section 5 of the paper. In addition, you can study this topic from the Chapter 5 and Chapter 6 of the Goldwasser& Bellare book available online
Week 4, Feb. 4	Secure Symmetric Encryption cont.
Week 5, Feb. 11	Hash Function, Data Integrity and Security of Hash functions (Chapter 4.1, 4.2) Slides for the next few lectures HW1 is available on Elearning. Due date is Feb 25th.
Week 6, Feb. 18	Iterated Hash Functions (Chapter 4.3) Message Authentication Codes (Chapter 4.4) (slides)
Week 7, Feb. 25	Message Authentication Codes cont. (Chapter 4.4) Proof of HMAC Security Introduction to Public-Key Cryptography (Chapter 5.1)
Week 8, Mar. 4	Number Theory for Public Key (Chapter 5.2) (slides) HW2 is available on Elearning. Due date is Mar. 18th
Week 9, Mar. 11	RSA CryptoSystem (Chapter 5.3) (slides) Primality Testing (Chapter 5.4) (slides) Square roots Modulo n (Chapter 5.5) Attacks on RSA (Chapter 5.7) (Only brief discussion.) The Rabin-Crypto System (Chapter 5.8) (slides) HW3 is available on Elearning. Due date is Mar. 25th
Week 10, Mar. 18	SPRING BREAK
Week 11, Mar. 25	Semantic Security of RSA (Chapter 5.9) (slides) Probabilistic Encryption (Chapter 8.4) Only Goldwasser-Micali System will be covered.
Week 12, Apr. 1	MIDTERM in CLASS All the topics till the end of March 11th class is covered
Week 13, Apr. 8	Overview of Rabin Crypto System (slides) Elgamal Cryptosystem (Chapter 6.1) (slides) Security of ElGamal Systems (Chapter 6.7.2 and 6.7.3) HW4 is available on Elearning. Due date is April 22nd
Week 14, Apr. 15	Signature Schemes (Chapter 7.1-7.2) (slides) Elgamal,Schnorr and DSA (Chapter 7.3-7) HW5 is available on Elearning. Due date is Apr. 29th.
Week 14, Apr. 22	Homomorphic Encryption
Week 14, Apr. 29	Predicate Encryption
FINAL EXAM