Average Case Error Estimates for the Strong Probable Prime Test

DOI10.2307/2152945zbMATH Open0788.11059OpenAlexW4245845282WikidataQ27940868 ScholiaQ27940868MaRDI QIDQ3137458FDOQ3137458

Authors: Peter Landrock, Ivan B. Damgård, Carl 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

Recommendations

• Further investigations with the strong probable prime test
• Improved error bounds for the Fermat primality test on random inputs
• The Probability that a Random Probable Prime is Composite
• Primality testing with fewer random bits
• scientific article; zbMATH DE number 721898

zbMATH Keywords

numerical upper boundsstrong probable prime

Mathematics Subject Classification ID

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

Cited In (26)

• Randomized compositeness testing with Chebyshev polynomials
• An extended quadratic Frobenius primality test with average and worst case error estimates.
• Efficient, Robust and Constant-Round Distributed RSA Key Generation
• On the effectiveness of a generalization of Miller's primality theorem
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Title not available (Why is that?)
• 64-bit and 128-bit DX random number generators
• The error probability of the Miller-Rabin primality test
• The Probability that a Random Probable Prime is Composite
• An extended quadratic Frobenius primality test with average- and worst-case error estimate
• Large-order multiple recursive generators with modulus \(2^{31}-1\)
• Experimental results on probable primality
• Average Case Error Estimates of the Strong Lucas Test
• Improved error bounds for the Fermat primality test on random inputs
• Progress towards a conjecture of S. W. Graham
• Density of Carmichael numbers with three prime factors
• Two kinds of strong pseudoprimes up to $10^{36}$
• Counting composites with two strong liars
• The Miller–Rabin test with randomized exponents
• Two contradictory conjectures concerning Carmichael numbers
• Finding strong pseudoprimes to several bases. II
• Finding 𝐶₃-strong pseudoprimes
• Prime-number algorithm for public-key systems
• Finding Carmichael numbers
• Title not available (Why is that?)
• Further investigations with the strong probable prime test

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137458)