[21493] in cryptography@c2.net mail archive
Re: passphrases with more than 160 bits of entropy
daemon@ATHENA.MIT.EDU (Aram Perez)
Wed Mar 22 11:55:50 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
In-Reply-To: <442142F6.80505@connotech.com>
From: Aram Perez <aramperez@mac.com>
Date: Wed, 22 Mar 2006 08:03:46 -0800
To: Cryptography <cryptography@metzdowd.com>
On Mar 22, 2006, at 4:28 AM, Thierry Moreau wrote:
> Travis H. wrote:
>> Hi,
>> Does anyone have a good idea on how to OWF passphrases without
>> reducing them to lower entropy counts? That is, I've seen systems
>> which hash the passphrase then use a PRF to expand the result --- I
>> don't want to do that. I want to have more than 160 bits of entropy
>> involved.
>
> More than 160 bits is a wide-ranging requirement.
>
> Entropy is a highly discussed unit of measure.
And very often confused. While you do want maximum entropy, maximum
entropy is not sufficient. The sequence of the consecutive numbers 0
- 255 have maximum entropy but have no randomness (although there is
finite probability that a RNG will produce the sequence).
Regards,
Aram Perez
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
