Text: RSA Decryption
Given a public key (exponent and modulus) and ciphertext (this RSA uses RSA/ECB/NoPadding), the modulus is 512 bits long. The question suggests either a dictionary attack or factorization (an English text file is provided for the dictionary attack).
I have assumed that p and q are close to each other, so I used the Fermat factorization method. However, after 2 hours, the program is still running.
Therefore, I think a dictionary attack is the only way, but I am clueless about the process.
Please help. Thank you.