[136279] in cryptography@c2.net mail archive

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

Re: combining entropy

daemon@ATHENA.MIT.EDU (John Denker)
Mon Oct 27 16:51:49 2008

Date: Sat, 25 Oct 2008 13:53:55 -0700
From: John Denker <jsd@av8n.com>
To: IanG <iang@systemics.com>, Cryptography <cryptography@metzdowd.com>
In-Reply-To: <490305A0.8050104@systemics.com>

Alas on 10/25/2008 01:40 PM, I wrote:


> To summarize:  In the special sub-case where M=1, XOR
> is as good as it gets.  In all other cases I can think
> of, the hash approach is much better.

I should have said that in the special sub-case where 
the member word has entropy density XX=100% _or_ in 
the special sub-case where M=1, XOR is as good as it
gets.  In all other cases I can think of, the hash 
approach is much better.

(I excluded the XX=100% case earlier in the note, but
I should have included it in the summary.  Sorry.)

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

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