On 3/21/06, Travis H. <[EMAIL PROTECTED]> 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 <[EMAIL PROTECTED]>
"You can't prove anything."
    -- Gödel's Incompetence Theorem

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]

Reply via email to