Problem 1: When making an RSA key pair, the process is to choose e, then calculate d. What is the algorithm used to calculate d?
Problem 2: In Shamir Secret Sharing, why do we need at least q (quorum) many people to come together to determine the secret?
Problem 3: What is one reason Rabin signatures use N = pq (where p and q are primes), and not N = pqr?
Problem 4: What are the 3 computationally intractible problems ?
Problem 5: Which computationally intractible problem gives non-elliptic curve Diffie Hellman its security?
Problem 6: Why is the point at infinity important for Elliptic Curves?