Abstract
Elliptic curves come up everywhere in mathematics. We will now look at some of their uses in unexpected places. In this chapter, we will discuss some of these uses for elliptic curves. In particular, we will discuss a factorization algorithm based on elliptic curves, as well as some applications of elliptic curves over \(\mathbb {Q}\) and \(\mathbb {Z}\) to Diophantine equations. Before we can get to the elliptic curve factorization algorithm, we start with a non-elliptic curve factorization algorithm, that carries some of the same ideas as the elliptic curve method. This is the Pollard \(p-1\) algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Rubinstein-Salzedo, S. (2018). The Versatility of Elliptic Curves. In: Cryptography. Springer Undergraduate Mathematics Series. Springer, Cham. https://doi.org/10.1007/978-3-319-94818-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-94818-8_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94817-1
Online ISBN: 978-3-319-94818-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)