passphrases with more than 160 bits of entropy

[Taral]

On 3/21/06, Travis H. <solinym at 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 at gmail.com>
"You can't prove anything."
    -- Gödel's Incompetence Theorem

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