“…A good cryptography curriculum is presented in [1], which covers: Mathematics: integer factorization problem, RSA problem, quadratic residuosity problem, computing square roots in Zn, discrete logarithm, Diffie-Hellman problem, composite mod, computing individual bits, Tsubset sum problem, factoring polynomials over finite fields, probabilistic primality tests, (True) Primality tests, prime number generation, irreducible polynomials over Zp, generators and elements of high order, cryptographically secure pseudorandom bit generation …”