[40333] in cryptography@c2.net mail archive
Re: CRCs and passphrase hashing
daemon@ATHENA.MIT.EDU (Leichter, Jerry)
Sun Sep 3 23:42:37 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Wed, 30 Aug 2006 10:30:42 -0400 (EDT)
From: "Leichter, Jerry" <leichter_jerrold@emc.com>
To: "Travis H." <solinym@gmail.com>
Cc: Cryptography <cryptography@metzdowd.com>
In-Reply-To: <d4f1333a0608251812j7688a1faqfd8cdf0e953e2f8d@mail.gmail.com>
Look up the paper "Fingerprinting by random polynomials" by Michael Rabin.
-- Jerry
On Fri, 25 Aug 2006, Travis H. wrote:
| Date: Fri, 25 Aug 2006 20:12:30 -0500
| From: Travis H. <solinym@gmail.com>
| To: Cryptography <cryptography@metzdowd.com>
| Subject: CRCs and passphrase hashing
|
| Howdy!
|
| I was talking to Terry Ritter, and he was explaining to me that when
| he needed to make some keys from a user-supplied passphrase, he
| computed various CRCs over the passphrase, and used those as derived
| keys. I'd like to know more about it, and I was wondering if anyone
| knew of any work that addressed the strength of this kind of
| passphrase preprocessing. Forgive me for not being able to hit the
| ground running after reading the explanation from mathworld, as I
| don't have a degree in discrete math.
| --
| "If you're not part of the solution, you're part of the precipitate."
| Unix "guru" for rent or hire -><- http://www.lightconsulting.com/~travis/
| GPG fingerprint: 9D3F 395A DAC5 5CCC 9066 151D 0A6B 4098 0C55 1484
|
| ---------------------------------------------------------------------
| The Cryptography Mailing List
| Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
|
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
