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 条

[21] Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
Verheul, ER
ADVANCES IN CRYPTOLOGY-EUROCRYPT 2001, PROCEEDINGS, 2001, 2045 : 195 - 210
[22] Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Eric R. Verheul
Journal of Cryptology, 2004, 17 : 277 - 296
[23] Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
Verheul, ER
JOURNAL OF CRYPTOLOGY, 2004, 17 (04) : 277 - 296
[24] Cryptosystems based on elliptic curve pairing
Okamoto, E
Okamoto, T
MODELING DECISIONS FOR ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2005, 3558 : 13 - 23
[25] Breaking Pairing-Based Cryptosystems Using ηT Pairing over GF(397)
Hayashi, Takuya
Shimoyama, Takeshi
Shinohara, Naoyuki
Takagi, Tsuyoshi
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2012, 2012, 7658 : 43 - 60
[26] Generalised Asynchronous Remote Key Generation for Pairing-Based Cryptosystems
Frymann, Nick
Gardham, Daniel
Manulis, Mark
Nartz, Hugo
APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PT I, ACNS 2023, 2023, 13905 : 394 - 421
[27] An Automated Scheduler-based Approach for the Development of Cryptoprocessors for Pairing-Based Cryptosystems
Winograd, Theodore
Shahid, Rabia
Gaj, Kris
2019 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2019, : 123 - 131
[28] Pairing Compression on Some Elliptic Curves with Subgroups of Embedding Degree 6 and Its Applications to Pairing-Based Cryptography
Li, Liang
Hu, Gengran
EMERGING INFORMATION SECURITY AND APPLICATIONS, EISA 2023, 2024, 2004 : 77 - 91
[29] Finding invalid signatures in pairing-based batches
Law, Laurie
Matt, Brian J.
CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2007, 4887 : 34 - +
[30] Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
Beuchat, Jean-Luc
Lopez-Trejo, Emmanuel
Martinez-Ramos, Luis
Mitsunari, Shigeo
Rodriguez-Henriquez, Francisco
CRYPTOLOGY AND NETWORK SECURITY, PROCEEDINGS, 2009, 5888 : 413 - +

← 1 2 3 4 5 →