[11195] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: building a true RNG (was: Quantum Computing ...)

daemon@ATHENA.MIT.EDU (John S. Denker)
Tue Jul 23 14:10:26 2002

Date: Tue, 23 Jul 2002 10:03:40 -0400
From: "John S. Denker" <jsd@monmouth.com>
To: Derek Atkins <derek@ihtfp.com>
Cc: David Honig <dahonig@cox.net>, amir@herzberg.name,
	"'Hannes R. Boehm'" <hannes@boehm.org>,
	'Ian Hill' <Ian@Protonic.com>, cryptography@wasabisystems.com

Derek Atkins wrote:
> 
> > OK, we have DES as an example of a whitener.
> > -- Can somebody give me an example of a "simple hash"
> > that performs "irreversible compression" of the required
> > kind?
> 
> I can give you a number of examples:  MD5, SHA-1, ....

Sorry, no, that doesn't answer the question.  
 -- I already use SHA-1.
 -- It is considered a strong cryptologic hash that doesn't
    need whitening.
 -- I am told (but don't understand) that there might exist
    a weaker hash that somehow does require whitening.  This
    is the point of the conversation.  Please address this
    point if you can.

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

home help back first fref pref prev next nref lref last post