Implementation of Pollard Rho Attack on Elliptic Curve Cryptography over Binary Fields

被引：1

作者：

Wienardo ^{[1
]}

Yuliawan, Fajar ^{[2
]}

Muchtadi-Alamsyah, Intan ^{[2
]}

Rahardjo, Budi ^{[1
]}

机构：

[1] Inst Teknol Bandung, Sch Elect Engn & Informat, Bandung 40132, Indonesia

[2] Inst Teknol Bandung, Fac Math & Nat Sci, Algebra Res Grp, Jalan Ganesha 10, Bandung 40132, Indonesia

来源：

5TH INTERNATIONAL CONFERENCE ON MATHEMATICS AND NATURAL SCIENCES (ICMNS 2014) | 2015年 / 1677卷

关键词：

D O I：

10.1063/1.4930641

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Elliptic Curve Cryptography (ECC) is a public key cryptosystem with a security level determined by discrete logarithm problem called Elliptic Curve Discrete Logarithm Problem (ECDLP). John M. Pollard proposed an algorithm for discrete logarithm problem based on Monte Carlo method and known as Pollard Rho algorithm. The best current brute-force attack for ECC is Pollard Rho algorithm. In this research we implement modified Pollard Rho algorithm on ECC over GF (2(41)). As the result, the runtime of Pollard Rho algorithm increases exponentially with the increase of the ECC key length. This work also presents the estimated runtime of Pollard Rho attack on ECC over longer bits.

引用

页数：4

共 50 条

[21] Flexible Hardware Processor for Elliptic Curve Cryptography Over NIST Prime Fields
Ananyi, Kendall
Alrimeih, Hamad
Rakhmatov, Daler
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2009, 17 (08) : 1099 - 1112
[22] Construction of an elliptic curve over finite fields to combine with convolutional code for cryptography
Ontiveros, B.
Soto, I.
Carrasco, R.
IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 2006, 153 (04): : 299 - 306
[23] Securing Elliptic Curve Based EI-Gamal Against Pollard Rho Attack Using Elliptic Curve Based Diffie-Hellman Key Exchange
Zani, Tafta
Barmawi, Ari Moesriami
Abdurohman, Maman
2012 INTERNATIONAL CONFERENCE FOR INTERNET TECHNOLOGY AND SECURED TRANSACTIONS, 2012, : 505 - 512
[24] Software Implementation of Elliptic Curve Encryption over Binary Field
ZHANG Xianfeng QIN Zhiguang ZHOU Shijie LIU Jinde(School of Computer Science and Engineering
Journal of Electronic Science and Technology, 2003, (01) : 54 - 59
[25] FPGA Based Implementation of Elliptic Curve Cryptography
Nawari, Mustafa
Ahmed, Hazim
Hamid, Aisha
Elkhidir, Mohamed
2015 WORLD SYMPOSIUM ON COMPUTER NETWORKS AND INFORMATION SECURITY (WSCNIS), 2015,
[26] Implementation of ElGamal Elliptic Curve Cryptography Over Prime Field Using C
Boruah, Debabrat
Saikia, Monjul
2014 INTERNATIONAL CONFERENCE ON INFORMATION COMMUNICATION AND EMBEDDED SYSTEMS (ICICES), 2014,
[27] Instruction set extension for fast elliptic curve cryptography over binary finite fields GF(2m)
Grosschädl, J
Kamendje, GA
IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2003, : 455 - 468
[28] Low-Cost Hardware Implementation of Elliptic Curve Cryptography for General Prime Fields
Ma, Yuan
Zhang, Qinglong
Liu, Zongbin
Tu, Chenyang
Lin, Jingqiang
INFORMATION AND COMMUNICATIONS SECURITY, ICICS 2016, 2016, 9977 : 292 - 306
[29] Elliptic Curve Cryptography over Gaussian Integers
Mohamed, Elsayed
Elkamchouchi, Hassan
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2009, 9 (01): : 413 - 416
[30] Elliptic curve cryptography over binary finite field GF(2m)
Department of Physics, Eastern Mediterranean University, via Mersin 10, Gazimagusa, North Cyprus, Turkey
Inf. Technol. J., 2006, 1 (204-229):

← 1 2 3 4 5 →