Towards a deterministic polynomial-time
โ Kayal N., Saxena N.
๐ Library
๐
2002
๐ English
We examine a primality testing algorithm presented in Primality and Identity Testing via Chinese Remaindering: FOCS 1999 and the related conjecture in Prashant and Rajat: BTP-report 2001. We show that this test is stronger than some of the most popular tests: the Fermat test, the Solovay Strassen t