A taxonomy of pairings, their security, their complexity [article]

Razvan Barbulescu, Nadia El Mrabet, Loubna Ghammam
2019 IACR Cryptology ePrint Archive  
The Kim-Barbulescu attack against pairings made it necessary to increase the key sizes of the most popular families of pairings: BN, BLS-12, KSS-16, KSS-18 and BLS-24. The computation of new key sizes was a slow process because it was done in two waves: first a series of theoretical estimations, then a wave of precise estimations based on practical models BD model [5] and GS [43] . In this paper, we propose an up-to-date security evaluation for more than hundred pairing friendly elliptic
more » ... We evaluate the complexity of a complete pairing execution taking into account the Miller algorithm for different degrees of twist and the final exponentiation for the most promising curves. At 128 bits of security we find that the best pairings in the BD model are BLS-24 and BLS-12. The best pairings are not affected by the new polynomial selection method [43] . At 192 bits of security, we find that the new champions are the less known BLS-24, KSS-16 and KSS-18. At 256 bits of security we conclude that the best pairing is k27method66.
dblp:journals/iacr/BarbulescuMG19 fatcat:6b7zrqiocfgqjmryggnfmapheu