Re: How to test a pseudo random prime number generator?
- From: Phil Carmody <thefatphil_demunged@xxxxxxxxxxx>
- Date: 04 Sep 2007 13:47:24 +0300
rich burge <r3769@xxxxxxx> writes:
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))
This favours primes of the form 6n-1. (As 6n-3 can never be prime.)
(Asymptotically, it doesn't, but you're not talking asymptotically.)
Phil
--
Dear aunt, let's set so double the killer delete select all.
-- Microsoft voice recognition live demonstration
.
- Prev by Date: Re: JSH: What is surrogate factoring? Once more.
- Next by Date: show that function is differentiable function
- Previous by thread: Re: JSH: What is surrogate factoring? Once more.
- Next by thread: Re: How to test a pseudo random prime number generator?
- Index(es):
Relevant Pages
|
