[Resource Topic] 2018/795: Solving ECDLP via List Decoding

Welcome to the resource topic for 2018/795

Solving ECDLP via List Decoding

Authors: Fangguo Zhang, Shengli Liu


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

ePrint: https://eprint.iacr.org/2018/795

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .