I have a project wherein I have to crack a given cipher text encrypted using RSA and have been given N and e. Can someone suggest an RSA attack using a very small exponent e(here e=3) and no padding?
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
migrated from security.stackexchange.com Mar 21 '13 at 0:53
This question came from our site for information security professionals.
If there is no padding, then you can try the following: