The first primality tests using randomized algorithms (based on refinements to Fermat’s little theorem) ushered in a new era. Problem after problem turned out to be far easier to solve with randomness ...

The graph below shows the total number of publications each year in Algorithms for Polynomial Computation Over Finite Fields. References [1] Fast multivariate multi-point evaluation revisited .