Paul Leyland

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Paul Leyland is a British number theorist who has studied integer factorization and primality testing.

He has contributed to the factorization of RSA-129, RSA-140, and RSA-155, as well as potential factorial primes as large as 400! + 1. He has also studied Cunningham numbers, Cullen numbers, Woodall numbers, etc., and numbers of the form , which are now called Leyland numbers.[1] He was involved with the NFSNet project to use distributed computing on the Internet from 2005 to 2008.[2]

References[edit]

  1. ^ Richard Crandall and Carl Pomerance (2005), Prime Numbers: A Computational Perspective, Springer
  2. ^ "About NFSNET". Archived from the original on 9 May 2008. Retrieved 9 August 2011.

External links[edit]