Skip to main content

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

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Further reading for Chapter 15

  1. I. Blake, G. Seroussi, N. Smart. Elliptic Curves in Cryptography. Cambridge University Press (1999).

    Google Scholar 

  2. I. Blake, G. Seroussi, N. Smart. Advances in Elliptic Curve Cryptography. Cambridge University Press (2005).

    Google Scholar 

  3. D.M. Gordon. A survey of fast exponentiation algorithms. J. Algorithms 27 (1998) 129-146.

    Article  MATH  MathSciNet  Google Scholar 

  4. D.E. Knuth The Art of Computer Programming II - Semi-numerical Algorithms. Addison-Wesley (third edition, 1997).

    Google Scholar 

  5. J.H. Silverman. The Arithmetic of Elliptic Curves. Springer-Verlag (1986).

    Google Scholar 

  6. L.C. Washington Elliptic Curves: Number Theory and Cryptography. Chapman and Hall / CRC Press (2003).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Norman L. Biggs .

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag London

About this chapter

Cite this chapter

Biggs, N.L. (2008). Elliptic curve cryptography. In: Codes: An Introduction to Information Communication and Cryptography. Springer Undergraduate Mathematics Series. Springer, London. https://doi.org/10.1007/978-1-84800-273-9_15

Download citation

Publish with us

Policies and ethics