Timeline for How do we know if we have successfully decrypted something?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2018 at 3:00 | comment | added | e-sushi | Possible duplicate of How can a decryption program tell me that a private key is incorrect for RSA and ECC? | |
| Nov 11, 2018 at 3:44 | comment | added | dave_thompson_085 | ... But for RSA as currently practiced (mostly 1024-bit or 2048-bit) using all the energy in the universe for your bruteforce attempt won't make even a metaphorical dent. Have you seen the classic movie Forbidden Planet where there's a whole room full of meters, each one ten times the previous, for the great Krell machine? If this were recalibrated for RSA you wouldn't even move the needle on the leftmost (smallest) one by a single atom. | |
| Nov 11, 2018 at 3:40 | comment | added | dave_thompson_085 | In practice RSA is not used to encrypt sentences in English or any other language, which in any case aren't the only things people want to communicate securely. Generally a hybrid scheme, see wikipedia, uses RSA to encrypt a nonce key used to symmetrically encrypt the data. But unlike the 'naive' version used as an exercise in math classes and copied to billions of websites by uninformed people, in practice RSA encryption uses padding which makes it easy to check if a decryption is valid, again see wikipedia and tens if not hundreds of existing Qs. ... | |
| Nov 10, 2018 at 22:11 | answer | added | kelalaka | timeline score: 1 | |
| Nov 10, 2018 at 21:50 | review | First posts | |||
| Nov 10, 2018 at 22:07 | |||||
| Nov 10, 2018 at 21:47 | history | asked | J.Doe | CC BY-SA 4.0 |