Further investigations with the strong probable prime test

DOI10.1090/S0025-5718-96-00695-3zbMath0852.11071OpenAlexW2110780349MaRDI QIDQ4878557

Ronald Joseph Jun. Burthe

Publication date: 5 December 1996

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-96-00695-3

zbMATH Keywords

compositestrong pseudoprimeRabin primality test

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Related Items (3)

Improved error bounds for the Fermat primality test on random inputs ⋮ Algorithms for the Multiplication Table Problem ⋮ The Miller–Rabin test with randomized exponents

Cites Work

• Unnamed Item
• The generation of random numbers that are probably prime
• Probabilistic algorithm for testing primality
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Average Case Error Estimates for the Strong Probable Prime Test

This page was built for publication: Further investigations with the strong probable prime test