Pages that link to "Item:Q1144064"
From MaRDI portal
The following pages link to Evaluation and comparison of two efficient probabilistic primality testing algorithms (Q1144064):
Displaying 28 items.
- On the effectiveness of a generalization of Miller's primality theorem (Q964923) (← links)
- Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm (Q1006997) (← links)
- The generation of random numbers that are probably prime (Q1118632) (← links)
- A probable prime test with high confidence (Q1273196) (← links)
- Generalized strong pseudoprime tests and applications (Q1582299) (← links)
- Euler pseudoprime polynomials and strong pseudoprime polynomials (Q1587772) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- On the number of primality witnesses of composite integers (Q2066454) (← links)
- Multidimensional scaling and visualization of patterns in prime numbers (Q2207803) (← links)
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- An unconditional improvement to the running time of the quadratic Frobenius test (Q2291718) (← links)
- On practical aspects of the Miller-Rabin primality test (Q2442488) (← links)
- Finding strong pseudoprimes to several bases (Q2701572) (← links)
- Frobenius pseudoprimes (Q2701573) (← links)
- The Rabin-Monier theorem for Lucas pseudoprimes (Q3127342) (← links)
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test (Q3147182) (← links)
- Improved error bounds for the Fermat primality test on random inputs (Q3177720) (← links)
- A generalization of Miller’s primality theorem (Q3522306) (← links)
- The Miller–Rabin test with randomized exponents (Q3558749) (← links)
- Two kinds of strong pseudoprimes up to $10^{36}$ (Q3592695) (← links)
- The Probability that a Random Probable Prime is Composite (Q4205482) (← links)
- Finding strong pseudoprimes to several bases. II (Q4417183) (← links)
- Further investigations with the strong probable prime test (Q4878557) (← links)
- Strengthening the Baillie-PSW primality test (Q4992237) (← links)
- Some thoughts on pseudoprimes (Q5158641) (← links)
- Average liar count for degree-$2$ Frobenius pseudoprimes (Q5235112) (← links)
- Counting composites with two strong liars (Q5501162) (← links)
- Primality testing (Q5904395) (← links)
