1994-04-14 - rng, anyone?

Header Data

From: hughes@ah.com (Eric Hughes)
To: cat@soda.berkeley.edu
Message Hash: 3372bb70b76dd439a3164f05cca6f15c7c89d54aedbd47decf9796da80051c72
Message ID: <9404141639.AA24917@ah.com>
Reply To: <199404141136.EAA10090@soda.berkeley.edu>
UTC Datetime: 1994-04-14 16:48:42 UTC
Raw Date: Thu, 14 Apr 94 09:48:42 PDT

Raw message

From: hughes@ah.com (Eric Hughes)
Date: Thu, 14 Apr 94 09:48:42 PDT
To: cat@soda.berkeley.edu
Subject: rng, anyone?
In-Reply-To: <199404141136.EAA10090@soda.berkeley.edu>
Message-ID: <9404141639.AA24917@ah.com>
MIME-Version: 1.0
Content-Type: text/plain


>i'm doing some stuff on this remailer which requires a good rng.
>perl's rng just calls c's rng, which totally sucks.  does
>anyone know of a cryptographically sound rng i can use?  

If you don't need high-bandwidth randomness, there are several good
PRNG, but none of them run fast.  See the chapter on PRNG's in
"Cryptology and Computational Number Theory".  

You, Erich von Hollander, should just go talk to Manuel Blum, who's on
the faculty at Cal.  He's the second Blum of the Blum-Blum-Shub
generator.

Eric





Thread