Tests for primality under the Riemann hypothesis
ACM SIGACT News
Riemann hypothesis and finding roots over finite fields
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
ACM Transactions on Computer Systems (TOCS)
Models of Computation, Riemann Hypothesis, and Classical Mathematics
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Several results in theoretical computer science use the following theorem: For a positive integer q, let Z-&-bull;q denote the multiplicative group of all integers x, 0-&-lt;x-&-lt;q, that are relatively prime to q. Let G be a proper subgroup of Z-&-bull;q. Then, assuming the Extended Riemann Hypothesis, there is a constant C such that if q is sufficiently large, Z-&-bull;q-&-minus;G contains a positive integer N-&-le;C (logeq)2. We show that for q-&-ge;106, one may take C-&-equil;60. As an application, we discuss a deterministic polynomial-time primality test. Miller proved that such algorithms must exist if the ERH is true, but we are unable to specify one without the concrete information given above. We eliminate this difficulty, and show how to implement a fast primality test.