java生成随机数不重复,在Java中不重复的随机数生成

I would like to get clarifications on Pseudo Random Number generation.

My questions are:

Is there any chance for getting repeated numbers in Pseudo Random Number Generation?

When i googled i found true random number generation. Can i get some algorithms for true random number generation, so that i can use it with

SecureRandom.getInstance(String algorithm)

Please give guidance with priority given to security.

解决方案

1) Yes, you can generally have repeated numbers in a PRNG. Actually, if you apply the pigeon hole principle, the proof is quite straightforward (ie, suppose you have a PRNG on the set of 32-bit unsigned integers; if you generate more than 2^32 pseudo random numbers, you will certainly have at least one number generated at least 2 times; in practice, that would happen way faster; usually the algorithms for PRNGs will cycle through a sequence, and you have a way to calculate or estimate the size of that cycle, at the end of which every single number will start repeating, and the image of the algorithm is usually way, way smaller than the set from which you take your numbers).

If you need non-repeated numbers (since security seems to be a concern for you, note that this is less secure than a sequence of (pseudo) random numbers in which you allow repeated numbers!!!), you can do as follows:

class NonRepeatedPRNG {

private final Random rnd = new Random();

private final Set set = new HashSet<>();

public int nextInt() {

for (;;) {

final int r = rnd.nextInt();

if (set.add(r)) return r;

}

}

}

Note that the nextInt method defined above may never return! Use with caution.

2) No, there's no such thing as an "algorithm for true random number generation", since an algorithm is something known, that you control and can predict (ie, just run it and you have the output; you know exactly its output the next time you run it with the same initial conditions), while a true RNG is completely unpredictable by definition.

For most common non security-related applications (ie, scientific calculations, games, etc), a PRNG will suffice. If security is a concern (ie, you want random numbers for crypto), then a CSPRNG (cryptographycally secure PRNG) will suffice.

If you have an application that cannot work without true randomness, I'm really curious to know more about it.