3 ms·
To out-pedant you: even assuming that the differential collision attacks we know about are incorrect [1], we absolutely know how to break SHA-1 given enough com
by pbsd 12y ago
To out-pedant you: even assuming that the differential collision attacks we know about are incorrect [1], we absolutely know how to break SHA-1 given enough compute, that is, roughly the same resources needed to break RSA-1024. The answer is generic collision finding with parallel rho [2].
[1] https://marc-stevens.nl/research/papers/EC13-S.pdf https://marc-stevens.nl/research/papers/EC13-S.pdf
[2] http://people.scs.carleton.ca/~paulv/papers/JoC97.pdf http://people.scs.carleton.ca/~paulv/papers/JoC97.pdf
- tptacek 12y agoYou haven't so much out-pedanted me as refuted me. :)
- konklone 12y agoI added links to both papers to the bottom, and removed the "we'll probably need to upgrade" to SHA-3 sentence fragment.
- yuhong 12y agoIt seems that the identical prefix collision would be good to investigate doing an ASIC on.