1. Repeat for the public key he = 11, n = 12,187,823i, and the ciphertext c = 7,303,892 2. Repeat for the public key he = 5, n = 662,983,829i, and the ciphertext c = 43,574,279. In both key generation...

1. Repeat for the public key he = 11, n = 12,187,823i, and the ciphertext c = 7,303,892

2. Repeat for the public key he = 5, n = 662,983,829i, and the ciphertext c = 43,574,279.

In both key generation and encryption/decryption, the RSA cryptosystem completes a number of steps that require some nonobvious ideas to make them efficient. Luckily, we’ve covered those ideas at various times in previous parts of the chapter. For each of the following, explain how to compute the desired quantity efficiently (that is, with a number of primitive arithmetic operations that’s O(logk n) for the value of n in the RSA protocol, for some constant k).