Suppose Michael creates an RSA cryptosystem with a very large modulu.pdf
0 likes5 views
Michael's RSA cryptosystem uses a large modulus n, and Nikita encrypts messages by converting characters to integers and applying RSA encryption. However, this method is not secure as it can be equated to a Caesar cipher, which is vulnerable to frequency analysis. Thus, the encryption does not provide sufficient security against determined attackers.
1 of 1
Download to read offline
Suppose Michael creates an RSA cryptosystem with a very large modulu.pdf
- 1. Suppose Michael creates an RSA cryptosystem with a very large mod-ulus n for which the factorization of n cannot be found in a reasonable amount of time. Suppose that Nikita sends messages to Michael by representing each alphabetic character as an integer between 0 and 26 (A corresponds to 1, B to 2, etc., and a space to 0), then encrypts each number separately using Michael's RSA cryptosystem. Is this method secure? Explain your answer. Solution This method is not secure, it is just equal to a "Ceaser Cipher", that is a permutation of letters of alphabet, which is well-known to be easily broken using a frequency analysis.