Computation of Complex Primes Using Elliptic Curves: Application for Cryptosystem Design

Autor:	Boris S. Verkhovsky
Rok vydání:	2012
Předmět:	Algebra Elliptic curve point multiplication Modular elliptic curve Counting points on elliptic curves Schoof's algorithm Elliptic curve cryptography Supersingular elliptic curve Lenstra elliptic curve factorization Division polynomials Mathematics
Zdroj:	International Journal of Communications, Network and System Sciences. :1-6
ISSN:	1913-3723 1913-3715
DOI:	10.4236/ijcns.2012.51001
Popis:	This paper provides several generalizations of Gauss theorem that counts points on special elliptic curves. It is demonstrated how to implement these generalizations for computation of complex primes, which are applicable in several protocols providing security in communication networks. Numerical examples illustrate the ideas discussed in this paper.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::4f1102db5bf0c0b7dc9b48db75488433 https://doi.org/10.4236/ijcns.2012.51001 Zobrazit plný text záznamu