Abstract
The first proposed asymmetric encryption scheme was that of Rivest, Shamir, and Adleman, using exponentiation in the group of integers modulo the product of two large primes. Koblitz and Miller independently proposed the use of the groups of points on elliptic curves. In this chapter we cover the algorithm for using curves for cryptography both for encryption and for key exchange. Since the arithmetic to do point addition is expensive, we include the formulas for adding points efficiently. Finally, we include the Pohlig-Hellman attack, which should not be successful if the curves are chosen properly, and the Pollard rho attack, which is the current best attack on the elliptic curve discrete log problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
N. Koblitz, Elliptic curve cryptosystems. Math. Comput. 48, 203–209 (1987)
V.S. Miller, Use of elliptic curves in cryptography, in Advances in Cryptology -CRYPTO ’85, vol. 218, Lecture Notes in Computer Science (1986), pp. 417–426
D. Hankerson, A. Menezes, S. Vanstone, Guide to Elliptic Curve Cryptography (Springer, 2004)
NIST, Fips 186-4: digital signature standard (2013). https://csrc.nist.gov/publications/detail/fips/186/4/final
M.J. Jacobson, N. Koblitz, J.H. Silverman, A. Stein, E. Teske, Analysis of the Xedni calculus attack. Des. Codes Cryptogr. 20, 41–64 (2000)
J.H. Silverman, The Xedni calculus and the elliptic curve discrete logarithm problem. Des. Codes Cryptogr. 20, 5–40 (2000)
S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over \(GF(p)\) and its cryptographic significance. IEEE Trans. Inf. Theory 24, 106–110 (1978)
J.M. Pollard, Monte Carlo methods for index computation mod p. Math. Comput. 918–924 (1978)
K. Maletski, RSA vs ECC Comparison for Embedded Systems (Atmel Corporation white paper, 2015)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Buell, D. (2021). Elliptic Curve Cryptography. In: Fundamentals of Cryptography. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-73492-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-73492-3_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73491-6
Online ISBN: 978-3-030-73492-3
eBook Packages: Computer ScienceComputer Science (R0)