Finding More Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems

被引：0

作者：

Duan, Pu ^{[1
]}

Cui, Shi ^{[1
]}

Chan, Choong Wah ^{[1
]}

机构：

[1] Nayyang Technol Univ, Sch Elect & Elect Engn, Singapore, Singapore

来源：

PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 6 | 2005年

关键词：

Family of group order; kth root of unity; non-supersingular elliptic curves polynomial field;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Finding suitable non-supersingular elliptic curves for pairing-based cryptosystems becomes an important issue for the modem public-key cryptography after the proposition of id-based encryption scheme and short signature scheme. In previous work different algorithms have been proposed for finding such elliptic curves when embedding degree k is an element of {3, 4, 6} and cofactor h is an element of {1, 2, 3, 4, 5}. In this paper a new method is presented to find more non-supersingular elliptic curves for pairing-based cryptosystems with general embedding degree k and large values of cofactor h. In addition, some effective parameters of these non-supersingular elliptic curves are provided in this paper.

引用

页码：18 / 21

页数：4

共 50 条

[41] Non-commutative digit expansions for arithmetic on supersingular elliptic curves
M. Mazzoli
Acta Mathematica Hungarica, 2016, 149 : 149 - 159
[42] More Sparse Families of Pairing-Friendly Elliptic Curves
Fotiadis, Georgios
Konstantinou, Elisavet
CRYPTOLOGY AND NETWORK SECURITY, CANS 2014, 2014, 8813 : 384 - 399
[43] Elliptic Curves Suitable for Pairing Based Cryptography
Friederike Brezing
Annegret Weng
Designs, Codes and Cryptography, 2005, 37 : 133 - 141
[44] Elliptic curves suitable for pairing based cryptography
Brezing, F
Weng, AG
DESIGNS CODES AND CRYPTOGRAPHY, 2005, 37 (01) : 133 - 141
[45] On the Size of Pairing-Based Non-interactive Arguments
Groth, Jens
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT II, 2016, 9666 : 305 - 326
[46] Pairing-based algorithms for jacobians of genus 2 curves with maximal endomorphism ring
Ionica, Sorina
JOURNAL OF NUMBER THEORY, 2013, 133 (11) : 3755 - 3770
[47] Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
Freeman, David Mandell
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2010, 2010, 6110 : 44 - 61
[48] Public-key cryptosystems based on elliptic curves - An evolutionary approach
Hess, E
CRYPTOGRAPHY AND CODING, PROCEEDINGS, 1997, 1355 : 118 - 118
[49] Pairing-Based Non-interactive Zero-Knowledge Proofs
Groth, Jens
PAIRING-BASED CRYPTOGRAPHY-PAIRING 2010, 2010, 6487 : 206 - 206
[50] Multilinear Mappings Based on Weil Pairing over Elliptic Curves
Tran, My Huynh T.
Ton, Tri T.
Nguyen, Thuc D.
Nguyen, Nam T.
Nguyen, Nhan V.
Nguyen, Binh T.
2017 4TH NAFOSTED CONFERENCE ON INFORMATION AND COMPUTER SCIENCE (NICS), 2017, : 138 - 143

← 1 2 3 4 5 →