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 条
  • [1] A Taxonomy of Pairing-Friendly Elliptic Curves
    David Freeman
    Michael Scott
    Edlyn Teske
    Journal of Cryptology, 2010, 23 : 224 - 280
  • [2] Heuristics on pairing-friendly elliptic curves
    Boxall, John
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2012, 6 (02) : 81 - 104
  • [3] On Cycles of Pairing-Friendly Elliptic Curves
    Chiesa, Alessandro
    Chua, Lynn
    Weidner, Matthew
    SIAM JOURNAL ON APPLIED ALGEBRA AND GEOMETRY, 2019, 3 (02): : 175 - 192
  • [4] Pairing-Friendly Elliptic Curves with Various Discriminants
    Kang, Woo Sug
    Kim, Ki Taek
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010, E93A (06) : 1032 - 1038
  • [5] Constructing Pairing-friendly Elliptic Curves with Small ρ
    Wang, Mingqiang
    Jie, Cai
    2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL III, 2010, : 130 - 133
  • [6] Pairing-friendly elliptic curves of prime order
    Barreto, PSLM
    Naehrig, M
    SELECTED AREAS IN CRYPTOGRAPHY, 2006, 3897 : 319 - 331
  • [7] Revisiting Cycles of Pairing-Friendly Elliptic Curves
    Belles-Munoz, Marta
    Jimenez Urroz, Jorge
    Silva, Javier
    ADVANCES IN CRYPTOLOGY - CRYPTO 2023, PT II, 2023, 14082 : 3 - 37
  • [8] TNFS resistant families of pairing-friendly elliptic curves
    Fotiadis, Georgios
    Konstantinou, Elisavet
    THEORETICAL COMPUTER SCIENCE, 2019, 800 (73-89) : 73 - 89
  • [9] More Sparse Families of Pairing-Friendly Elliptic Curves
    Fotiadis, Georgios
    Konstantinou, Elisavet
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2014, 2014, 8813 : 384 - 399
  • [10] Optimal pairing computation over families of pairing-friendly elliptic curves
    Soo-Kyung Eom
    Hyang-Sook Lee
    Cheol-Min Park
    Applicable Algebra in Engineering, Communication and Computing, 2011, 22 : 235 - 248
12345