[11252] in cryptography@c2.net mail archive

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

Re: building a true RNG

daemon@ATHENA.MIT.EDU (Greg Rose)
Tue Jul 30 08:53:22 2002

Date: Tue, 30 Jul 2002 10:39:48 +1000
To: David Wagner <daw@cs.berkeley.edu>
From: Greg Rose <ggr@qualcomm.com>
Cc: gnu@toad.com (John Gilmore), daw@cs.berkeley.edu (David Wagner),
	cryptography@wasabisystems.com
In-Reply-To: <200207292218.g6TMIAw02664@mozart.cs.berkeley.edu>

At 03:18 PM 7/29/2002 -0700, David Wagner wrote:
> > I don't even think anyone has analyzed the entropy preservation of a >
>theoretically perfect "random oracle"
>
>Well, I know this particular point wasn't central to your email, but
>I'm not sure I agree with you on this small point.  I believe it should
>be more or less straightforward to analyze the entropy preservation of
>a random oracle (alas, so straightforward you probably won't find any
>paper on it in the literature).

Actually, it's covered very well (but briefly) in HAC (in section 2.1.6) 
and they refer to a seminal work by Flajolet and Odlyzko (Google finds 
references to it quite easily).

regards,
Greg.



Greg Rose                                       INTERNET: ggr@qualcomm.com
Qualcomm Australia          VOICE:  +61-2-9817 4188   FAX: +61-2-9817 5199
Level 3, 230 Victoria Road,                http://people.qualcomm.com/ggr/
Gladesville NSW 2111    232B EC8F 44C6 C853 D68F  E107 E6BF CD2F 1081 A37C


---------------------------------------------------------------------
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