The first chosen-prefix collision for SHA-1

Re:The first chosen-prefix collision for SHA-1 by vbrandl on Tuesday January 07, 2020 @11:44AM (#21981632)

Hashing is a separate problem from encryption. There is no proof that one way functions (the idea behind hashing) even exist (by proving this, you would actually prove P!=NP, IIRC). Encryption has a slightly better track record of being broken. AES still holds its promise and is also secure against quantum computing (you might want longer keys, but that's it).

And if you want really, provably unbreakable encryption, there is still OTP. But then you'd need a key, that is as long as the data you want to encrypt.

[ Parent | on HN ]

Re:The first chosen-prefix collision for SHA-1 by blattimwind on Tuesday January 07, 2020 @12:44PM (#21982362)

The best known attack against AES reduces attack complexity by about two bits over brute force. Given the history of block ciphers, the idea that AES might not be broken in this life time is not uncommon.

[ Parent | on HN ]