This publication is unavailable to your account. If you have more privileged account please try to use it or contact with the institution connected to this digital library.
Chmielowiec, Andrzej
2004, nr 4
artykuł
This article presents a primality test known as APR (Adleman, Pomerance and Rumely) which was invented in 1980. It was later simplified and improved by Cohen and Lenstra. It can be used to prove primality of numbers with thousands of bits in a reasonable amount of time. The running time of this algorithm for number N is O((lnN)Cln ln lnN) for some constant C. This is almost polynomial time since for all practical purposes the function lnlnlnN acts like a constant.
Instytut Łączności - Państwowy Instytut Badawczy, Warszawa
application/pdf
oai:bc.itl.waw.pl:558
10.26636/jtit.2004.4.262
1509-4553
1899-8852
Journal of Telecommunications and Information Technology
ang
Biblioteka Naukowa Instytutu Łączności
Jun 11, 2024
Mar 16, 2010
173
https://bc.itl.waw.pl/publication/623
RDF
OAI-PMH
Chmielowiec, Andrzej Klich, Leszek Woś, Weronika
Citation style: Chicago ISO690 Chicago
This page uses 'cookies'. More information I understand