EECS 690: Cryptography and Information Security
Cryptography has played an important role during the enforcement
of information security. In this course, we are going to present
the building blocks in this literature and how these simple yet neat
ideas can be combined to construct the safest and most powerful security
mechanisms. We will first introduce the basic schemes such as symmetric
encryption, asymmetric encryption, and one way functions. The cryptographic
protocols based on these building blocks will then be studied. The example
protocols include: key exchange and establishment, digital signature, secret
sharing, bit commitment, zero knowledge proof, and oblivious transfer.
The design and implementation of several algorithms will be presented.
The example algorithms include: DES, RSA, one way hash functions, random
sequence generation, and authentication mechanisms. At the system level, we
will discuss the security policy for data storage and retrieval, access control,
privacy preserved data mining, trust establishment, and the management of the policies.
Syllabus
Week 1 slides
Week 2 slides
Week 3 slides , Week 3 slides part 2 ,
Week 4 slides
Homework 1 posted, due on March 1st
Week 5 slides
The Format of Proposal
Week 6 slides
Homework 2 posted, due on March 13th, Monday
Week 7 slides
Week 10 slides
Week 11 slides, Part 2
Week 12 slides, Part 2
Week 14 slides
Presentation contents, and
Demo Date
The final project report will due at the final exam. The format is as
follows.
What we have covered after midterm: Final Review.
Please remember to bring your calculator to the final exam.
I will try to be in Eaton 3032 Monday afternnon from 3:00 pm to 5:00pm. I need to go to Sprint Monday morning, so maybe a little late.