Skip to main content

The Versatility of Elliptic Curves

  • Chapter
  • First Online:
Cryptography

Part of the book series: Springer Undergraduate Mathematics Series ((SUMS))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Simon Rubinstein-Salzedo .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

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

Publish with us

Policies and ethics