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 条

[1] Non-supersingular elliptic curves for pairing-based cryptosystems
Saito, T
Hoshino, F
Uchiyama, S
Kobayashi, T
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (05): : 1203 - 1205
[2] A method for building more non-supersingular elliptic curves suitable for pairing-based cryptosystems
Cui, S
Duan, P
Chan, CW
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (09) : 2468 - 2470
[3] NON-SUPERSINGULAR ELLIPTIC-CURVES FOR PUBLIC KEY CRYPTOSYSTEMS
BETH, T
SCHAEFER, F
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 547 : 316 - 327
[4] A new method of building more non-supersingular elliptic curves
Cui, S
Duan, P
Chan, CW
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, PT 2, 2005, 3481 : 657 - 664
[5] A remark on the MOV algorithm for non-supersingular elliptic curves
Saito, T
Uchiyama, S
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (05): : 1266 - 1268
[6] Pairing-Based Cryptography on Elliptic Curves
Miret, Josep M.
Sadornil, Daniel
Tena, Juan G.
MATHEMATICS IN COMPUTER SCIENCE, 2018, 12 (03) : 309 - 318
[7] On pairing-based cryptosystems
Okamoto, Tatsuaki
PROGRESS IN CRYPTOLOGY - VIETCRYPT 2006, 2006, 4341 : 50 - 66
[8] Candidate one-way functions on non-supersingular elliptic curves
Saito, T
Hoshino, F
Uchiyama, S
Kobayashi, T
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (01): : 144 - 150
[9] New polynomial families for generating more suitable elliptic curve for pairing-based cryptosystems
School of Electrical and Electronic Engineering, Nanyang Technological University, S2, B3b-10, Workstation Resource Lab, Singapore, Singapore
WSEAS Trans. Comput., 2006, 3 (528-535):
[10] An improvement of the Guajardo-Paar method for multiplication on non-supersingular elliptic curves
López, J
Dahab, R
SCCC'98 - XVIII INTERNATIONAL CONFERENCE OF THE CHILEAN SOCIETY OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 91 - 95

← 1 2 3 4 5 →