On implementation of GHS attack against elliptic curve cryptosystems over cubic extension fields of odd characteristic

被引:0
|
作者
Hashizume, Naoki [1 ]
Momose, Fumiyuki [2 ]
Chao, Jinhui [3 ]
机构
[1] Chuo Univ, Course Informat & Syst Engn, Grad Sch Sci & Engn, Bunkyo Ku, 1-13-27 Kasuga, Tokyo 1128551, Japan
[2] Chuo Univ, Fac Sci & Engn, Dept Math, Bunkyo Ku, 1-13-27 Kasuga, Tokyo 1128551, Japan
[3] Chuo Univ, Fac Sci & Engn, Dept Informat & Syst Engn, Bunkyo Ku, 1-13-27 Kasuga, Tokyo 1128551, Japan
关键词
Elliptic curve cryptosystems; Discrete logarithm problem; GHS attack; WEIL DESCENT; HYPERELLIPTIC CURVES; ALGORITHM;
D O I
10.1090/conm/701/14144
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we present algorithms implementing the GHS attack against Elliptic curve cryptosystems (ECC). In particular, we consider two large classes of elliptic curves over cubic extension fields of odd characteristic which have weak covering curves against GHS attack, whose existence have been shown recently [17], [18], [19], [20]. We give algorithms to compute the defining equation of the covering curve and to transfer the DLP from the elliptic curve to the Jacobian of the covering curve. An algorithm to test if the covering curve is hyperelliptic is also given in the appendix.
引用
收藏
页码:125 / 150
页数:26
相关论文
共 37 条
  • [31] On the second rational K-group of an elliptic curve over global fields of positive characteristic
    Kondo, Satoshi
    Yasuda, Seidai
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2011, 102 : 1053 - 1098
  • [32] A small and fast software implementation of elliptic curve cryptosystems over GF(p) on a 16-bit micro computer
    Hasegawa, T
    Nakajima, J
    Matsui, M
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1999, E82A (01) : 98 - 106
  • [33] A performance evaluation of ARM ISA extension for elliptic curve cryptography over binary finite fields
    Bartolini, S
    Branovic, I
    Giorgi, R
    Martinelli, E
    16TH SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, PROCEEDINGS, 2004, : 238 - 245
  • [34] Scalable and parameterized hardware implementation of Elliptic Curve Digital Signature Algorithm over Prime Fields
    Panjwani, Bhanu
    2017 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2017, : 211 - 218
  • [35] FourQ on FPGA: New Hardware Speed Records for Elliptic Curve Cryptography over Large Prime Characteristic Fields
    Jarvinen, Kimmo
    Miele, Andrea
    Azarderakhsh, Reza
    Longa, Patrick
    CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2016, 2016, 9813 : 517 - 537
  • [36] 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
  • [37] Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields
    Ben-Sasson, Eli
    Carmon, Dan
    Kopparty, Swastik
    Levit, David
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 700 - 737