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 条
  • [21] 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
  • [22] 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
  • [23] Fast Hashing to G2 on Pairing-Friendly Curves
    Scott, Michael
    Benger, Naomi
    Charlemagne, Manuel
    Perez, Luis J. Dominguez
    Kachisa, Ezekiel J.
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2009, 2009, 5671 : 102 - 113
  • [24] Implementation of Tate pairing on hyperelliptic curves of genus 2
    Choie, Y
    Lee, E
    INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2003, 2004, 2971 : 97 - 111
  • [25] 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
  • [26] Pairing-friendly elliptic curves of prime order
    Barreto, PSLM
    Naehrig, M
    SELECTED AREAS IN CRYPTOGRAPHY, 2006, 3897 : 319 - 331
  • [27] Faster pairing computation on genus 2 hyperelliptic curves
    Tang, Chunming
    Xu, Maozhi
    Qi, Yanfeng
    INFORMATION PROCESSING LETTERS, 2011, 111 (10) : 494 - 499
  • [28] Generating hyperelliptic curves of genus 2 suitable for cryptography
    Kanayama, N
    Nagao, K
    Uchiyama, S
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCI I, 2002, : 151 - 156
  • [29] 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
  • [30] TNFS resistant families of pairing-friendly elliptic curves
    Fotiadis, Georgios
    Konstantinou, Elisavet
    THEORETICAL COMPUTER SCIENCE, 2019, 800 (73-89) : 73 - 89
12345