Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> In practice, collisions should never occur for secure hash functions.

That is mathematically impossible when reducing an N bit string to an M bit string, where N > M.

All hashes have collisions; it's just how hard are they to find.



They said "in practice" for a reason.




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

Search: