Textbook RSA attack with many ciphertexts that only know e, and the bit length of p, q

Suppose Alice sends n numbers to Bob, encrypted with the same modulus (N) and the same encryption exponent e. Eve overhears the conversation and retrieves all of these ciphertexts. Number texts are not all unique (there is some repetition) and there is no padding. Eve also knows e and the bit length of both p, q. Can Eve restore the modulus N? Can she restore legible text? If so, how? For some values ​​let’s say bit length for both p, q is 512; e = 65537 and Eve has recorded more than 200 number texts. I thought about the common modulus attack but couldn’t get it to work because the encryption exponent is the same. what do you think?

About Cryptoplatforming.com

Cryptoplatforming.com is a news websites which gets news around the globe on investing in Crypto. Our news has no backgroundcheck.

Leave a Comment