Constructing pairing-friendly genus 2 curves with split Jacobian

被引：0
|
作者：
Drylo, Robert [1 ,2 ]
机构：
[1] Institute of Mathematics, Polish Academy of Sciences, ul. Śniadeckich 8, 00-950 Warszawa, Poland
[2] Warsaw School of Economics, al. Niepodleglości 162, 02-554 Warszawa, Poland
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2012年 / 7668 LNCS卷
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Public key cryptography
引用
收藏
页码：431 / 453
相关论文
共 50 条
  • [1] Constructing pairing-friendly genus 2 curves with ordinary jacobians
    Freeman, David
    Pairing-Based Cryptography - Pairing 2007, 2007, 4575 : 152 - 176
  • [2] 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
  • [3] CONSTRUCTING PAIRING-FRIENDLY CURVES WITH VARIABLE CM DISCRIMINANT
    Lee, Hyang-Sook
    Park, Cheol-Min
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2012, 49 (01) : 75 - 88
  • [4] Constructing pairing-friendly hyperelliptic curves using Weil restriction
    Freeman, David Mandell
    Satoh, Takakazu
    JOURNAL OF NUMBER THEORY, 2011, 131 (05) : 959 - 983
  • [5] On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant
    Drylo, Robert
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2011, 2011, 7107 : 310 - 319
  • [6] Constructing pairing-friendly elliptic curves with embedding degree 10
    Freeman, David
    ALGORITHMIC NUMBER THEORY, PROCEEDINGS, 2006, 4076 : 452 - 465
  • [7] Constructing pairing-friendly elliptic curves using Grobner basis reduction
    Benits Junior, Waldyr D.
    Galbraith, Steven D.
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2007, 4887 : 336 - 345
  • [8] 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
  • [9] Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
    Tanaka, Satoru
    Nakamula, Ken
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2008, 2008, 5209 : 136 - 145
  • [10] Genus 2 hyperelliptic curve families with explicit Jacobian order evaluation and pairing-friendly constructions
    Guillevic, Aurore
    Vergnaud, Damien
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 7708 LNCS : 234 - 253
12345