3. Consider the following modified definition of an RSA decryption key, d' d' = e mod...

 

Transcribed Image Text:

3. Consider the following modified definition of an RSA decryption key, d' d' = e mod o' where o'o(n)/(gcd(p-1,q-1)) 2 M Show that RSA decryption works even under the new definition of the decryption key, i.e., m = cd (mod n) 3. Consider the following modified definition of an RSA decryption key, d' d' = e mod o' where o'o(n)/(gcd(p-1,q-1)) 2 M Show that RSA decryption works even under the new definition of the decryption key, i.e., m = cd (mod n)