Peter Montgomery (mathematician) is confirmed dead at the age of 72.
Peter was best known as a American mathematician.
RT @nbougalis: Dr. Peter Montgomery—a mathematician whose work on elliptic curves and finite fields shaped an entire field of cryp…
RT @nbougalis: Dr. Peter Montgomery—a mathematician whose work on elliptic curves and finite fields shaped an entire field of cryp…
RT @nbougalis: Dr. Peter Montgomery—a mathematician whose work on elliptic curves and finite fields shaped an entire field of cryp…
Dr. Peter Montgomery—a mathematician whose work on elliptic curves and finite fields shaped an entire field of cryp…
RIP Peter Montgomery (mathematician) @TheTweetOfGod #TragicDeaths 💔💐 #PeterMontgomery(mathematician) add some flow…
Peter Montgomery Has Died
Peter Montgomery Has Died
Peter Montgomery Has Died:
Peter Montgomery Has Died :
Peter Montgomery Has Died
Peter Montgomery Has Died L:
Peter L. Montgomery
Peter Montgomery.jpg
Peter Montgomery in July 2009 at Microsoft Research.
Born(1947-09-25)September 25, 1947
DiedFebruary 18, 2020(2020-02-18) (aged 72) [1]
NationalityAmerican
Alma materUniversity of California, Los Angeles
Scientific career
FieldsMathematics
InstitutionsMicrosoft Research
Doctoral advisorDavid G. Cantor
Peter Lawrence Montgomery (September 25, 1947 - February 18, 2020) was an American mathematician who published widely in the more mathematical end of the field of cryptography. He was a researcher in the cryptography group at Microsoft Research. Montgomery died on February 18th, 2020.
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. 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.
See also
Montgomery curve
Montgomery reduction
About cookies on this site
We use cookies to collect and analyse information on site performance and usage, to provide social media features and to enhance and customise content and advertisements.Learn more
ALLOW ALL COOKIES
COOKIE SETTINGS