Some remarks on primality proving and elliptic curves

Autor:	Alice Silverberg
Rok vydání:	2014
Předmět:	Discrete mathematics Elliptic curve Algebra and Number Theory Factorization Computer Networks and Communications Applied Mathematics Complex multiplication Discrete Mathematics and Combinatorics Primality test Time complexity Mathematics
Zdroj:	Advances in Mathematics of Communications. 8:427-436
ISSN:	1930-5346
DOI:	10.3934/amc.2014.8.427
Popis:	We give an overview of a method for using elliptic curves with complex multiplication to give efficient deterministic polynomial time primality tests for the integers in sequences of a special form. This technique has been used to find the largest proven primes $N$ for which there was no known significant partial factorization of $N-1$ or $N+1$.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e08981b56cb189cc4fce3c7cb20f8958 https://doi.org/10.3934/amc.2014.8.427 Zobrazit plný text záznamu