How can I find an injective function $f$ so that mapping that function over each element of the ordered sequence $[1\cdots{n}]$, yields a deterministic shuffle (random permutation) that is "good" enough to be considered pseudo-random?
What operations can I perform or repeat in the definition of $f$ in order to achieve better "entropy".
In the definition of $f$ we can use a $s$ (seed) constant number and $n$.