Optimal TNFS-secure pairings on elliptic curves with even embedding degree

C.R. Martindale, Georgios Fotiadis

Research output: Book/ReportReportAcademic

14 Downloads (Pure)

Abstract

In this paper we give a comprehensive comparison between pairing-friendly elliptic curves in Jacobi Quartic and Edwards form with quadratic, quartic, and sextic twists. Our comparison looks at the best choices to date for pairings on elliptic curves with even embedding degree on both G 1 ×G 2
G1×G2
and G 2 ×G 1
G2×G1
(these are the twisted Ate pairing and the optimal Ate pairing respectively). We apply this comparison to each of the nine possible 128-bit TNFS-secure families of elliptic curves computed by Fotiadis and Konstantinou; we compute the optimal choice for each family together with the fastest curve shape/pairing combination. Comparing the nine best choices from the nine families gives a optimal choice of elliptic curve, shape and pairing (given current knowledge of TNFS-secure families). We also present a proof-of-concept MAGMA implementation for each case. Additionally, we give the first analysis, to our knowledge, of the use of quadratic twists of both Jacobi Quartic and Edwards curves for pairings on G 2 ×G 1
G2×G1
, and of the use of sextic twists on Jacobi Quartic curves on G 1 ×G 2
G1×G2
.
Original languageEnglish
Number of pages30
Publication statusPublished - 2018

Publication series

NameCryptology ePrint archive
Volume2018/969

Bibliographical note

https://eprint.iacr.org/2018/969

Fingerprint Dive into the research topics of 'Optimal TNFS-secure pairings on elliptic curves with even embedding degree'. Together they form a unique fingerprint.

  • Cite this

    Martindale, C. R., & Fotiadis, G. (2018). Optimal TNFS-secure pairings on elliptic curves with even embedding degree. (Cryptology ePrint archive; Vol. 2018/969).