Cryptography, Cybersecurity, Number Theory, Information Security, Rsa.
1987. He then computes two public keys N = pq = 2430101 and e = 948047 where e satisfies the requirement that gcd(e, (1223–1)(1987–1)) = 1. Anthony makes N and e publicly available. Steve takes Anthony’s public keys, N and e, to encrypt his bank routing number: c = m^e(mod N) = 123⁹⁴⁸⁰⁴⁷(mod