As a developer, is the fact that it only uses S-boxes supposed to be beneficial to me somehow? Does this mean it runs faster? Uses less memory? Is it an academic exercise? Why would I use this over a different hash function?
""" I went to random.org and generated 32 sets of 256 no-repeat numbers between 0 and 255 inclusive. """
We have someone with the practical cryptographic knowledge to design their own cryptographic code, but they grab their random numbers from a website... ;)
It fails all smhasher tests and is pretty slow. There's a reason other hashes do more than just sbox mixing. It's a proof of concept of a bad hash function. But it works fine on javascript, I guess.
One suggestion I'd have here would be using "nothing-up-my-sleeve" numbers like pi/e/log2 in hex. [1]
[1] https://en.wikipedia.org/wiki/Nothing-up-my-sleeve_number
