Suppose you’re using RSA with the primes In that case, what are n, n , and d? What is the encryption of the value 1,337? What is the decryption of 19,905? (You may want to use the ExponentiateMod...

Suppose you’re using RSA with the primes
In that case, what are n, n , and d? What is the encryption of the value 1,337? What is the decryption of 19,905? (You may want to use the ExponentiateMod program from Chapter 2. You may also want to write a program to find inverses in a modulus, or you can use the MultiplicativeInverse program included in this chapter’s downloads.)