[11287] in cryptography@c2.net mail archive
Re: building a true RNG
daemon@ATHENA.MIT.EDU (Paul Crowley)
Fri Aug 2 14:15:53 2002
To: "John S. Denker" <jsd@monmouth.com>
Cc: David Wagner <daw@cs.berkeley.edu>,
cryptography@wasabisystems.com, Barney Wolff <barney@tp.databus.com>
From: Paul Crowley <paul@ciphergoth.org>
Date: 02 Aug 2002 13:07:47 +0100
In-Reply-To: Paul Crowley's message of "02 Aug 2002 12:51:34 +0100"
I meant to say, another example of a believed one-way function that is
guaranteed to be able to produce any output is one based on the
difficulty of discrete log:
f:(x) = g^x mod p
is bijective if the domain and range is 1..p-1, but finding preimages
is the discrete log problem. Of course this doesn't compress. I
don't know of any examples which compress and have collision resistance.
--
__ Paul Crowley
\/ o\ sig@paul.ciphergoth.org
/\__/ http://www.ciphergoth.org/
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
