[18983] in cryptography@c2.net mail archive
Re: "ISAKMP" flaws?
daemon@ATHENA.MIT.EDU (Steven M. Bellovin)
Fri Nov 18 15:33:58 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
From: "Steven M. Bellovin" <smb@cs.columbia.edu>
To: Paul Hoffman <paul.hoffman@vpnc.org>
Cc: cryptography@metzdowd.com
In-Reply-To: Your message of "Thu, 17 Nov 2005 09:01:22 PST."
<p062309a8bfa266327e1b@[10.20.30.249]>
Date: Fri, 18 Nov 2005 10:18:09 -0500
In message <p062309a8bfa266327e1b@[10.20.30.249]>, Paul Hoffman writes:
>At 11:20 AM +0100 11/17/05, Florian Weimer wrote:
>>These bugs have been uncovered by a PROTOS-style test suite. Such
>>test suites can only reveal missing checks for boundary conditions,
>>leading to out-of-bounds array accesses and things like that. In
>>other words, trivial implementation errors which can be easily avoided
>>using proper programming tools.
>
>Which "proper programming tools" would check for a logic path failure
>when a crafted packet includes Subpacket A that is only supposed to
>be there when Subpacket B is there, but the packet doesn't include
>Subpacket B? There are no programming tools that check for this, or
>for related issues: it has to be the implementer who has enough
>understanding of the protocol and enough time (and program space) to
>code against such issues.
Decent test case generators.
--Steven M. Bellovin, http://www.cs.columbia.edu/~smb
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
