Abstract
Elliptic Curve Cryptography (ECC) is a branch of public-key cryptography based on the arithmetic of elliptic curves. In the short life of ECC, most standards have proposed curves defined over prime finite fields using the short Weierstrass form. However, some researchers have started to propose as a more secure alternative the use of Edwards and Montgomery elliptic curves, which could have an impact in current ECC deployments. This chapter presents the different types of elliptic curves used in Cryptography together with the best-known procedure for generating secure elliptic curves, Brainpool. The contribution is completed with the examination of the latest proposals regarding secure elliptic curves analyzed by the SafeCurves initiative.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Agence Nationale de la Sécurité des Systèmes d’Information. (2011). Avis relatif aux paramètres de courbes elliptiques définis par l’Etat français. http://www.legifrance.gouv.fr/affichTexte.do?cidTexte=JORFTEXT000024668816.
American National Standards Institute. (2001). Public Key Cryptography for the Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography. ANSI X9.63.
American National Standards Institute. (2005). Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA). ANSI X9.62.
Bernstein, D. J., & Lange, T. (2007). Curve25519: New Diffie-Hellman speed records. In Proceedings of the 9th International Conference on Theory and Practice in Public-Key Cryptography (PKC 2006) (pp. 207–228).
Bernstein, D. J., & Lange, T. (2007). Faster addition and doubling on elliptic curves (pp. 29–50). Berlin/Heidelberg: Springer.
Bernstein, D. J., & Lange, T. (2014). SafeCurves. http://safecurves.cr.yp.to/.
Bernstein, D. J., & Lange, T. (2016). Explicit-Formulas Database. https://hyperelliptic.org/EFD/.
Bernstein, D. J., Birkner, P., Joye, M., Lange, T., & Peters, C. (2008). Twisted Edwards curves. Cryptology ePrint Archive, Report 2008/013. http://eprint.iacr.org/2008/013.
Bernstein, D. J., Hamburg, M., Krasnova, A., & Lange, T. (2013). Elligator: Elliptic-curve points indistinguishable from uniform random strings. In Proceedings of the 2013 Conference on Computer & Communications Security (pp. 967–980).
Brainpool. (2005). ECC Brainpool Standard Curves and Curve Generation. Version 1.0. http://www.ecc-brainpool.org/download/Domain-parameters.pdf.
Bundesamt für Sicherheit in der Informationstechnik. (2012). Elliptic Curve Cryptography. BSI TR-03111 version 2.0. https://www.bsi.bund.de/SharedDocs/Downloads/EN/BSI/Publications/TechGuidelines/TR03111/BSI-TR-03111_pdf.pdf?__blob=publicationFile.
Cohen, H., & Frey, G. (2006). Handbook of elliptic and hyperelliptic curve cryptography. Boca Raton, FL: Chapman & Hall/CRC.
Diem, C. (2003). The GHS attack in odd characteristic. Journal of the Ramanujan Mathematical Society, 18, 1–32.
Durán Díaz, R., Gayoso Martínez, V., Hernández Encinas, L., & Martín Muñoz, A. (2016). A study on the performance of secure elliptic curves for cryptographic purposes. In Proceedings of the International Joint Conference SOCO’16-CISIS’16-ICEUTE’16 (pp. 658–667).
Edwards, H. M. (2007). A normal form for elliptic curves. Bulletin of the American Mathematical Society, 44, 393–422.
ElGamal, T. (1985). A public-key cryptosystem and a signature scheme based on discrete logarithm. IEEE Transactions on Information Theory, 31, 469–472.
Frey, G. (1998). How to Disguise an Elliptic Curve (Weil Descent). http://www.cacr.math.uwaterloo.ca/conferences/1998/ecc98/slides.html.
Frey, G. (2001). Applications of arithmetical geometry to cryptographic constructions. In Proceedings of the 5th International Conference on Finite Fields and Applications (pp. 128–161). Heidelberg: Springer.
Frey, G., & Ruck, H. (1994). A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation, 62, 865–874.
Gaudry, P., Hess, F., & Smart, N. P. (2002). Constructive and destructive facets of Weil descent on elliptic curves. Journal of Cryptology, 15, 19–46.
Institute of Electrical and Electronics Engineers: Standard Specifications for Public Key Cryptography. IEEE 1363 (2000).
Institute of Electrical and Electronics Engineers: Standard Specifications for Public Key Cryptography - Amendment 1: Additional Techniques. IEEE 1363a (2004).
International Organization for Standardization/International Electrotechnical Commission: Information Technology-Security Techniques-Encryption Algorithms—Part 2: Asymmetric Ciphers. ISO/IEC 18033-2 (2006).
Koblitz, N. (1987). Elliptic curve cryptosytems. Mathematics of Computation, 48(177), 203–209.
Lochter, M., & Merkle, J. (2010). Elliptic curve cryptography (ECC) Brainpool standard curves and curve generation. Request for Comments (RFC 5639), Internet Engineering Task Force.
Menezes, A. J. (1993). Elliptic curve public key cryptosystems. Boston, MA: Kluwer Academic Publishers.
Menezes, A., Okamoto, W., & Vanstone, S. (1993). Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory, 39, 1639–1646.
Miller, V. S. (1986). Use of elliptic curves in cryptography. In Lecture Notes in Computer Science (Vol. 218, pp. 417–426). Berlin: Springer.
Montgomery, P. L. (1987). Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48, 243–264.
National Institute of Standards and Technology: Digital Signature Standard (DSS). NIST FIPS 186-4 (2009).
National Institute of Standards and Technology: Report on Post-quantum Cryptography (2016). http://nvlpubs.nist.gov/nistpubs/ir/2016/NIST.IR.8105.pdf.
National Security Agency: NSA Suite B Cryptography (2009). http://www.nsa.gov/ia/programs/suiteb_cryptography/index.shtml.
National Security Agency: Commercial National Security Algorithm Suite (2015). https://www.iad.gov/iad/programs/iad-initiatives/cnsa-suite.cfm.
Pollard, J. (1978). Monte Carlo methods for index computation mod p. Mathematics of Computation, 32, 918–924.
Standards for Efficient Cryptography Group: Recommended Elliptic Curve Domain Parameters. SECG SEC 2 version 2.0 (2010).
Acknowledgements
This work has been partly supported by Ministerio de Economía y Competitividad (Spain) under the project TIN2014-55325-C2-1-R (ProCriCiS), and by Comunidad de Madrid (Spain) under the project S2013/ICE-3095-CM (CIBERDINE), cofinanced with the European Union FEDER funds.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Gayoso Martínez, V., González-Manzano, L., Martín Muñoz, A. (2018). Secure Elliptic Curves in Cryptography. In: Daimi, K. (eds) Computer and Network Security Essentials. Springer, Cham. https://doi.org/10.1007/978-3-319-58424-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-58424-9_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58423-2
Online ISBN: 978-3-319-58424-9
eBook Packages: EngineeringEngineering (R0)