[149273] in cryptography@c2.net mail archive

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

Re: [Cryptography] cheap sources of entropy

daemon@ATHENA.MIT.EDU (Stephan Neuhaus)
Thu Jan 30 02:08:15 2014

X-Original-To: cryptography@metzdowd.com
Date: Thu, 30 Jan 2014 08:07:26 +0100
From: Stephan Neuhaus <stephan.neuhaus@tik.ee.ethz.ch>
To: cryptography@metzdowd.com
In-Reply-To: <52E9F641.5050201@tik.ee.ethz.ch>
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com

On 30.01.2014 07:50, Stephan Neuhaus wrote:
> Taking Dan's original formulation of "N bit streams, at least one of
> which is truly unpredictable", a simple XOR would be enough.

Sorry, they have to be N *independent* streams.  A weaker precondition 
can surely be found, but I'm too lazy now to look for it.

Fun,

Stephan

_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography

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