building a true RNG

[Paul Crowley]

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 at paul.ciphergoth.org
/\__/ http://www.ciphergoth.org/

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at wasabisystems.com