Cryptography or cryptology is the science of designing algorithms and protocols for enabling parties to communicate and compute securely in an untrusted environment (e.g. secure communication, digital signature, etc.) Over the last four decades, cryptography has transformed from an ad hoc collection of mysterious tricks into a rigorous science based on firm complexity-theoretic foundations. This modern complexity-theoretic approach to cryptography will be the focus. E.g., in the context of encryption we will begin by giving a precise mathematical definition for what it means to be a secure encryption scheme and then give a construction (realizing this security notion) assuming various computational hardness assumptions (e.g. factoring).

* Time conflicts ARE allowed but midterms will be held during class and students must attend midterms in person. No alternate midterms will be given.

* Lecture WILL be recorded for playback later

* NO Alternate final exam offered.

Requisites

• Undergraduate Students: College of Engineering declared majors and L&S Computer Science

Repeat Rules

Course is not repeatable for credit.