Description: A mathematically-oriented introduction to modern cryptography: weaknesses of historical cryptosystems, modular arithmetic, primality testing and factorization algorithms, private-key/symmetric cryptosystems, public-key/asymmetric cryptosystems and key-sharing (including RSA and Diffie-Hellman). Additional topics may include zero-knowledge protocols, digital signatures, homomorphic encryption and secured computation, elliptic curve cryptography, lattice-based cryptography, and other applications such as digital voting and cryptocurrencies. The course will include a technical paper exploring a modern topic of each student’s choice.

Description: A mathematically-oriented inroduction to modern cryptography: weaknesses of historical cryptosystems, modular arithmetic, primality testing and factorization algorithms, private-key/symmetric cryptosystems, public-key/asymmetric cryptosystems and key-sharing (including RSA and Diffie-Hellman). Additional topics may include zero-knowledge protocols, digital signatures, homomorphic encryption and secured computation, elliptic curve cryptography, lattice-based cryptography, and other applications such as digital voting and cryptocurrencies. The course will include a technical paper exploring a modern topic of each student’s choice.