Eric Bach
Template:Short description Template:For Template:Infobox scientist
Eric Bach is an American computer scientist who has made contributions to computational number theory.
Bach completed his undergraduate studies at the University of Michigan, Ann Arbor, and got his Ph.D. in computer science from the University of California, Berkeley, in 1984 under the supervision of Manuel Blum.[1] He is currently a professor at the Computer Science Department, University of Wisconsin–Madison.
Research
Among other work, he gave explicit bounds for the Chebotarev density theorem, which imply that if one assumes the generalized Riemann hypothesis then is generated by its elements smaller than 2(log n)2.[2] This result shows that the generalized Riemann hypothesis implies tight bounds for the necessary run-time of the deterministic version of the Miller–Rabin primality test.
In 1991, Bach proved that if you start Pollard's rho algorithm with random values x and y and iterate k times, the probability that it successfully discovers a prime factor p is at least .[3] As a result, he also proved that the probability of success obeys the lower bound .[3]
He is the namesake of Bach's algorithm for generating random factored numbers.Template:Citation needed