Welcome to the resource topic for 2019/555
Title:
Optimal TNFS-secure pairings on elliptic curves with composite embedding degree
Authors: Georgios Fotiadis, Chloe Martindale
Abstract:In this paper we present a comprehensive comparison between pairing-friendly elliptic curves, considering different curve forms and twists where possible. We define a measure of the efficiency of a parametrized pairing-friendly family that takes into account the number field sieve (NFS) attacks (unlike the \rho-value). This measure includes an approximation of the security of the discrete logarithm problem in \mathbb F_{p^k}^*, computed via the method of Barbulescu and Duquesne [4]. We compute the security of the families presented by Fotiadis and Konstantinou in [13], compute some new families, and compare the efficiency of both of these with the (adjusted) BLS, KSS, and BN families, and with the new families of [19]. Finally, we present an optimal pairing-friendly elliptic curve for security level 128 and recommend two pairing-friendly elliptic curves for security level 192.
ePrint: https://eprint.iacr.org/2019/555
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .