General Information

Formalities

Location and Hours

Please check the course schedule.

Staff

Instructor:
li.ca.uat.sc|ynneb#rohC ynneB .forP Homepage
Teaching Assistant:
li.ca.uat|dohinar#doH inaR

Feel free to coordinate reception hours with Benny and/or Rani via email.

Course Outline

This course will discuss basic building blocks of modern cryptography. Tentative topics include encryption,
data integrity, authentication and identification, digital signatures, elementary number theory, randomness
and pseudo-randomness, cryptographic protocols, and real world security systems.
As a byproduct, you might become acquainted with some symbolic mathematics software.

Travel Advisory!

Based on the feedback forms from 2007, most students thought the course was way too hard.
A few thought it was worth the effort.
This leaves the lecturer puzzled as to why so many (approx. 85) insisted on taking it.
As for students in future generations of this course (and same lecturer) - caveat emptor!

Administrativia

Recommended Prerequisites

  • Linear Algebra
  • Probability
  • Algorithms
  • Computational Models
  • and most importantly, "mathematical maturity".

Grade

Based on final exam (70-80%) and homework assignments (30-20%).

Home Assignments

Homework submission is in singles or pairs. There will be a total of 3-4 problem sets consisting of both "dry" assignments
and a "wet" component (involving small Sage/Maple/Wolfram Alpha programs).
The homework portion of the grade is determined by the the weighted average of all assignments.

Reading

Text Books

  1. J. Katz and Y. Lindell, Introduction to Modern Cryptography, Chapman & Hall/CRC Press, 2007.
  2. V. Shoup, A Computational Introduction to Number Theory and Algebra (Version 1), 2005. Available online.
  3. D. Stinson, Cryptography Theory and Practice, CRC Press, 1996.

Recommended books

  1. A. Menezes, P. Van Oorschot, S. Vanstone, Handbook of Applied Cryptography, Available online.
  2. B. Schneier, Applied Cryptography, Wiley & Sons, 1996.
  3. P. Giblin, Primes and Programming: An Introduction to Number Theory with Computing, Cambridge University Press, 1993.

Classical Articles

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License