Average Case Error Estimates for the Strong Probable Prime Test
From MaRDI portal
Publication:3137458
DOI10.2307/2152945zbMath0788.11059WikidataQ27940868 ScholiaQ27940868MaRDI QIDQ3137458
Peter Landrock, Ivan B. DamgÄrd, Carl B. Pomerance
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
Related Items
Density of Carmichael numbers with three prime factors, Finding strong pseudoprimes to several bases. II, Finding đ¶â-strong pseudoprimes, Further investigations with the strong probable prime test, 64-bit and 128-bit DX random number generators, On the effectiveness of a generalization of Miller's primality theorem, Prime-number algorithm for public-key systems, Fast generation of prime numbers and secure public-key cryptographic parameters., Two contradictory conjectures concerning Carmichael numbers, Efficient, Robust and Constant-Round Distributed RSA Key Generation, The MillerâRabin test with randomized exponents, Two kinds of strong pseudoprimes up to $10^{36}$