On practical aspects of the Miller-Rabin primality test

DOI10.1134/S1995080213040100zbMath1332.11109OpenAlexW2074125170MaRDI QIDQ2442488

B. G. Mubarakov, Sh. T. Ishmukhametov

Publication date: 3 April 2014

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080213040100

zbMATH Keywords

probabilistic algorithmMiller-Rabin testprimality provingpseudoprimes

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Primality (11Y11)

Related Items (4)

An approximating \(k\)-ary GCD algorithm ⋮ GCD calculation in the search task of pseudoprime and strong pseudoprime numbers ⋮ The error probability of the Miller-Rabin primality test ⋮ An algorithm for counting smooth integers

Cites Work

• Unnamed Item
• Probabilistic algorithm for testing primality
• Evaluation and comparison of two efficient probabilistic primality testing algorithms

This page was built for publication: On practical aspects of the Miller-Rabin primality test