# Help in understanding how to apply nonlinear function in hashing

Can somebody help in brainstorming how to apply the map as a hashing function? I am aware that chaos is used in cryptography but I fail to understand how to apply it. Most popular hashing techniques is the modulo hash function Why is it best to use a prime number as a mod in a hashing function? A modulo chaotic function that comes to my mind is the Dyadic map $\theta = 2 \theta mod 1$. Not getting into the details of collision resolution and other technicalities, it shall be of immense help if the application of chaos map is shown in generating hash codes. Chaos based cryptography link to paper shows that the equation on page 3 $S^t = (u^t + 2S^{t-1} + t) mod 256$ is the hashing function for cryptography. $t$ are the number of sub-blocks of the message (plaintext) and $u_0$ is the decimal value of the first block of the message. Please help! Thank you

• I can't tell what your question is. It seems to require a huge amount of background reading followed by a request for help with brainstorming. On this site, we're looking for clear questions with definite answers, not invitations to discussion. – David Richerby Jun 11 '16 at 10:43