Abstract
Elliptic curves constitute one of the main topics of this book. They have been proposed for applications in cryptography due to their fast group law and because so far no subexponential attack on their discrete logarithm problem (cf. Section 1.5) is known. We deal with security issues in later chapters and concentrate on the group arithmetic here. In an actual implementation this needs to be built on an efficient implementation of finite field arithmetic (cf. Chapter 11).
Cite
CITATION STYLE
Doche, C., & Lange, T. (2005). Arithmetic of elliptic curves. In Handbook of Elliptic and Hyperelliptic Curve Cryptography (pp. 267–302). CRC Press. https://doi.org/10.1017/cbo9781139174879.008
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.