[148705] in cryptography@c2.net mail archive

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

Re: [Cryptography] how reliably do audits spot backdoors?

daemon@ATHENA.MIT.EDU (James A. Donald)
Wed Dec 25 14:55:37 2013

X-Original-To: cryptography@metzdowd.com
Date: Wed, 25 Dec 2013 17:57:18 +1000
From: "James A. Donald" <jamesd@echeque.com>
To: Benjamin Kreuter <brk7bx@virginia.edu>
In-Reply-To: <20131224204814.15bc25ff@terabyte>
Cc: cryptography@metzdowd.com
Reply-To: jamesd@echeque.com
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com

>>> So the fact that it is possible for the sum of two positive
>>> integers to be a negative number is idiomatic?

 > "James A. Donald" <jamesd@echeque.com> wrote:
>> To me that is totally intuitive and natural,

On 2013-12-25 11:48, Benjamin Kreuter wrote:
> 1. You just referred to *undefined behavior* as "intuitive."

That the sum of two positive numbers is a negative number is defined 
behavior, word length being defined.

>> You get the higher level language problem that the libraries are
>> slightly different on each machine, which results in nightmare
>> installations.

> Are you claiming that the situation is worse than it is in C?

Observe, that pretty much every program written in C simply installs, 
and pretty much every program written in python simply does not.
_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography

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