Timeline for Cracking simple RSA when just the ciphertext and one public key is known
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 14, 2016 at 8:45 | comment | added | Blub | Depending on the situation you might also have e=3 and without padding you might then be able to decrypt the ciphertext by simply taking the cube root. | |
| Nov 19, 2015 at 21:01 | comment | added | dave_thompson_085 | Unpadded RSA is simple, or at least simpler, but it is definitely NOT STANDARD because it is a Very Bad Idea to use it for anything, ever. | |
| Nov 19, 2015 at 4:51 | answer | added | P Holder | timeline score: 1 | |
| Nov 17, 2015 at 18:20 | comment | added | fgrieu♦ | Hint: if what you don't know about the plaintext is small enough, you can guess it, and check your guess. Other attacks might apply depending on parameters unstated in the question. | |
| Nov 17, 2015 at 18:08 | review | First posts | |||
| Nov 18, 2015 at 7:09 | |||||
| Nov 17, 2015 at 18:07 | history | asked | Aswin G | CC BY-SA 3.0 |