I don’t have time to briefly explain an algorithm, however I decided to publish it here. Maybe in future I will write a paper on it. Below ready to use snippet of code.
Fast, cryptographic & secure. 2^n period.
Passes all test cases: dieharder, testU01.
Purpose: hashing, generating random numbers.
Bye, have a nice day.