Instructor: Professor Savo Glisic The research and practical results on Quantum computers in the recent years have given a major setback to classical and widely used cryptography schemes such as  (Rivest‐Shamir‐Adleman) Algorithm and ECC (Elliptic Curve Cryptography). RSA and ECC depend on integer factorization problem and discrete logarithm problem respectively, which can be easily solved by Quantum Computers of sufficiently large size running the infamous Shor’s Algorithm. Therefore, cryptography schemes which are difficult to solve in both traditional as well as Quantum Computers need to be evaluated. This course provides a detailed survey on Post‐Quantum Cryptography schemes and emphasizes their applicability to provide security in constrained devices. A comprehensive insight is provided into the schemes which could possibly replace RSA and ECC for security in constrained devices. Read full course description including course schedule