John M. Pollard
John Michael Pollard (born October 25, 1941 near London ) is a British mathematician who developed algorithms for factoring large numbers and for calculating discrete logarithms .
John M. Pollard graduated from Cambridge University with BA (1963), MA (1965) and Ph.D. (1978). From 1968 to 1986 he was employed by British Telecom .
His algorithms include the Pollard-Rho method , the Pollard p-1 method and the original version of the special number field sieve , which was then further developed by others.
He also introduced the discrete Fourier transform over a finite body in 1971 , using the 1965 Cooley-Tukey fast algorithm .
In 1999 he won the RSA Award alongside John Gilmore and Compaq Computer's Atalla Division .
Web link
Individual evidence
- ^ A b Richard A. Mollin: RSA and public-key cryptography. CRC, Hoboken 2002, ISBN 1-420-03524-X , p. 108, footnote 5.15 ( limited preview in Google book search)
| personal data | |
|---|---|
| SURNAME | Pollard, John M. |
| ALTERNATIVE NAMES | Pollard, John Michael |
| BRIEF DESCRIPTION | British mathematician |
| DATE OF BIRTH | October 25, 1941 |
| PLACE OF BIRTH | near London |