arXiv · 1204.1657
A faster pseudo-primality test
Abstract
We propose a pseudo-primality test using cyclic extensions of $\mathbb Z/n \mathbb Z$. For every positive integer $k \leq \log n$, this test achieves the security of $k$ Miller-Rabin tests at the cost of $k^{1/2+o(1)}$ Miller-Rabin tests.
Explore related subjects
Keep this discovery
Jean-Marc Couveignes, Tony Ezome, Reynald Lercier. 2012-04-07. A faster pseudo-primality test. https://doi.org/10.1112/s1461157015000169
Cite the original work for its findings. Save a collection to share your selection of sources.