Re: 42nd Known Mersenne Prime Found == 2^25,964,951-1 == The number has 7,816,230 digits

From: David Wagner (daw_at_taverner.cs.berkeley.edu)
Date: 02/28/05 

Date: Mon, 28 Feb 2005 20:10:34 +0000 (UTC)

John Savard wrote:
>Mersenne primes are also useful in the Mersenne Twister, a PRNG,

The Mersenne Twister has nothing to do with cryptography (other
than that it is an example of something that is not cryptographically
strong), and the Mersenne primes found have no practical relevance for
the Mersenne Twister PRNG...

Relevant Pages

  • RE: Secure random ID generation
    ... the seeding is done in a separate section of code... ... Subject: Secure random ID generation ... Your PRNG ("Mersenne twister") is not cryptographically ...
    (SecProg)
  • Re: No random numbers in r6rs.
    ... Without trying to anything away from Mersenne Twister, srfi-27 is also ... a sophisticated PRNG; it's algorithm MRG32k3a, ...
    (comp.lang.scheme)
  • Re: pseudo random thoughts
    ... >>analysis from experts in PRNG techniques. ... for most non-cryptographic applications is probably the Mersenne Twister ... Googling on "Mersenne Twister random" brings up umpteen alleged ...
    (comp.theory)
Quantcast