- Tytuł:
- Primality proving with Gauss and Jacobi sums
- Autorzy:
- Chmielowiec, A.
- Powiązania:
- https://bibliotekanauki.pl/articles/308340.pdf
- Data publikacji:
- 2004
- Wydawca:
- Instytut Łączności - Państwowy Instytut Badawczy
- Tematy:
-
prime numbers
primality proving
cyclotomic ring
Gauss sum
Jacobi sum
APR - Opis:
- 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 ln ln lnN acts like a constant.
- Źródło:
-
Journal of Telecommunications and Information Technology; 2004, 4; 69-75
1509-4553
1899-8852 - Pojawia się w:
- Journal of Telecommunications and Information Technology
- Dostawca treści:
- Biblioteka Nauki
Artykuł