John Pollard (mathematician)
ID: john-pollard-mathematician
John Pollard is a mathematician whose work in number theory includes Pollard's rho algorithm and Pollard's p-1 algorithm for integer factorization. His retrospective explains how collision ideas related to the birthday paradox lead to the rho method, and distinguishes its factorization and discrete logarithm applications.[ref]
https://sites.google.com/site/jmptidcott2/50-years-of-the-rho-method. Author's retrospective, 50 Years of the rho method
Homepage: sites.google.com/site/jmptidcott2/
John Pollard is a notable mathematician, particularly recognized for his contributions to number theory and computational mathematics. He is best known for the Pollard rho algorithm, an efficient method for integer factorization. This algorithm is widely used in cryptography for breaking down large numbers into their prime factors, which is a foundational aspect of many encryption systems. In addition to his work in factorization, Pollard has made contributions in various areas of mathematics, including algorithm design and computational complexity.
New to topics? Read the docs here!