Average Case Error Estimates for the Strong Probable Prime Test

DOI10.2307/2152945zbMath0788.11059OpenAlexW4245845282WikidataQ27940868 ScholiaQ27940868MaRDI QIDQ3137458

Peter Landrock, Carl B. Pomerance, Ivan B. Damgård

Publication date: 9 November 1993

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

Full work available at URL: https://doi.org/10.2307/2152945

zbMATH Keywords

numerical upper boundsstrong probable prime

Mathematics Subject Classification ID

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

Related Items (16)

Finding Carmichael numbers ⋮ Improved error bounds for the Fermat primality test on random inputs ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Further investigations with the strong probable prime test ⋮ Density of Carmichael numbers with three prime factors ⋮ The Miller–Rabin test with randomized exponents ⋮ Finding 𝐶₃-strong pseudoprimes ⋮ On the effectiveness of a generalization of Miller's primality theorem ⋮ Two kinds of strong pseudoprimes up to $10^{36}$ ⋮ Two contradictory conjectures concerning Carmichael numbers ⋮ Finding strong pseudoprimes to several bases. II ⋮ 64-bit and 128-bit DX random number generators ⋮ Large-Order Multiple Recursive Generators with Modulus 2³¹ − 1 ⋮ Prime-number algorithm for public-key systems ⋮ Efficient, Robust and Constant-Round Distributed RSA Key Generation ⋮ Counting composites with two strong liars

This page was built for publication: Average Case Error Estimates for the Strong Probable Prime Test