The error probability of the Miller-Rabin primality test
From MaRDI portal
Publication:1992114
DOI10.1134/S1995080218070132zbMath1459.11234OpenAlexW2890325166MaRDI QIDQ1992114
Sh. T. Ishmukhametov, Nikolai Saveliev, R. Rubtsova
Publication date: 2 November 2018
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080218070132
Related Items (2)
On the number of primality witnesses of composite integers ⋮ A new primality test for natural integers
Cites Work
- Unnamed Item
- On distribution of semiprime numbers
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- On practical aspects of the Miller-Rabin primality test
- Strong pseudoprimes to twelve prime bases
- Strong pseudoprimes to the first eight prime bases
- Two kinds of strong pseudoprimes up to $10^{36}$
- The Pseudoprimes to 25 ⋅10 9
- Lucas Pseudoprimes
- A Fast Monte-Carlo Test for Primality
- A method for obtaining digital signatures and public-key cryptosystems
- Erratum: A Fast Monte-Carlo Test for Primality
- On Strong Pseudoprimes to Several Bases
This page was built for publication: The error probability of the Miller-Rabin primality test