The State of Elliptic Curve Cryptography |
| |
Authors: | Neal Koblitz Alfred Menezes Scott Vanstone |
| |
Affiliation: | (1) Dept. of Mathematics, University of Washington, Box 354350, Seattle, WA 98195, USA;(2) Dept. of C&O, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1 |
| |
Abstract: | Since the introduction of public-key cryptography by Diffie and Hellman in 1976, the potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized. Although the discrete logarithm problem as first employed by Diffie and Hellman was defined explicitly as the problem of finding logarithms with respect to a generator in the multiplicative group of the integers modulo a prime, this idea can be extended to arbitrary groups and, in particular, to elliptic curve groups. The resulting public-key systems provide relatively small block size, high speed, and high security. This paper surveys the development of elliptic curve cryptosystems from their inception in 1985 by Koblitz and Miller to present day implementations. |
| |
Keywords: | Elliptic curves public-key cryptography |
本文献已被 SpringerLink 等数据库收录! |
|