Cryptography: Design and Analysis of Cryptosystems

3 credits · Undergraduate Programs

Review of basic algorithms and complexity. Designing and attacking public key cryptosystems based on number theory. Basic techniques for primality testing, factoring and extracting discrete logarithms. Elliptic curve cryptography. Additional topics may include knapsack systems, zero knowledge, attacks on hash functions, identity-based cryptography, and quantum cryptography. Prerequisite(s): Mathematics 315; and Mathematics 318 or Computer Science 418.