Cryptology ePrint Archive: Report 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

Category / Keywords: public-key cryptography / elliptic curve cryptosystem, ECDLP, list decoding

Date: received 30 Aug 2018, last revised 1 Sep 2018

Contact author: isszhfg at mail sysu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20180902:025252 (All versions of this report)

Short URL: ia.cr/2018/795


[ Cryptology ePrint archive ]