** Lectures:** MW 12:30-1:45pm, WWH (Courant) 101.
** Instructor:**
Prof. Yevgeniy Dodis

** Email:** ` dodis@cs.nyu.edu`; ** Phone:** 212-998-3084;
** Office:** WWH (Courant) 508

** Office hours:** Wednesday 2-3pm and by appointment.

** Teaching Assistant:** Shabsi Walfish, ** Email:**
` walfish@cs.nyu.edu`; ** Phone:** 212-998-3127;

** Office:** WWH 505; ** Office Hours:** Thursday 5-6pm
and by appointment

** Course Web Page:**
`http://cs.nyu.edu/courses/fall02/V22.0480-001/index.htm`.
All course materials, handouts, homework and announcements will be
available here. You should plan on visiting this page regularly and
often!

** Mailing list:** To subscribe to the class list, follow
instructions at

No advanced mathematics background is assumed. However, students are expected to be somewhat comfortable with mathematical proof techniques (``mathematical maturity''), be at ease with algorithmic concepts, and have elementary knowledge of discrete math, number theory and basic probability. A brief review of relevant topics will be given as needed during the course, making it possible to follow the material. No programming will be required for the course.

``Mathematical maturity'' means simply that you have had exposure to
proofs and know what distinguishes a * formal proof* from a *
convincing argument*. It means you are familiar with "proofs by
induction" and "proofs by contradiction". It also implies being
comfortable with thinking about things in an abstract way.

Finally, learning cryptography involves a great deal of curiosity, creativity and originality. Please bring those along...

Grading will be based on the problem sets (given approximately bi-weekly), midterm/final exams and class participation. Depending on class enrollment and interests, it might be possible to do a small research project in place of the final exam.

There is still not a single entirely satisfactory text in cryptography. Among those present, there are two recommended but not required textbooks (see below), plus I encourage you to read my own notes from the graduate cryptography class that I taught. The two recommended textbooks are (1) Delfs and Knebl ``Introduction to Cryptography'' and (2) Stinson `` Cryptography Theory and Practice (second edition)''. Please contact the Reading section on the web site for more detailed information and other suggestions.

I expect you to try solving each problem set on your own. However,
when being really stuck on a problem, I ** encourage** you to
collaborate with other students in the class, subject to the following
rules:

- You may discuss a problem with one or two students in this
class, and work together on solving it. This can involve brainstorming
and verbally discussing the problem, going together through possible
solutions, but should
**not**involve one student telling another a complete solution. - Once you solve the homework, you should
**write up your solutions on your own**, without looking at other people's write-ups or giving your write-up to others. - In your solutions for each problem, you should
**write down the names**of the people with whom you worked on it. Do not worry that writing down the names will negatively affect your grade: it will not, as long as**you are honest**. - Sometimes, it is OK (but not encouraged) to give others a small
hint about your solution, but not the complete solution. When
**giving**such a hint, you do not need to acknowledge this in your write-up. When**given**such a hint, you**must**acknowledge this in your solution. - Do not consult solution manuals, other people's solutions from similar courses (or prior years of this course), and people not taking the class.