Reducing certain elliptic curve discrete logarithms to logarithms in a finite field

被引：0
|
作者：
Shim, K [1 ]
机构：
[1] KISA, Seocho Gu, Seoul 137070, South Korea
来源：
INFORMATION SECURITY AND PRIVACY, PROCEEDINGS | 2001年 / 2119卷
关键词：
anomalous curve; supersingular curve; Weil pairing; elliptic curve discrete logarithm;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We construct a variant of Weil pairing to reduce the elliptic curve discrete logarithm problem to the discrete logarithm problem in the multiplicative subgroup of a finite field. We propose an explicit reduction algorithm using a new pairing and apply the algorithm to the case of two trace elliptic curves.
引用
收藏
页码：514 / 520
页数：7
相关论文
共 9 条
  • [1] Computing elliptic curve discrete logarithms with the negation map
    Wang, Ping
    Zhang, Fangguo
    INFORMATION SCIENCES, 2012, 195 : 277 - 286
  • [2] COMPUTING ELLIPTIC CURVE DISCRETE LOGARITHMS WITH IMPROVED BABY-STEP GIANT-STEP ALGORITHM
    Galbraith, Steven D.
    Wang, Ping
    Zhang, Fangguo
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2017, 11 (03) : 453 - 469
  • [3] Speeding up elliptic curve discrete logarithm computations with point halving
    Zhang, Fangguo
    Wang, Ping
    DESIGNS CODES AND CRYPTOGRAPHY, 2013, 67 (02) : 197 - 208
  • [4] Speeding up elliptic curve discrete logarithm computations with point halving
    Fangguo Zhang
    Ping Wang
    Designs, Codes and Cryptography, 2013, 67 : 197 - 208
  • [5] An Efficient Elliptic Curve Discrete Logarithm based Trapdoor Hash Scheme without Key Exposure
    Sun, Yi
    Chen, Xingyuan
    Du, Xuehui
    JOURNAL OF COMPUTERS, 2013, 8 (11) : 2851 - 2856
  • [6] A new anonymous conference key distribution system based on the elliptic curve discrete logarithm problem
    Yang, CC
    Chang, TY
    Hwang, MS
    COMPUTER STANDARDS & INTERFACES, 2003, 25 (02) : 141 - 145
  • [7] Fastest Parallel Molecular Algorithms for the Elliptic Curve Discrete Logarithm Problem over GF(2n)
    Iaccarino, Gennaro
    Mazza, Tommaso
    WORKSHOP ON BIO-INSPIRED ALGORITHMS FOR DISTRIBUTED SYSTEMS - BADS 2009, 2009, : 95 - 104
  • [8] The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
    Balasubramanian, R
    Koblitz, N
    JOURNAL OF CRYPTOLOGY, 1998, 11 (02) : 141 - 145
  • [9] An efficient self-certified multi-proxy signature scheme based on elliptic curve discrete logarithm problem
    Tahat, Nedal
    Alomari, A. K.
    Al-Hazaimeh, Obaida M.
    Al-Jamal, Mohammad F.
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2020, 23 (04): : 935 - 948
1