Unless you enumerate all of the permutations of the set, I don't know how this could possibly work.That's exactly what I'm doing; there is no need to limit yourself to individually selected numbers. If you treat each shuffled set as a random selection from the set of all possible shuffles, then you have a perfectly good random number, equivalent to a randomly selected integer from 1 to N!. If you do M shuffles, you can select random numbers from a set of size N! ^ M. It doesn't take a very large N and/or M to reach the cardinality needed from cryptographic applications.
In reply to Re^8: How to generate different random numbers?
by Pragma
in thread How to generate distinct random numbers?
by johnnywang
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |