Evaluation and comparison of two efficient probabilistic primality testing algorithms
From MaRDI portal
Cites work
- A Fast Monte-Carlo Test for Primality
- Fast multiplication of large numbers
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 3491031 (Why is no real title available?)
- scientific article; zbMATH DE number 3512236 (Why is no real title available?)
- scientific article; zbMATH DE number 3569835 (Why is no real title available?)
- scientific article; zbMATH DE number 3597592 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
Cited in
(31)- Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm
- The generation of random numbers that are probably prime
- A probable prime test with high confidence
- Generalized strong pseudoprime tests and applications
- Euler pseudoprime polynomials and strong pseudoprime polynomials
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- On the number of primality witnesses of composite integers
- Multidimensional scaling and visualization of patterns in prime numbers
- Realistic analysis of some randomized algorithms
- An unconditional improvement to the running time of the quadratic Frobenius test
- On practical aspects of the Miller-Rabin primality test
- Finding strong pseudoprimes to several bases
- Frobenius pseudoprimes
- The Rabin-Monier theorem for Lucas pseudoprimes
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test
- Improved error bounds for the Fermat primality test on random inputs
- A generalization of Miller’s primality theorem
- 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
- Finding strong pseudoprimes to several bases. II
- Further investigations with the strong probable prime test
- Strengthening the Baillie-PSW primality test
- Some thoughts on pseudoprimes
- Average liar count for degree-2 Frobenius pseudoprimes
- Counting composites with two strong liars
- Primality testing
- Pseudoprimes and Fermat numbers
- Fermat pseudoprimes
- From worst to average case to incremental search bounds of the strong Lucas test
- On the effectiveness of a generalization of Miller's primality theorem
This page was built for publication: Evaluation and comparison of two efficient probabilistic primality testing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144064)
