Skip to main content

Synonyms

Edwards coordinates

Related Concepts

Elliptic Curve Cryptography; Elliptic Curve Method of Factorization; Elliptic Curves; Elliptic Curves for Primality Proving; Hyperelliptic Curves

Definition

An Edwards curve is an elliptic curve. Let k be a field in which \(2\neq 0\) and let \(d \in k\setminus \{0,1\}\); then \({x}^{2} + {y}^{2} = 1 + d{x}^{2}{y}^{2}\) defines an Edwards curve.

Background

Harold Edwards showed in [9] that any elliptic curve over a field in which \(2\neq 0\) can be written in the form \({x}^{2} + {y}^{2} = {a}^{2}(1 + {x}^{2}{y}^{2})\), where \({a}^{4}\neq 1\) or 0, possibly after a finite field extension. Edwards also showed how to do arithmetic on this curve shape, i.e., how to add two points. In [6] Bernstein and Lange generalized the curve shape to \({x}^{2} + {y}^{2} = 1 + d{x}^{2}{y}^{2}\) with d ∈ k ∖ {0, 1}; these curves are now called Edwards curves. They also provided explicit formulas for adding and doubling points in projective coordinates....

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Aréne C, Lange T, Naehrig M, Ritzenthaler C (2011) Faster computation of the Tate pairing. J Number Theory 131(5):842–857, Elliptic Curve Cryptography, ISSN 0022-314X, DOI: 10.1016/j.jnt.2010.05.013. http://www.sciencedirect.com/science/article/pii/S0022314X10001757

  2. Bernstein DJ, Birkner P, Joye M, Lange T, Peters C (2008) Twisted Edwards curves. In: Vaudenay S (ed) Progress in cryptology – AFRICACRYPT 2008, Proceedings of first international conference on cryptology in Africa, Casablanca, Morocco, 11–14 June 2008. Lecture notes in computer science, vol 5023. Springer, Berlin, pp 389–405

    Chapter  Google Scholar 

  3. Bernstein DJ, Birkner P, Lange T, Peters C (2008) ECM using Edwards curves. Technical report, ePrint archive. http://eprint.iacr.org/2008/016

  4. Bernstein DJ, Chen T-R, Cheng C-M, Lange T, Yang B-Y (2009) ECM on graphics cards. In: Joux A (ed) Advances in cryptology – EUROCRYPT 2009. Proceedings of 28th annual international conference on the theory and applications of cryptographic techniques, Cologne, Germany, 26–30 April 2009. Lecture notes in computer science, vol 5479. Springer, Berlin, pp 483–501

    Chapter  Google Scholar 

  5. Bernstein DJ, Lange T Explicit-formulas database. http://www.hyperelliptic.org/EFD. Accessed 16 Jan 2010

  6. Bernstein DJ, Lange T (2007) Faster addition and doubling on elliptic curves. In: Kurosawa K (ed) Advances in cryptology – ASIACRYPT 2007. Proceedings of 13th international conference on the theory and application of cryptology and information security, Kuching, Malaysia, 2–6 Dec 2007. Lecture notes in computer science, vol 4833. Springer, Berlin, pp 29–50. http://cr.yp.to/newelliptic/

  7. Bernstein DJ, Lange T (2011) A complete set of addition laws for incomplete Edwards curves. J Number Theory 131(5):858–872, Elliptic Curve Cryptography, ISSN 0022-314X, DOI: 10.1016/j.jnt.2010.06.015. http://www.sciencedirect.com/science/article/pii/S0022314X10002155

  8. Bernstein DJ, Lange T, Rezaeian Farashahi R (2008) Binary Edwards curves. In: Oswald E, Rohatgi P (eds) Cryptographic hardware and embedded systems – CHES 2008. 10th international workshop, Washington, DC, 10–13 August 2008. Lecture notes in computer science, vol 5154. Springer, Berlin, pp 244–265. http://eprint.iacr.org/2008/171

  9. Edwards HM (2007) A normal form for elliptic curves. Bull Amer Math Soc 44:393–422. http://www.ams.org/bull/2007-44-03/S0273-0979-07-01153-6/home.html

  10. Hisil H, Koon-Ho Wong K, Carter G, Dawson E (2008) Twisted Edwards curves revisited. In: Pieprzyk J (ed) Advances in cryptology – ASIACRYPT 2008. Proceedings of 14th international conference on the theory and application of cryptology and information security, Melbourne, Australia, 7–11 Dec 2008. Lecture notes in computer science, vol 5350. Springer, Berlin, pp 326–343

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Lange, T. (2011). Edwards Curves. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_243

Download citation

Publish with us

Policies and ethics