Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

5
  • Here you can find diehard test programs and source code for different operating systems. Another nice link could be this one. Commented Apr 22, 2009 at 19:18
  • 3
    Usually you shouldn't roll your own RNGs, though, as they are very hard to get right. Even tests might not alert you to failure since they each test only a very specific case. We have implemented most of NIST 800-22 for a modelling and simulations package and those tests are for crypto applications—yet, even bad generators as a simple LCG pass all tests (although RANDU fails some, which is at least a small victory). Commented Apr 22, 2009 at 19:25
  • this is a kind of little thesis( if it can be named thesis) in physics, where a unimodal map (logistic map) is used in a caotic regime, to generate random nr between 0 and 1. i have wrriten my own rng, and now i should test it and then do the conlusions: can unimodal map used as rng, what is the algotithm that use the other standart prng, etc. so, this is my first step: test my own rng. Commented Apr 22, 2009 at 19:37
  • 5
    Ah, ok. Well, then go with whatever you can find. NIST, DieHard, DieHarder, TestU01, ent are the ones that spring to my mind at the monent. usage is usually documented and most should be able to cope with files containing random bytes or numbers. Commented Apr 22, 2009 at 19:52
  • Numerical Recipes 3rd Edition: The Art of Scientific Computing by William H. Press has a complete chapter devoted to random number generators, which is quite interesting if you want to understand why their quality is an issue. Commented Aug 14, 2015 at 9:20