An Overview of Elliptic Curve Cryptography (2000)
| Citations: | 36 - 3 self |
BibTeX
@TECHREPORT{López00anoverview,
author = {Julio López and Ricardo Dahab},
title = {An Overview of Elliptic Curve Cryptography},
institution = {},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Elliptic curve cryptography (ECC) was introduced by Victor Miller and Neal Koblitz in 1985. ECC proposed as an alternative to established public-key systems such as DSA and RSA, have recently gained a lot attention in industry and academia. The main reason for the attractiveness of ECC is the fact that there is no sub-exponential algorithm known to solve the discrete logarithm problem on a properly chosen elliptic curve. This means that significantly smaller parameters can be used in ECC than in other competitive systems such RSA and DSA, but with equivalent levels of security. Some benefits of having smaller key sizes include faster computations, and reductions in processing power, storage space and bandwidth. This makes ECC ideal for constrained environments such as pagers, PDAs, cellular phones and smart cards. The implementation of ECC, on the other hand, requires several choices such as the type of the underlying finite field, algorithms for implementing the finite field arithmetic and so on. In this paper we give we presen an selective overview of the main methods.
Keyphrases
elliptic curve cryptography competitive system rsa selective overview public-key system neal koblitz cellular phone storage space smart card several choice lot attention underlying finite field equivalent level key size sub-exponential algorithm victor miller constrained environment finite field faster computation elliptic curve main method ecc ideal main reason discrete logarithm problem
