A Taxonomy of Pairing-Friendly Elliptic Curves

被引：239
|
作者：
Freeman, David [1 ,2 ]
Scott, Michael [3 ]
Teske, Edlyn [4 ]
机构：
[1] CWI, NL-1098 XG Amsterdam, Netherlands
[2] Leiden Univ, NL-1098 XG Amsterdam, Netherlands
[3] Dublin City Univ, Sch Comp Applicat, Dublin 9, Ireland
[4] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
来源：
JOURNAL OF CRYPTOLOGY | 2010年 / 23卷 / 02期
基金：
爱尔兰科学基金会; 美国国家科学基金会;
关键词：
Elliptic curves; Pairing-based cryptosystems; Embedding degree; Efficient implementation; ABELIAN-VARIETIES; DIFFIE-HELLMAN; FINITE-FIELDS; COMPUTATION; LOGARITHMS; CRYPTOGRAPHY; ISOMORPHISM; ALGORITHMS; SIGNATURES; ISOGENIES;
D O I：
10.1007/s00145-009-9048-z
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairing-based cryptographic systems. Such "pairing-friendly" curves are rare and thus require specific constructions. In this paper we give a single coherent framework that encompasses all of the constructions of pairing-friendly elliptic curves currently existing in the literature. We also include new constructions of pairing-friendly curves that improve on the previously known constructions for certain embedding degrees. Finally, for all embedding degrees up to 50, we provide recommendations as to which pairing-friendly curves to choose to best satisfy a variety of performance and security requirements.
引用
收藏
页码：224 / 280
页数：57
相关论文
共 50 条
  • [41] Generating pairing-friendly elliptic curve parameters using sparse families
    Fotiadis, Georgios
    Konstantinou, Elisavet
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2018, 12 (02) : 83 - 99
  • [42] A Construction Method of Final Exponentiation for a Specific Cyclotomic Family of Pairing-Friendly Elliptic Curves with Prime Embedding Degrees
    Nanjo, Yuki
    Shirase, Masaaki
    Kodera, Yuta
    Kusaka, Takuya
    Nogami, Yasuyuki
    2021 NINTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR 2021), 2021, : 148 - 154
  • [43] On the selection of pairing-friendly groups
    Barreto, PSLM
    Lynn, B
    Scott, M
    SELECTED AREAS IN CRYPTOGRAPHY, 2004, 3006 : 17 - 25
  • [44] Pairing-Friendly Curves with Minimal Security Loss by Cheon's Algorithm
    Park, Cheol-Min
    Lee, Hyang-Sook
    ETRI JOURNAL, 2011, 33 (04) : 656 - 659
  • [45] Scalar Multiplication on Pairing Friendly Elliptic Curves
    Kanayama, Naoki
    Teruya, Tadanori
    Okamoto, Eiji
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (06) : 1285 - 1292
  • [46] Experimantal Analysis of Cheon's Algorithm against Pairing-Friendly Curves
    Izu, Tetsuya
    Takenaka, Masahiko
    Yasuda, Masaya
    25TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA 2011), 2011, : 90 - 96
  • [47] Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves
    Fan, Junfeng
    Vercauteren, Frederik
    Verbauwhede, Ingrid
    IEEE TRANSACTIONS ON COMPUTERS, 2012, 61 (05) : 676 - 685
  • [48] Co-factor Clearing and Subgroup Membership Testing on Pairing-Friendly Curves
    El Housni, Youssef
    Guillevic, Aurore
    Piellard, Thomas
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2022, 2022, 13503 : 518 - 536
  • [49] Fast hashing to G2 on pairing-friendly curves with the lack of twists
    Dai, Yu
    Zhang, Fangguo
    Zhao, Chang-An
    FINITE FIELDS AND THEIR APPLICATIONS, 2023, 91
  • [50] Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves
    Sanso, Antonio
    El Housni, Youssef
    JOURNAL OF CRYPTOLOGY, 2024, 37 (04)
12345