Re: How to test a pseudo random prime number generator?
- From: rich burge <r3769@xxxxxxx>
- Date: Sun, 19 Aug 2007 12:15:08 -0700
On Aug 19, 11:36?am, quasi <qu...@xxxxxxxx> wrote:
On Sun, 19 Aug 2007 11:29:04 -0700, rich burge <r3...@xxxxxxx> wrote:
There a a variety of techniques for testing the quality of random
number generators (DIEHARD, NIST, Knuth, ect.). How can I test the
quality of a "random prime number generator"?
First, you have to define what you mean by a random prime.
This part of my problem, I am not sure what I mean by a "random
prime".
But suppose we define
random_prime(x):=nextprime(random(x))
[Here random(x) is a random number between 0 and x-1 and nextprime(x)
is the first prime larger than x.] If the underlying x's are all
small, no problem. But what if the x's are large?
Rich
.
- Follow-Ups:
- References:
- How to test a pseudo random prime number generator?
- From: rich burge
- Re: How to test a pseudo random prime number generator?
- From: quasi
- How to test a pseudo random prime number generator?
- Prev by Date: May be a short history of JSH? No offense.
- Next by Date: Cheats !!!!
- Previous by thread: Re: How to test a pseudo random prime number generator?
- Next by thread: Re: How to test a pseudo random prime number generator?
- Index(es):
Relevant Pages
|
Loading