[21486] in cryptography@c2.net mail archive
Re: passphrases with more than 160 bits of entropy
daemon@ATHENA.MIT.EDU (Taral)
Wed Mar 22 08:37:04 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Tue, 21 Mar 2006 22:34:29 -0600
From: Taral <taralx@gmail.com>
To: "Travis H." <solinym@gmail.com>
Cc: cryptography@metzdowd.com
In-Reply-To: <d4f1333a0603211244m71a124b6pe072154d7b731d53@mail.gmail.com>
On 3/21/06, Travis H. <solinym@gmail.com> wrote:
> Does anyone have a good idea on how to OWF passphrases without
> reducing them to lower entropy counts?
I've frequently seen constructs of this type:
H(P), H(0 || P), H(0 || 0 || P), ...
If entropy(P) > entropy(H), the entries will be independent, theoretically.
--
Taral <taralx@gmail.com>
"You can't prove anything."
-- G=F6del's Incompetence Theorem
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
