Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves

被引：0
|
作者：
Kachisa, Ezekiel J. [1 ]
机构：
[1] Dublin City Univ, Sch Comp, Dublin 9, Ireland
来源：
PAIRING-BASED CRYPTOGRAPHY-PAIRING 2010 | 2010年 / 6487卷
关键词：
pairing-friendly curves; hyperelliptic curves; ELLIPTIC-CURVES; ORDINARY JACOBIANS;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Constructing pairing-friendly hyperelliptic curves with small rho-values is one of challenges for practicability of pairing-friendly hyperelliptic curves. In this paper, we describe a method that extends the Kawazoe-Takahashi method of generating families of genus 2 ordinary pairing-friendly hyperelliptic curves by parameterizing the parameters as polynomials. With this approach we construct genus 2 ordinary pairing-friendly hyperelliptic curves with 2 < rho <= 3.
引用
收藏
页码：312 / 326
页数：15
相关论文
共 50 条
  • [41] Constructing pairing-friendly elliptic curves using Grobner basis reduction
    Benits Junior, Waldyr D.
    Galbraith, Steven D.
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2007, 4887 : 336 - 345
  • [42] Constructing pairing-friendly elliptic curves using global number fields
    Yasuda, Takanori
    Takagi, Tsuyoshi
    Sakurai, Kouichi
    PROCEEDINGS OF 2015 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2015, : 477 - 483
  • [43] On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
    Sha, Min
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2014, 8 (04) : 417 - 440
  • [44] Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
    Tanaka, Satoru
    Nakamula, Ken
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2008, 2008, 5209 : 136 - 145
  • [45] Pairing-Friendly Curves with Minimal Security Loss by Cheon's Algorithm
    Park, Cheol-Min
    Lee, Hyang-Sook
    ETRI JOURNAL, 2011, 33 (04) : 656 - 659
  • [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] On the rho-values of complete families of pairing-friendly elliptic curves
    Okano, Keiji
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2012, 6 (3-4) : 249 - 268
  • [48] 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
  • [49] Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
    Aranha, Diego F.
    Beuchat, Jean-Luc
    Detrey, Jeremie
    Estibals, Nicolas
    TOPICS IN CRYPTOLOGY - CT-RSA 2012, 2012, 7178 : 98 - +
  • [50] A Weil Pairing on a Family of Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
    Ishii, Masahiro
    Inomata, Atsuo
    Fujikawa, Kazutoshi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2017, E100A (01): : 62 - 72
12345