Primality and identity testing via Chinese remaindering

@article{Agrawal2003PrimalityAI,
  title={Primality and identity testing via Chinese remaindering},
  author={Manindra Agrawal and Somenath Biswas},
  journal={J. ACM},
  year={2003},
  volume={50},
  pages={429-443}
}
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 Zn 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 Zn for any n. The running time of the algorithms is polynomial in the size of arithmetic circuit representing the input polynomial and the error… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…