Revisiting the Complex Multiplication Method for the Construction of Elliptic Curves

Elisavet Konstantinou () and Aristides Kontogeorgis ()
Additional contact information
Elisavet Konstantinou: University of the Aegean, Department of Information and Communication Systems Engineering
Aristides Kontogeorgis: University of Athens, Department of Mathematics

A chapter in Computation, Cryptography, and Network Security, 2015, pp 299-318 from Springer

Abstract: Abstract In this article we give a detailed overview of the Complex Multiplication (CM) method for constructing elliptic curves with a given number of points. In the core of this method, there is a special polynomial called Hilbert class polynomial which is constructed with input a fundamental discriminantd

Keywords: Elliptic curve cryptography; Computational class field theory; Complex multiplication; Shimura reciprocity (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-18275-9_12

Ordering information: This item can be ordered from
http://www.springer.com/9783319182759

DOI: 10.1007/978-3-319-18275-9_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().