What is the most random function in C++? [closed]

问题:

I've used

#include<stdlib>
#include<time>
using namespace std;
srand((unsigned)time(0));
int n=(rand()>>8)%4;

but what other random functions are there, or what other function could be used as random number generators?

EDIT: I don't really have a particular reason for asking this question, I just wanted to know if C++ had any other random functions.

回答1:

• Boost Random Number Library offers a broad range of generators (quality vs performance) and some typical random distributions. Everything rather nice and straightforward to use.
• If you want some other methods/libraries - then google for cryptographic random numbers, also you can use this document as a reference.
• Don't invent your own solutions unless you are an expert/researcher in the field/etc, take advantage of already existing solutions which were usually written by Smart People, and thoroughly examined by other Smart People.

回答2:

The rand() and srand() functions are all the C++ Standard specifies. And if it comes to writing your own, be aware of what John von Neumann said:

"Anyone who considers arithmetical methods of producing random digits is of course in a state of sin"

回答3:

This code is pretty efficient. Although users may begin to notice a pattern after a few iterations.

int FastRandom()
{
  return 10;
}

回答4:

Not strictly C++, but Windows specific:

CryptGenRandom

I'm sure all operating systems have their equivalent cryptographically secure random generator functions.

回答5:

int unixrand()
{
   int x;
   int f = open("/dev/random", O_RDONLY);
   if (f < 0) return -1; /* Error */
   if (sizeof(x) != read(f, &x, sizeof(x))) {
       close(f);
       return -1;
   }
   close(f);       
   if (x < 0) x = ~x;
   return x;
}

回答6:

(Cross-posting from an answer I just wrote to a similar question)

Have a look at ISAAC (Indirection, Shift, Accumulate, Add, and Count). Its uniformly distributed and has an average cycle length of 2^8295.

It's fast too, since it doesnt involve multiplication or modulus.

回答7:

Bruce Schneier and John Kelsey wrote a random number generator you may be interested in. Rather, it's a seed generator. Even though Yarrow is no longer supported, you may be interested in how it gathers entropy.

OpenSSL has an API that is relatively easy to access and pretty portable. And Mozilla comes with a decent API that wraps whatever the OS offers.

Personally, though, I generally use Boost.Random, which was already suggested.

回答8:

Random gives you a good random number at uniform distribution and does a pretty good job at that.

Anything else would mean that you want to actually skew the distribution.

For example, using Microsoft's GUIDs generator would give you a random id that is less likely to be repeated and takes into account things like time and computer.

回答9:

Time is usually the most random operation that is also cheap to perform, but it's still possible to predict.

If you want true randomness, using some kind of external input is your only solution.

Quantum Random Bit Generator is one service that provides such data.