Attacking a Binary GLS Elliptic Curve with Magma

被引：4
|
作者：
Chi, Jesus-Javier [1 ]
Oliveira, Thomaz [1 ]
机构：
[1] CINVESTAV IPN, Dept Comp Sci, Mexico City, DF, Mexico
来源：
PROGRESS IN CRYPTOLOGY - LATINCRYPT 2015 | 2015年 / 9230卷
关键词：
WEIL DESCENT;
D O I：
10.1007/978-3-319-22174-8_17
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we present a complete Magma implementation for solving the discrete logarithm problem (DLP) on a binary GLS curve defined over the field F-262. For this purpose, we constructed a curve vulnerable against the gGHS Weil descent attack and adapted the algorithm proposed by Enge and Gaudry to solve the DLP on the Jacobian of a genus-32 hyperelliptic curve. Furthermore, we describe a mechanism to check whether a randomly selected binary GLS curve is vulnerable against the gGHS attack. Such method works with all curves defined over binary fields and can be applied to each element of the isogeny class.
引用
收藏
页码：308 / 326
页数：19
相关论文
共 50 条
  • [21] Performance Evaluation of Projective Binary Edwards Elliptic Curve Computations with Parallel Architectures
    Al-Khatib, Mohammad
    Abu Al-Haija, Qasem
    Mahmod, Ramlan
    JOURNAL OF INFORMATION ASSURANCE AND SECURITY, 2011, 6 (01): : 1 - 9
  • [22] High Performance FPGA Implementation of Elliptic Curve Cryptography over Binary Fields
    Liu, Shuai
    Ju, Lei
    Cai, Xiaojun
    Jia, Zhiping
    Zhang, Zhiyong
    2014 IEEE 13TH INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (TRUSTCOM), 2014, : 148 - 155
  • [23] FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field
    Li, Hao
    Huang, Jian
    Sweany, Philip
    Huang, Dijiang
    JOURNAL OF SYSTEMS ARCHITECTURE, 2008, 54 (12) : 1077 - 1088
  • [24] Parallel and Regular Algorithm of Elliptic Curve Scalar Multiplication over Binary Fields
    Li, Xingran
    Yu, Wei
    Li, Bao
    SECURITY AND COMMUNICATION NETWORKS, 2020, 2020 (2020)
  • [25] Implementation of Pollard Rho Attack on Elliptic Curve Cryptography over Binary Fields
    Wienardo
    Yuliawan, Fajar
    Muchtadi-Alamsyah, Intan
    Rahardjo, Budi
    5TH INTERNATIONAL CONFERENCE ON MATHEMATICS AND NATURAL SCIENCES (ICMNS 2014), 2015, 1677
  • [26] Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
    Denis Khleborodov
    Advances in Computational Mathematics, 2018, 44 : 1275 - 1293
  • [27] Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
    Khleborodov, Denis
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2018, 44 (04) : 1275 - 1293
  • [28] CREATING AN ELLIPTIC CURVE ARITHMETIC UNIT FOR USE IN ELLIPTIC CURVE CRYPTOGRAPHY
    Fournaris, Apostolos P.
    Koufopavlou, Odysseas
    2008 IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, PROCEEDINGS, 2008, : 1457 - 1464
  • [29] Left-to-right binary signed-digit recoding for elliptic curve cryptography
    Katti, R
    Ruan, XY
    2004 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 2, PROCEEDINGS, 2004, : 365 - 368
  • [30] Karatsuba-Block-Comb technique for elliptic curve cryptography over binary fields
    Seo, Hwajeong
    Liu, Zhe
    Choi, Jongseok
    Kim, Howon
    SECURITY AND COMMUNICATION NETWORKS, 2015, 8 (17) : 3121 - 3130
12345