4 ms·

In the linked work, we've broken 92% of SHA-256 across its full 64 rounds, and were encouraged to publish it by the leading cryptographer in the field (who held

In the linked work, we've broken 92% of SHA-256 across its full 64 rounds, and were encouraged to publish it by the leading cryptographer in the field (who held the previous record). Currently, SHA-256 is the basis of TLS certificates, bitcoin, and many other security applications. We think it is time to begin to migrate to other hash families, because we expect the rest of SHA-256 to fall soon.

deleted 7mo ago
[deleted]
Freak_NL 7mo ago
Why omit the name of the leading cryptographer in the field?
- rdtsc 7mo ago
  Pretty sure his first name is Claude. He is quite good I hear ;-)
- polotics 7mo ago
  shallow broad vague boastful and wordy, this way you know the LLM is nearby...
- thadt 7mo ago
  They specifically call out Yingxin Li[1] in the acknowledgements section of the paper? [1] https://eprint.iacr.org/2024/349 https://eprint.iacr.org/2024/349
vl 7mo ago
What does it mean to “break broken 92% of SHA-256“?
- hagbard_c 7mo ago
  As long as there is no verification of the results and their relevancy in reaching higher numbers it means as much as nearly having won the lottery by guessing 9 of the 12 numbers correctly: you did not win the lottery.
skullone 7mo ago
Go seek a mental health professional and never post here again until you have been diagnosed and medicated.
Retr0id 7mo ago
I believe I hold the actual record for most colliding bits in full-round SHA256 (72% of bits matching). My proof fits in a tweet, why doesn't yours? https://news.ycombinator.com/item?id=38668893 https://news.ycombinator.com/item?id=38668893 (Also my work does not demonstrate any weakness in SHA256, it's just an application of the birthday paradox)
- logicallee 7mo ago
  Yeah, you're way ahead of us on the "does our proof fit in a tweet" metric! How did you get 72% of the bits to match, is there a writeup anywhere? It's very impressive. Algabraically, it seems you'd need about 2 million hashes, and around 2 million million (10^12 = 2 trillion) comparisons to go through all of them. Did you just put in the computing time, or did you use any algabraic properties? Since you've made hashes that match at the beginning and end, you might also be interested in our exploration of alternative presentation formats that make attacks like this a little bit more difficult. We were working on a new hash and thought about how to assist people visually at the presentation level. This one tests your speed versus a typical hex presentation.[1] [1] https://claude.ai/public/artifacts/05e8b21b-fb31-4c07-83e2-5c8138c25670 https://claude.ai/public/artifacts/05e8b21b-fb31-4c07-83e2-5...

deleted 7mo ago

[deleted]

Freak_NL 7mo ago

Why omit the name of the leading cryptographer in the field?

rdtsc 7mo ago
Pretty sure his first name is Claude. He is quite good I hear ;-)
polotics 7mo ago
shallow broad vague boastful and wordy, this way you know the LLM is nearby...
thadt 7mo ago
They specifically call out Yingxin Li[1] in the acknowledgements section of the paper? [1] https://eprint.iacr.org/2024/349 https://eprint.iacr.org/2024/349

vl 7mo ago

What does it mean to “break broken 92% of SHA-256“?

hagbard_c 7mo ago
As long as there is no verification of the results and their relevancy in reaching higher numbers it means as much as nearly having won the lottery by guessing 9 of the 12 numbers correctly: you did not win the lottery.

skullone 7mo ago

Go seek a mental health professional and never post here again until you have been diagnosed and medicated.

Retr0id 7mo ago

I believe I hold the actual record for most colliding bits in full-round SHA256 (72% of bits matching). My proof fits in a tweet, why doesn't yours? https://news.ycombinator.com/item?id=38668893 https://news.ycombinator.com/item?id=38668893 (Also my work does not demonstrate any weakness in SHA256, it's just an application of the birthday paradox)

logicallee 7mo ago
Yeah, you're way ahead of us on the "does our proof fit in a tweet" metric! How did you get 72% of the bits to match, is there a writeup anywhere? It's very impressive. Algabraically, it seems you'd need about 2 million hashes, and around 2 million million (10^12 = 2 trillion) comparisons to go through all of them. Did you just put in the computing time, or did you use any algabraic properties? Since you've made hashes that match at the beginning and end, you might also be interested in our exploration of alternative presentation formats that make attacks like this a little bit more difficult. We were working on a new hash and thought about how to assist people visually at the presentation level. This one tests your speed versus a typical hex presentation.[1] [1] https://claude.ai/public/artifacts/05e8b21b-fb31-4c07-83e2-5c8138c25670 https://claude.ai/public/artifacts/05e8b21b-fb31-4c07-83e2-5...