Article View: sci.crypt
Article #1995Re: URNG
From: Bruce Schneier
Date: Fri, 20 Nov 1992 22:10
Date: Fri, 20 Nov 1992 22:10
12 lines
949 bytes
949 bytes
In article <books.124.0@fsunuc.physics.fsu.edu> books@fsunuc.physics.fsu.edu (Roger Books) writes: >I've seen a lot of discussion here about Unpredictable Random Number >Generators as apposed to statistically reliable random number generators >and I am interested in seeing a URNG. Could someone post (or e-mail) >a formula/code/algorithm/description of an Unpredictable RNG? I'm not >asking for all of the above, one would be all I need. > The Blum-Blum-Shub generator is discussed in Gilles Brassard's _Modern_ Cryptology_, published by Springer-Verlag. Bruce
Technical Details
Message-ID:
<By1C9x.3K1@chinet.chi.il.us>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!uwm.edu!linac!uchinews!machine!chinet!schneierReferences:
<books.124.0@fsunuc.physics.fsu.edu>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!uwm.edu!linac!uchinews!machine!chinet!schneier From: schneier@chinet.chi.il.us (Bruce Schneier) Subject: Re: URNG Message-ID: <By1C9x.3K1@chinet.chi.il.us> Organization: Chinet - Public Access UNIX References: <books.124.0@fsunuc.physics.fsu.edu> Date: Fri, 20 Nov 1992 22:10:44 GMT Lines: 13