Elliptic Curve Arithmetic

Richard Crandall () and Carl Pomerance ()
Additional contact information
Richard Crandall: Center for Advanced Computation
Carl Pomerance: Dartmouth University, Department of Mathematics

Chapter Chapter 7 in Prime Numbers, 2001, pp 285-351 from Springer

Abstract: Abstract The history of what are called elliptic curves goes back well more than a century. Originally developed for classical analysis, elliptic curves have found their way into abstract and computational number theory, and now sit squarely as a primary tool. Like the prime numbers themselves, elliptic curves have the wonderful aspects of elegance, complexity, and power. Elliptic curves are not only celebrated algebraic constructs; they also provide considerable leverage in regard to prime number and factorization studies. Elliptic curve applications even go beyond these domains; for example, they have an increasingly popular role in modern cryptography, as we discuss in Section 8.1.3.

Keywords: Elliptic Curve; Elliptic Curf; Class Number; Elliptic Multiplication; Curve Order (search for similar items in EconPapers)
Date: 2001
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-1-4684-9316-0_7

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

DOI: 10.1007/978-1-4684-9316-0_7

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 ().