Timeline for Brute-force breakability in practice determined by recognizability of plaintext?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2016 at 9:48 | comment | added | Peter M. | The practical scenario I have in mind is the encryption of one's own files on disk, using a standard algorithm, e.g. AES. I don't see how a chosen-plaintext attack pertains to that situation (but correct me if I'm wrong). It seems to me that even if someone has hardware that makes a brute-force attack feasible in terms of computation time, it is hopeless if I trivially "scrambled" my files prior to AES encryption. Right or wrong? | |
| Nov 5, 2016 at 9:28 | history | answered | Elias | CC BY-SA 3.0 |