Pages that link to "Item:Q3137458"
From MaRDI portal
The following pages link to Average Case Error Estimates for the Strong Probable Prime Test (Q3137458):
Displayed 16 items.
- On the effectiveness of a generalization of Miller's primality theorem (Q964923) (← links)
- Prime-number algorithm for public-key systems (Q1816016) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Two contradictory conjectures concerning Carmichael numbers (Q2781234) (← links)
- Large-Order Multiple Recursive Generators with Modulus 2<sup>31</sup> − 1 (Q2815474) (← links)
- Improved error bounds for the Fermat primality test on random inputs (Q3177720) (← links)
- Efficient, Robust and Constant-Round Distributed RSA Key Generation (Q3408194) (← links)
- The Miller–Rabin test with randomized exponents (Q3558749) (← links)
- Two kinds of strong pseudoprimes up to $10^{36}$ (Q3592695) (← links)
- Density of Carmichael numbers with three prime factors (Q4372644) (← links)
- Finding strong pseudoprimes to several bases. II (Q4417183) (← links)
- Finding 𝐶₃-strong pseudoprimes (Q4654036) (← links)
- Further investigations with the strong probable prime test (Q4878557) (← links)
- Finding Carmichael numbers (Q5277934) (← links)
- Counting composites with two strong liars (Q5501162) (← links)
- 64-bit and 128-bit DX random number generators (Q5962002) (← links)