Integer hash functions are generally non-cryptographic hash functions that map from integers to other integers.
I’ve touched on this topic a little in my Avalanche diagram page.
Useful links
- https://crypto.stackexchange.com/questions/12145/need-32-bit-mixing-function-that-has-perfect-avalanche-between-octets
- https://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html
- https://jonkagstrom.com/bit-mixer-construction/
- https://www.pcg-random.org/posts/developing-a-seed_seq-alternative.html
- https://ticki.github.io/blog/designing-a-good-non-cryptographic-hash-function/
- https://naml.us/post/inverse-of-a-hash-function/
- https://marc-b-reynolds.github.io/math/2017/10/13/IntegerBijections.html
- https://nullprogram.com/blog/2018/07/31/
