The state of elliptic curve cryptography (Q1976039): Difference between revisions

This paper surveys the elliptic curve cryptography that is based on the discrete logarithm problem. Compared to their counterparts in groups of integers, elliptic curves usually provide smaller keys and lower computational complexities. The paper gives a brief overview of elliptic curves, discusses the elliptic curve discrete logarithm problem and finally considers various issues that arise in implementations.