| Autor: |
Berrizbeitia, Pedro, Berry, T.G. |
| Zdroj: |
Journal of Symbolic Computation; August 2000, Vol. 30 Issue: 2 p151-160, 10p |
| Abstrakt: |
We describe probabilistic primality tests applicable to integers whose prime factors are all congruent to 1 mod rwhere ris a positive integer;r=2 is the Miller–Rabin test. We show that if νrounds of our test do not find n≠=(r+1)2composite, then nis prime with probability of error less than (2 r)−ν. Applications are given, first to provide a probabilistic primality test applicable to all integers, and second, to give a test for values of cyclotomic polynomials. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
Full Text from ScienceDirect