Introduction to Cryptography (CS 6377) 
Time and Location     : Tue/Thr 4:00-5:15pm, FO 1.50

 

 Instructor:  
Murat Kantarcioglu
 
Office Hours & Location
Tue/Thr 5:30-6:30pm
 

 

Teaching Assistant:  
Robert Nix, rcn062000@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         %15  (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. 16

  • Introduction to Modern Cryptogprahpy (slides)
  • Perfect Secrecy and One-time Pad   (slides)  (Chapter 2.1-2.3)

Week 2- Jan. 23

  • 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. 30

 

Week 4- Feb. 6

  • Secure Symmetric Encryption cont.
  • HW1 is available on Elearning. Due date Feb. 23 Midnight.

Week 5- Feb. 13

Week 6- Feb. 20

  • Iterated Hash Functions (Chapter 4.3)
  • Message Authentication Codes (Chapter 4.4) (slides)

Week 7- Feb. 27

  • Message Authentication Codes cont. (Chapter 4.4)
  • Proof of HMAC Security
  • Introduction to Public-Key Cryptography (Chapter 5.1)
  • HW2 is available on Elearning. Due date is Mar. 22 Midnight.

Week 8-Mar. 5

  • Number Theory for Public Key (Chapter 5.2) (slides)
  • RSA CryptoSystem (Chapter 5.3) (slides)
  • Primality Testing (Chapter 5.4) (slides)
  • Square roots Modulo n (Chapter 5.5)

Week  9- Mar. 12

  • Spring break

Week 10- Mar. 19

  • 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 April 2, 2012 Midnight.

Week 11- Mar. 26

  • Semantic Security of RSA (Chapter 5.9) (slides)
  • Probabilistic Encryption (Chapter 8.4)
  • Only Goldwasser-Micali System will be covered.

Week 12- Apr. 2

  • Overview of Rabin Crypto System (slides)
  • Elgamal Cryptosystem (Chapter 6.1) (slides)
  • MIDTERM in CLASS.  April 3, 2012.
  • HW4 is available on Elearning.

Week 13- Apr. 9

  • Security of ElGamal Systems (Chapter 6.7.2 and 6.7.3)

Week 14- Apr. 16

  • Signature Schemes (Chapter 7.1-7.2) (slides)
  • Elgamal,Schnorr and DSA (Chapter 7.3-7)

Week 15- Apr. 23

  • Elliptic Curves (Chapter 6.5) (Lecture notes)
  • Using Crypto. systems in Practice
    • Bruce Scheneir's paper (pdf)
  • HW5 is available on Elearning.

Week 16, Apr. 30

  • Identity-based Encryption (pdf)
May 10, 2012
  • FINAL EXAM (Location:  FO 1.502, Time: 2:00-4:45pm)