Timeline for Is an invulnerable code possible (including brute force attack)?
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 1, 2020 at 21:34 | vote | accept | david david | ||
| Apr 1, 2020 at 21:34 | vote | accept | david david | ||
| Apr 1, 2020 at 21:34 | |||||
| Apr 1, 2020 at 21:34 | vote | accept | david david | ||
| Apr 1, 2020 at 21:34 | |||||
| Aug 30, 2019 at 19:16 | comment | added | kelalaka | If you want to see actually how hard even known-plaintext attack see the RSA DES challange | |
| Aug 30, 2019 at 10:40 | answer | added | Geoffroy Couteau | timeline score: 2 | |
| Aug 30, 2019 at 1:55 | answer | added | Squeamish Ossifrage | timeline score: 3 | |
| Aug 29, 2019 at 16:05 | comment | added | david david | It is to my knowledge that prime number codes can only be breaked with a brute force attack. Of course we lack the computational power to do so.However if there are other methods please enlighten me. | |
| Aug 29, 2019 at 13:08 | comment | added | tylo | Doing AES directly without a proper mode of operation is bad practice (also see weaknesses of ECB mode). Making things more complicated does not make you more secure, unless you can back it up. And only considering brute-force attacks is quite useless. Today's security requires much more than that. | |
| Aug 29, 2019 at 7:35 | history | edited | kelalaka |
edited tags
|
|
| Aug 29, 2019 at 0:35 | answer | added | user71506 | timeline score: 1 | |
| Aug 29, 2019 at 0:22 | comment | added | Macil | Doing two layers of (unauthenticated) encryption is just a less efficient way of encrypting with a key that's twice as large. (Also in general, authenticated encryption is better, so doing a strategy that encourages unauthenticated encryption isn't great.) | |
| Aug 28, 2019 at 20:01 | answer | added | kelalaka | timeline score: 6 | |
| Aug 28, 2019 at 19:52 | history | edited | kelalaka | CC BY-SA 4.0 |
title typo
|
| Aug 28, 2019 at 19:50 | review | First posts | |||
| Aug 28, 2019 at 19:52 | |||||
| Aug 28, 2019 at 19:49 | history | asked | david david | CC BY-SA 4.0 |