On practical aspects of the Miller-Rabin primality test

DOI10.1134/S1995080213040100MaRDI QIDQ2442488zbMATH OpenOpenAlexFDO

Authors Sh. T. Ishmukhametov, B. G. Mubarakov

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

Miller-Rabin testprimality provingprobabilistic algorithmpseudoprimes

Mathematics Subject Classification ID

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

Recommendations

• The error probability of the Miller-Rabin primality test
• Primality testing with fewer random bits
• A probable prime test with very high confidence for \(n \equiv 3\mod4\)
• scientific article; zbMATH DE number 697832
• Experimental results on probable primality

Cites work

• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• Probabilistic algorithm for testing primality

Cited in

(8)

• A probable prime test with very high confidence for \(n \equiv 3\mod4\)
• The error probability of the Miller-Rabin primality test
• An approximating k-ary GCD algorithm
• GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
• An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
• The Miller–Rabin test with randomized exponents
• An algorithm for counting smooth integers
• On the effectiveness of a generalization of Miller's primality theorem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442488)