CS 178: Introduction to Cryptography (Winter 2017)
General Information
Instructor: Huijia (Rachel) Lin, rachel.lin(at)cs(dot)ucsb(dot)edu
TA: Priayanka Bose, priyanka (at) cs (dot) ucsb (dot) edu
Reader: Kirti Bhandari, kirtibhandari (at) umail (dot) ucsb (dot) edu
Time and location:
 Class: Monday/Wednesday 11am12:15pm, PSYCH 1902
 Session 1: Friday 9:009:50am, 387 104
 Session 2: Friday 2:002:50pm, PHELP 3525
Office hours:
 Priayanka Bose: Tuesday 3:00pm 5:00pm, Trailer 936
 Rachel Lin: Wednesday 4:30pm5:30pm, HFH 1153
Piazza: We will be using Piazza for classrelated discussions, posting homework and materials, and announcement. The Piazza page for this class is available at https://piazza.com/ucsb/winter2017/cs178/home.
Topics
Cryptography provides important tools for ensuring the privacy, authenticity, and integrity of the increasingly sensitive information involved in modern digital systems. Nowadays, core cryptographic tools, including encryption, message authentication codes, digital signature, key agreement protocols, etc., are used behind millions of daily online transactions. In this course, we will unveil some of the "magic" of cryptography.
Modern Cryptography uses mathematical language to precisely pin down elusive security goals, design primitives and protocols to achieve these goals, and validate the security of designed primitives and protocols using mathematical proofs based on clearly stated hardness assumptions. Therefore, to learn cryptography, it is essential to understand its mathematical underpinning. In this class, we will see the innerworking of cryptography for several core cryptographic tools, from encryption, to message authentication codes, to hash functions, to digital signatures, etc.
Required background: Though the presentation in this class will largely remain at an intuitive level, the class still requires a certain level of mathematical maturity (students should be ready to understand mathematical definition and proofs, and to write simple ones). Exposure to basic probability, algebra / elementary number theory and theory of computing is also expected. If in doubt, contact the instructor!
Textbook and Resources
There is no mandatory textbook. The class will take contents from the following textbook and lecture notes. The instructor will post reading material after each class. M. Bellare Introduction
to Modern Cryptography (Click on the link "Course Notes" on the
left panel)
The page contains both lecture slides and notes. The notes are by Mihir Bellare and Phillip Rogaway. We will use mostly the slides.  R. Pass and a. shelat. A Course in Cryptography (Lecture Notes)
 D. Stinson Cryptography, Theory and Practice (Third Edition)
 M. Bellare and P. Rogaway's more advanced lecture notes. Introduction to Modern Cryptography
 O. Goldreich. The Foundations of Cryptography
 J. Katz and Y. Lindell. Introduction to Modern Cryptography
Grading:
There will be five homework, one midterm exam, and one final exam. Each homework accounts for 10% points, midterm 20% points, and final 30% points. Your final grade will depend on the weighted total points, and your ranking in the class.Class Policy:
 Every homework will be posted online on days indicated below in the syllabus by 11:59pm PST, and are due on days indicated below at 4:00pm PST. The homework can be submitted at the beginning of the class or to the homework box in the CS mail room.
 Students can form groups of 3 (or less) to discuss about the homework. But each student must write down his/her own solution and acknowledge the collaborators.
 The midterm and final exams must be completed independently. The only material allowed during the exam are 2 pages of handwritten notes. If additional material is allowed, the instructor will communicate before the exams.
Syllabus
The following is a rough list of topics to be covered in the class. This list will be changed and refined during the course depending on the pace of the class.
Week  Date  Content  Reading Material  Assignment 

1  20170109 


20170111 



2  20170116 


20170118 


3  20170123 



20170125 



4  20170130 


20170201 


5  20170206 



20170208 


6  20170213 


20170215 



7  20170220 


20170222 


8  20170227 


20170301 



9  20170306 


20170308 


10  20170313 



20170315 


11  20170323 
