A Study on the Performance of Secure Elliptic Curves for Cryptographic Purposes

• Raúl Durán Díaz ^[1] ; Victor Gayoso Martíınez ^[2] ; Luis Hernández Encinas ^[2] ; Martín Muñoz, Agustin ^[2]
  1. [1] Universidad de Alcalá

     Universidad de Alcalá

     Alcalá de Henares, España

     
  2. [2] Centro de Tecnologías Físicas y de la Información Leonardo Torres Quevedo

     Centro de Tecnologías Físicas y de la Información Leonardo Torres Quevedo

     Madrid, España

     
• Localización: International Joint Conference SOCO’16-CISIS’16-ICEUTE’16: San Sebastián, Spain, October 19th-21st, 2016 Proceedings / coord. por Manuel Graña Romay , José Manuel López Guede , Oier Echaniz, Álvaro Herrero Cosío , Héctor Quintián Pardo , Emilio Santiago Corchado Rodríguez , 2017, ISBN 978-3-319-47364-2, págs. 658-667
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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 satisfying the curve equation in 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 contribution evaluates the performance of the three types of elliptic curves using some of the examples provided by the initiative SafeCurves and a Java implementation developed by the authors, which allows us to offer some conclusions about this topic.