Jump to content

Eric Bach

From Wikipedia, the free encyclopedia
Eric Bach
Alma materUniversity of California - Berkeley
University of Michigan
Scientific career
FieldsComputer Science
InstitutionsUniversity of Wisconsin - Madison
Doctoral advisorManuel Blum
Doctoral studentsJohn Watrous
Victor Shoup

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.

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. Bach also did some of the first work on pinning down the actual expected run-time of the Pollard rho method where previous work relied on heuristic estimates and empirical data.[3] He is the namesake of Bach's algorithm for generating random factored numbers.


  1. ^ "Eric Bach". ACM SIGACT Theoretical Computer Science genealogy database. Archived from the original on November 27, 2005. Retrieved 2008-06-04.
  2. ^ Bach, Eric (1990), "Explicit bounds for primality testing and related problems", Mathematics of Computation, 55 (191): 355–380, doi:10.2307/2008811, JSTOR 2008811
  3. ^ Bach, Eric (1991). "Toward a theory of Pollard's rho method" (PDF). Information and Computation. 90 (2): 139–155. doi:10.1016/0890-5401(91)90001-i. Retrieved March 4, 2015.