Course Overview
This course covers the main concepts and principles of Cryptography with the main emphasis on Public Key Cryptography. It begins with the review of integers and a thorough coverage of Group Theory fundamentals followed by the RSA and ElGamal ciphers. Oblivious Transfer Protocols, Zero Knowledge Proofs, Peseudorandom Numbers and Random Number Generators along with various factorization attacks will also be covered. Key management issues, cryptosecurity, authentication procedures and confidentiality is discussed. Hash algorithms are covered. There will be programming assignments to code the Euclidean Algorithm, the Fast Exponentiation Algorithm, the Primitive Root Search Algorithm, the Baby-step Giant-step Algorithm, the Index Calculus Algorithm, the Miller- Rabin Test, the Noar-Reingold Random Number Generator, the Blum-Blum-Shub Random Number Generator and the Pollard's p-1 method.

Prerequisites
MET CS 248, Discrete Mathematics and CS 566, Analysis of Algorithms