RSA Walkthrough
Questions
1. (step 3) How fast can you factor n into its prime factorization? How difficult would it be to find the factorization of n if each of the primes had 300 digits? This is why RSA encryption is secure.
2. (step 4) What does relatively prime really mean? Why do we find the greatest common divisor when determining if two numbers are relatively prime?
3. (step 5) What's the best method you've found for finding e? A calculator could work, but I like considering the multiples of d. Is there a better way to find e?
4. (steps 6 - 8) What is the advantage of having a public encryption key and private decryption key? How does the theorem on step 8 relate to encrypting and decrypting a message?
Link to modular expodentiation calculator
Because of constraints with GeoGebra, a modular exponentiation calculator is needed for steps 6 and 7
https://www.dcode.fr/modular-exponentiation