Timeline for Finding hash almost-collisions
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 18, 2013 at 7:20 | vote | accept | 0xFE | ||
| May 11, 2013 at 11:13 | history | edited | mikeazo | CC BY-SA 3.0 |
deleted 123 characters in body
|
| May 10, 2013 at 19:45 | comment | added | mikeazo | @0xFE, if the problem is massively parallelizable, then hardware can make a huge difference. See cs.rit.edu/~ark/parallelcrypto/sha3test01 for more info (including some code). | |
| May 10, 2013 at 19:44 | comment | added | 0xFE | Cool! I didn't realize hardware could make all the difference. | |
| May 10, 2013 at 19:28 | history | edited | mikeazo | CC BY-SA 3.0 |
deleted 254 characters in body
|
| May 10, 2013 at 19:25 | comment | added | mikeazo | @CodesInChaos, this is good. I need all the checking of my math I can get. You are right, it should be $2^{51}$ for a $.5$ probability. Threw in a little birthday problem math by mistake. | |
| May 10, 2013 at 19:02 | comment | added | CodesInChaos | I don't get how you go from $2^{52}$ to $2^{26}$, considering this is a near pre-image, not a near collision. | |
| May 10, 2013 at 18:59 | comment | added | CodesInChaos | Your math can't be right, $2^{26}$ is far too low to win such a competition. That's less than a CPU minute on a single core. I'd expect them to easily exceed $2^{40}$. I wouldn't be surprised if they managed $2^{51}$ operations with ATI GPUs. | |
| May 10, 2013 at 18:41 | history | edited | mikeazo | CC BY-SA 3.0 |
added 5 characters in body
|
| May 10, 2013 at 18:26 | history | edited | mikeazo | CC BY-SA 3.0 |
added 70 characters in body
|
| May 10, 2013 at 18:08 | history | answered | mikeazo | CC BY-SA 3.0 |