Solving ECDLP via List Decoding

Fangguo Zhang; Shengli Liu

Paper 2018/795 Original: eprint.iacr.org/2018/795 ↗

Solving ECDLP via List Decoding

Fangguo Zhang

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.
History: 2018-09-02: last updated; 2018-09-01: published
Short URL: https://ia.cr/2018/795
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2018/795}
}