|
From: | Paul Eggert |
Subject: | Re: checking against signed integer overflow |
Date: | Sun, 6 Dec 2020 10:35:15 -0800 |
User-agent: | Mozilla/5.0 (X11; Linux x86_64; rv:78.0) Gecko/20100101 Thunderbird/78.5.0 |
On 12/5/20 7:36 PM, Bruno Haible wrote:
Small world. I worked with the late Peter Montgomery circa 1980; he was down the hall from me at System Development Corporation in Santa Monica, and was developing what led to Montgomery multiplication, though due to security regulations I never really knew what he was up to at the time. He was such a nice guy, with a great attitude, and was a pleasure to be around.(*) The function did a Montgomery multiplication mod p, where p > 2^128; this is the workhorse of the arithmetic on an elliptic curve.
Peter was famous for his mastery of the CDC 7600, the fastest computer in the world in the early 1970s. If you wanted fast math code, he was *the guy*. And the CDC 7600 used 60-bit ones'-complement integer arithmetic, so this email isn't *entirely* a digression.
[Prev in Thread] | Current Thread | [Next in Thread] |