Explore >> Select a destination
|
You are here 
|
orlp.net | ||
| | | | |
xoranth.net
|
|
| | | | | ||
| | | | |
ticki.github.io
|
|
| | | | | These are my thoughts on designing fast, high-quality non-cryptographic hash functions. | |
| | | | |
danlark.org
|
|
| | | | | When it comes to hashing, sometimes 64 bit is not enough, for example, because of birthday paradox -- the hacker can iterate through random $latex 2^{32}$ entities and it can be proven that with some constant probability they will find a collision, i.e. two different objects will have the same hash. $latex 2^{32}$ is around... | |
| | | | |
tashian.com
|
|
| | | The story of a major hash table vulnerability, and how it took a decade to uncover and resolve. | ||
