The State of Elliptic Curve Cryptography
Copyright policy )The State of Elliptic Curve Cryptography
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.
- University of Mary United States
- University of Waterloo Canada
- University of Washington United States
Cryptography, elliptic curves, Algebraic coding theory; cryptography (number-theoretic aspects), Applications to coding theory and cryptography of arithmetic geometry, discrete logarithms, public key cryptography
Cryptography, elliptic curves, Algebraic coding theory; cryptography (number-theoretic aspects), Applications to coding theory and cryptography of arithmetic geometry, discrete logarithms, public key cryptography
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).537 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 0.1% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 0.1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!