Evaluation and comparison of two efficient probabilistic primality testing algorithms
From MaRDI portal
Cites work
- 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?)
- A Fast Monte-Carlo Test for Primality
- Fast multiplication of large numbers
Cited in
(29)- On the effectiveness of a generalization of Miller's primality theorem
- Some thoughts on pseudoprimes
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Generalized strong pseudoprime tests and applications
- A probable prime test with high confidence
- The generation of random numbers that are probably prime
- The Probability that a Random Probable Prime is Composite
- Strengthening the Baillie-PSW primality test
- Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm
- Finding strong pseudoprimes to several bases
- Improved error bounds for the Fermat primality test on random inputs
- Frobenius pseudoprimes
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test
- Multidimensional scaling and visualization of patterns in prime numbers
- A generalization of Miller’s primality theorem
- Two kinds of strong pseudoprimes up to $10^{36}$
- The Rabin-Monier theorem for Lucas pseudoprimes
- The Miller–Rabin test with randomized exponents
- On practical aspects of the Miller-Rabin primality test
- Counting composites with two strong liars
- Average liar count for degree-\(2\) Frobenius pseudoprimes
- On the number of primality witnesses of composite integers
- An unconditional improvement to the running time of the quadratic Frobenius test
- Finding strong pseudoprimes to several bases. II
- Primality testing
- Realistic analysis of some randomized algorithms
- Pseudoprimes and Fermat numbers
- Euler pseudoprime polynomials and strong pseudoprime polynomials
- Further investigations with the strong probable prime test
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)
