Comment Can someone explain how SHA1 does this (Score 1) 779
In this article
it states
"Compare this with SHA-1 & RIPEMD with which no such forethought is necessary (because no B can be found that hashes to the same M with these two alternative algorithms)."
I would have thought that any hash algorith would *theoretically* have collisions. Can somebody smarter than me explain this.
Thanks.
it states
"Compare this with SHA-1 & RIPEMD with which no such forethought is necessary (because no B can be found that hashes to the same M with these two alternative algorithms)."
I would have thought that any hash algorith would *theoretically* have collisions. Can somebody smarter than me explain this.
Thanks.
