Cracking RSA Ciphers That Have A Low-exponent
2 min readJun 5, 2022
In RSA, we have:
The (mod N) part provides a core part of the security of the method. But when happens when M^e is less than N. Well, the cipher is easily cracked.
Normally, in RSA, we select two prime numbers of equal length (p and q), and then multiply these to give a modulus:
