Average Case Error Estimates for the Strong Probable Prime Test
From MaRDI portal
Recommendations
Cited in
(28)- Primality testing with fewer random bits
- Prime-number algorithm for public-key systems
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- The error probability of the Miller-Rabin primality test
- Two contradictory conjectures concerning Carmichael numbers
- Large-order multiple recursive generators with modulus \(2^{31}-1\)
- Improved error bounds for the Fermat primality test on random inputs
- Experimental results on probable primality
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Randomized compositeness testing with Chebyshev polynomials
- The Miller–Rabin test with randomized exponents
- Two kinds of strong pseudoprimes up to $10^{36}$
- The Probability that a Random Probable Prime is Composite
- scientific article; zbMATH DE number 708818 (Why is no real title available?)
- scientific article; zbMATH DE number 721898 (Why is no real title available?)
- 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
- Finding Carmichael numbers
- Counting composites with two strong liars
- An extended quadratic Frobenius primality test with average and worst case error estimates.
- 64-bit and 128-bit DX random number generators
- Average Case Error Estimates of the Strong Lucas Test
- Progress towards a conjecture of S. W. Graham
- From worst to average case to incremental search bounds of the strong Lucas test
- An extended quadratic Frobenius primality test with average- and worst-case error estimate
- On the effectiveness of a generalization of Miller's primality theorem
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)
