Primality and identity testing via Chinese remaindering
We give a simple and new randomized primality testing algorithm by reducing primality testing for number n to testing if a specific univariate identity over Z(n) holds. We also give new randomized algorithms for testing if a multivariate polynomial, over a finite field or over rationals, is identically zero. The first of these algorithms also works over Z(n) for any n. The running time of the algorithms is polynomial in the size of arithmetic circuit representing the input polynomial and the error parameter. These algorithms use fewer random bits and work for a larger class of polynomials than all the previously known methods, for example, the Schwartz-Zippel test [Schwartz 1980; Zippel 1979], Chen-Kao and Lewin-Vadhan tests [Chen and Kao 1997; Lewin and Vadhan 1998].
primality testing polynomial identity testing