TIME/PLACE: TTh 11:00-12:30, RAS 215
INSTRUCTOR: Anna Gál
Office hours: TTh 1:30 - 2:30 pm or by appointment.
(except September 16 and September 18)
TEACHING ASSISTANT: Andy Mills (amills@cs)
TA Office hours: Monday 2-3 pm, Wednesday 1:30-2:30 pm ENS 31NQ
This course is a theoretical introduction to cryptography. The topics we will cover include:
TEXTBOOK: We will use the book "Introduction to cryptography with coding theory" by W. Trappe, and L. C. Washington. The lectures will also cover material that is not in the book, therefore class attendance and taking good notes are important.
BACKGROUND: The course will involve mathematical reasoning and proofs. We will cover the necessary mathematics in class, but some familiarity with the complexity of algorithms and probabilities will be assumed.
I recommend reviewing the first 4 chapters of "Discrete Mathematics and its Applications" by Kenneth H. Rosen (textbook for CS336) before taking the course. This includes a review of the growth of functions (1.8), fundamentals of algorithms and basic number theory (chapter 2), mathematical reasoning and proofs (3.1, 3.2) and probabilities (4.4, 4.5).
HOMEWORK: The homework may involve some programming, but most of the assignments will be paper/pencil exercises.
TESTS: There will be three written tests during the course on September 18, October 23 and on December 4 in class. (No final exam.)
GRADING: Homework: 50%, Test 1: 10% Test 2: 20%. Test 3: 20%.