Elliptic Curve Cryptography
- Darrel HankersonAffiliated withDepartment of Mathematics, Auburn University
- , Alfred MenezesAffiliated withDepartment of Combinatorics and Optimization, University of Waterloo
Elliptic curve cryptography (ECC) encompasses the design and analysis of public-key cryptographic schemes that can be implemented using elliptic curves.
Elliptic curve cryptographic schemes were proposed independently in 1985 by Neal Koblitz  and Victor Miller . They are the elliptic curve analogues of schemes based on the discrete logarithm problem, where the underlying group is the group of points on an elliptic curve defined over a finite field [1, 3]. See  for a historical account of the development and commercial acceptance of ECC.
The security of all elliptic curve signature schemes, elliptic curve key agreement schemes and elliptic curve public-key encryption schemes is based on the apparent intractability of the elliptic curve discrete logarithm problem (ECDLP). Unlike the case of the ordinary discrete logarithm problem in the multiplicative grou ...
Reference Work Entry Metrics
- Elliptic Curve Cryptography
- Reference Work Title
- Encyclopedia of Cryptography and Security
- p 397
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, LLC
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 376. Department of Mathematics and Computing Science, Eindhoven University of Technology
- 377. Center for Secure Information Systems, George Mason University
- Author Affiliations
- 1. Department of Mathematics, Auburn University, 221 Parker Hall, 36849-5307, Auburn, AL, USA
- 2. Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada
To view the rest of this content please follow the download PDF link above.