[148749] in cryptography@c2.net mail archive
Re: [Cryptography] how reliably do audits spot backdoors?
daemon@ATHENA.MIT.EDU (James Cloos)
Thu Dec 26 15:03:46 2013
X-Original-To: cryptography@metzdowd.com
From: James Cloos <cloos@jhcloos.com>
To: cryptography@metzdowd.com
In-Reply-To: <20131224171224.1195119c@terabyte> (Benjamin Kreuter's message of
"Tue, 24 Dec 2013 17:12:24 -0500")
Date: Thu, 26 Dec 2013 14:45:31 -0500
Cc: Benjamin Kreuter <brk7bx@virginia.edu>, jamesd@echeque.com
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com
>>>>> "BK" == Benjamin Kreuter <brk7bx@virginia.edu> writes:
BK> So the fact that it is possible for the sum of two positive integers
BK> to be a negative number is idiomatic?
It is called modular arithmetic. So not just idiomatic, but expected.
Is there really anyone who has learned to code who doesn't understand
that an N-bit register does math modulus 2^N? Or how twos-complement
math works?
(There may be some these days unfamiliar with ones-complement, but
unfamiliarity with unsigned modular arithmetic and twos-complement
signed modular arithmetic seems to contradict an understanding of
how current computers work. And understanding how a given chip works
seems prerequisite to understanding how to code for it.)
-JimC
--
James Cloos <cloos@jhcloos.com> OpenPGP: 1024D/ED7DAEA6
_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography
