What is the inverse of 4 mod 9?
Computing discrete square roots mod n, where n is the product of two primes, is as hard as factoring n. What mechanism is used to show that?
If primes p = 5 and q = 11 are chosen, what are the private and public keys selected for the RSA system? What are the encoding and decoding functions?
In public key cryptography, we give away enough information to break the encryption. What makes us think that nobody can make effective use of that information?