Timeline for Why this brute force attack doesn't reduce all cryptographic hash functions' security bits against collision attacks to N/3?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2019 at 16:38 | history | edited | Yanai Eliyahu | CC BY-SA 4.0 |
deleted 6 characters in body
|
| Aug 28, 2019 at 8:12 | vote | accept | Yanai Eliyahu | ||
| Aug 28, 2019 at 6:00 | history | tweeted | twitter.com/StackCrypto/status/1166591309408342016 | ||
| Aug 28, 2019 at 4:26 | history | became hot network question | |||
| Aug 27, 2019 at 22:47 | answer | added | Squeamish Ossifrage | timeline score: 8 | |
| Aug 27, 2019 at 21:11 | vote | accept | Yanai Eliyahu | ||
| Aug 28, 2019 at 8:12 | |||||
| Aug 27, 2019 at 20:50 | history | edited | Yanai Eliyahu | CC BY-SA 4.0 |
added 10 characters in body
|
| Aug 27, 2019 at 20:23 | answer | added | fgrieu♦ | timeline score: 4 | |
| Aug 27, 2019 at 20:19 | comment | added | Yanai Eliyahu | @kelalaka The sentence after that meant to support that statement, is it out of place? | |
| Aug 27, 2019 at 20:17 | comment | added | kelalaka |
Welcome to Cryptography. Could you elaborate The above attack needs less calls to the hash function because it relies on the fact that each sequential hashing reduces the number of possible hashes.
|
|
| Aug 27, 2019 at 20:15 | review | First posts | |||
| Aug 28, 2019 at 5:52 | |||||
| Aug 27, 2019 at 20:13 | history | asked | Yanai Eliyahu | CC BY-SA 4.0 |