Autor:	Myeong-Bok Choi, Sang-Un Lee
Rok vydání:	2011
Předmět:	Fermat primality test Discrete mathematics Miller–Rabin primality test Strong pseudoprime Primality certificate Primality test Solovay–Strassen primality test Computer Science::Formal Languages and Automata Theory Industrial-grade prime Mathematics Lucas primality test
Zdroj:	Journal of the Korea Society of Computer and Information. 16:103-108
ISSN:	1598-849X
Popis:	Generally, Miller-Rabin method has been the most popular primality test. This method arbitrary selects m at k-times from m
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::909d7c3735e21a6a148df0cacb9b2c91 https://doi.org/10.9708/jksci.2011.16.8.103 Zobrazit plný text záznamu