Boomerang attacks on SHA-0 have a complexity on the order of 2^33. | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

bannable on Feb 6, 2020 | parent | context | favorite | on: Lessons from the history of attacks on secure hash...

Boomerang attacks on SHA-0 have a complexity on the order of 2^33.

willvarfar on Feb 7, 2020 [–]

The boomerang (against block ciphers) was coined in 1999. It was used against SHA-0 in 2008?

Apparently the NSA warned against SHA-0 in 1995.

So do we now know what they perceived the weakness to be? Or are we still guessing?

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact