Paper 2018/795

Solving ECDLP via List Decoding

Fangguo Zhang and Shengli Liu

Abstract

We provide a new approach to the elliptic curve discrete logarithm problem (ECDLP). First, we construct Elliptic Codes (EC codes) from the ECDLP. Then we propose an algorithm of finding the minimum weight codewords for algebraic geometry codes, especially for the elliptic code, via list decoding. Finally, with the minimum weight codewords, we show how to solve ECDLP. This work may provide a potential approach to speeding up the computation of ECDLP

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
elliptic curve cryptosystemECDLPlist decoding
Contact author(s)
isszhfg @ mail sysu edu cn
History
2018-09-02: revised
2018-09-01: received
See all versions
Short URL
https://ia.cr/2018/795
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/795,
      author = {Fangguo Zhang and Shengli Liu},
      title = {Solving ECDLP via List Decoding},
      howpublished = {Cryptology ePrint Archive, Paper 2018/795},
      year = {2018},
      note = {\url{https://eprint.iacr.org/2018/795}},
      url = {https://eprint.iacr.org/2018/795}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.