Primality testing with fewer random bits (1993) [1 citations — 0 self]
Download:
|
|
by Ren E Peralta, Victor Shoup
Computational Complexity
http://www.cs.uwm.edu/faculty/peralta/papers/primality.ps
Add To MetaCart
Abstract:
Abstract. In the usual formulations of the Miller-Rabin and SolovayStrassen primality testing algorithms for a number n, the algorithm chooses "candidates " x 1; x 2; : : : ; x k uniformly and independently at random from Z n, and tests if any is a "witness " to the compositeness of n. For either algorithm, the probability that it errs is at most 2
Citations
| 413 | An introduction to the Theory of Numbers – Hardy, Wright - 1980 |
| 318 | Finite Fields – Lidl, Niederreiter |
| 167 | How to recycle random bits – Impagliazzo, Zuckerman - 1989 |
| 124 | Probabilistic algorithm for testing primality – Rabin - 1980 |
| 82 | Dispersers, deterministic amplification, and weak random sources – Cohen, Wigderson - 1989 |
| 18 | Randomized algorithms and pseudorandom numbers – Karloff, Raghavan - 1993 |
| 1 | Factoring polynomials with fewer random bits – Sci - 1991 |
