On practical aspects of the Miller-Rabin Primality Test

Autor:	Shamil Ishmukhametov, B. Mubarakov
Rok vydání:	2013
Předmět:	Set (abstract data type) Miller–Rabin primality test General Mathematics Primality certificate Arithmetic Primality test Solovay–Strassen primality test Prime (order theory) Randomized algorithm Mathematics Lucas primality test
Zdroj:	Lobachevskii Journal of Mathematics. 34:304-312
ISSN:	1818-9962 1995-0802
DOI:	10.1134/s1995080213040100
Popis:	The well-known Miller-Rabin Primality Test MRPT is used to check naturals to be prime or composite. We study the dependence between the length of testing numbers and the number of rounds of MRPT sufficient to give the correct answer and give some recommendations how to choose a suitable set of bases at which MRPT runs more efficiently. Concluding the paper we state a number of theoretical problems which decision allows to improve an implementation of MRPT.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::edbe24f1275e53786fc5ccb3e29c6f7f https://doi.org/10.1134/s1995080213040100 Zobrazit plný text záznamu Full text from SpringerLink