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 条

[31] Fast Architectures for the ηT Pairing over Small-Characteristic Supersingular Elliptic Curves
Beuchat, Jean-Luc
Detrey, Jeremie
Estibals, Nicolas
Okamoto, Eiji
Rodriguez-Henriquez, Francisco
IEEE TRANSACTIONS ON COMPUTERS, 2011, 60 (02) : 266 - 281
[32] Analysis of ECIES and Other Cryptosystems Based on Elliptic Curves
Gayoso Martinez, V.
Hernandez Alvarez, F.
Hernandez Encinas, L.
Sanchez Avila, C.
JOURNAL OF INFORMATION ASSURANCE AND SECURITY, 2011, 6 (04): : 285 - 293
[33] Key Length Estimation of Pairing-Based Cryptosystems Using ηT Pairing over GF(3n)
Shinohara, Naoyuki
Shimoyama, Takeshi
Hayashi, Takuya
Takagi, Tsuyoshi
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2014, E97A (01) : 236 - 244
[34] Converting pairing-based cryptosystems from composite to prime order setting - A comparative analysis
Chatterjee, Sanjit
Das, M. Prem Laxman
Kabaleeshwaran, R.
JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2018, 12 (03) : 159 - 190
[35] Elliptic curves generation for isogeny-based cryptosystems
Aleksandrova E.B.
Shtyrkina A.A.
Yarmak A.V.
Automatic Control and Computer Sciences, 2017, 51 (8) : 928 - 935
[36] A New Method to Establish Cryptosystems Based on Elliptic Curves
孙琦
肖戎
数学进展, 1988, (03) : 325 - 326
[37] A new authentication scheme for safeguarding multiple mobile agent hosts using pairing-based cryptosystems
Department of Information Management, Da-Yeh University, 112 Shan-Jiau Rd., Da-Tsuen, Changhua 515, Taiwan
WSEAS Trans. Commun., 2006, 10 (1945-1952):
[38] Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves
Bencina, Benjamin
Kutas, Peter
Merz, Simon-Philipp
Petit, Christophe
Stopar, Miha
Weitkamper, Charlotte
ADVANCES IN CRYPTOLOGY - CRYPTO 2024, PT V, 2024, 14924 : 183 - 217
[39] NON-COMMUTATIVE DIGIT EXPANSIONS FOR ARITHMETIC ON SUPERSINGULAR ELLIPTIC CURVES
Mazzoli, M.
ACTA MATHEMATICA HUNGARICA, 2016, 149 (01) : 149 - 159
[40] Performance Analysis of Pairing-Based Elliptic Curve Cryptography on Constrained Devices
Hajny, Jan
Dzurenda, Petr
Ricci, Sara
Malina, Lukas
Vrba, Kamil
2018 10TH INTERNATIONAL CONGRESS ON ULTRA MODERN TELECOMMUNICATIONS AND CONTROL SYSTEMS AND WORKSHOPS (ICUMT 2018): EMERGING TECHNOLOGIES FOR CONNECTED SOCIETY, 2018,

← 1 2 3 4 5 →