Live data from Hacker News

Sha256 vulnerability for full rounds

github.com

1–10 of 12 posts

Re: Sha256 vulnerability for full rounds

#7
post #3

Same thing that's explained by https://crypto.stackexchange.com/a/48586 ? TLDR: It's easy to find fixed points of hashes like SHA-256.

Ah, great link. I was not aware of this "feature" of SHA256:

>To abuse this property you need to get the state of the hash to match a state you get when running the decryption of the blockcipher underlying the compression function. Finding such a match requires a meet-in-the-middle attack with cost 2n/2 and thus isn't cheaper than finding a collision.

Re: Sha256 vulnerability for full rounds

#8
post #3

Same thing that's explained by https://crypto.stackexchange.com/a/48586 ? TLDR: It's easy to find fixed points of hashes like SHA-256.

laie makes it sound like they found two things (free-start collision attack and circular hash attack).

I agree the free-start part isn't very interesting but I don't think we have enough information to confirm or dismiss whether the circular hash attack part is novel.

Re: Sha256 vulnerability for full rounds

#9
post #8
post #3

Same thing that's explained by https://crypto.stackexchange.com/a/48586 ? TLDR: It's easy to find fixed points of hashes like SHA-256.

laie makes it sound like they found two things (free-start collision attack and circular hash attack). I agree the free-start part isn't very interesting but I don't think we have enough information to confirm or dismiss whether the circular hash attack part is novel.

Extraordinary claims require extraordinary evidence, I think it's fair to dismiss those claims until they're capable of coming with a better justification than "I developed an entirely new type of cryptanalysis theory to achieve this."

Re: Sha256 vulnerability for full rounds

#10
post #8
post #3

Same thing that's explained by https://crypto.stackexchange.com/a/48586 ? TLDR: It's easy to find fixed points of hashes like SHA-256.

laie makes it sound like they found two things (free-start collision attack and circular hash attack). I agree the free-start part isn't very interesting but I don't think we have enough information to confirm or dismiss whether the circular hash attack part is novel.

Could you unpack "circular hash attack"? Googling was not very helpful.
Post reply on HN