| Peter L. Montgomery | |
| Birth Date: | September 25, 1947 |
| Birth Place: | San Francisco, California, U.S. |
| Death Place: | Pong, Phayao, Thailand |
| Nationality: | American |
| Fields: | Mathematics |
| Workplaces: | |
| Alma Mater: | |
| Thesis Title: | An FFT extension of the elliptic curve method of factorization |
| Thesis Url: | https://cr.yp.to/bib/1992/montgomery.pdf |
| Thesis Year: | 1992 |
| Doctoral Advisor: | David G. Cantor |
| Known For: | |
Peter Lawrence Montgomery (September 25, 1947 – February 18, 2020) was an American mathematician who worked at the System Development Corporation and Microsoft Research. He is best known for his contributions to computational number theory and mathematical aspects of cryptography, including the Montgomery multiplication method for arithmetic in finite fields, the use of Montgomery curves in applications of elliptic curves to integer factorization and other problems, and the Montgomery ladder, which is used to protect against side-channel attacks in elliptic curve cryptography.
Montgomery began his undergraduate career at the University of California, Riverside, in 1965 and transferred to Berkeley in 1967, earning a BA in mathematics in 1969 and an MA in mathematics in 1971, He joined the System Development Corporation (SDC) in 1972, where he worked for many years as a programmer implementing algorithms for the CDC 7600 and PDP series of computers, including the implementation of algorithms for multi-precision arithmetic that led to the invention of what is now known as Montgomery multiplication. He then returned to academia in 1987, earning his PhD in mathematics from UCLA in 1992 under the supervision of David Cantor. He joined the cryptography group at Microsoft Research in 1998, where he worked until his retirement in 2014.
On February 28, 2020, an 829-bit (RSA-250) RSA key was successfully factorised. The team dedicated the computation to Peter Montgomery, who died on the 18th of the same month.[1]
Montgomery is particularly known for his contributions to the elliptic curve method of factorization, which include a method for speeding up the second stage of algebraic-group factorization algorithms using FFT techniques for fast polynomial evaluation at equally spaced points. This was the subject of his dissertation, for which he received his Ph.D. in 1992 from the University of California, Los Angeles.
He also invented the block Lanczos algorithm for finding nullspace of a matrix over a finite field, which is very widely used for the quadratic sieve and number field sieve methods of factorization; he has been involved in the computations which set a number of integer factorization records.
He was a Putnam Fellow in 1967.[2] In that year, he was one of only two contestants, along with child prodigy Don Zagier of MIT, to solve all twelve of the exam problems.