[52059] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: handling weak keys using random selection and CSPRNGs

daemon@ATHENA.MIT.EDU (Steven M. Bellovin)
Thu Oct 12 09:42:39 2006

X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Tue, 10 Oct 2006 11:38:56 -0400
From: "Steven M. Bellovin" <smb@cs.columbia.edu>
To: "Travis H." <solinym@gmail.com>
Cc: Cryptography <cryptography@metzdowd.com>
In-Reply-To: <d4f1333a0610092336q520bebc3g8fa5a8d791bdd228@mail.gmail.com>

Given how rare weak keys are in modern ciphers, I assert that code to cope
with them occurring by chance will never be adequately tested, and will be
more likely to have security bugs.  In short, why bother?

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

home help back first fref pref prev next nref lref last post