Improvement of Faugère et al.’s Method to Solve ECDLP

DOI10.1007/978-3-642-41383-4_8zbMath1357.94069OpenAlexW2241392017WikidataQ62047258 ScholiaQ62047258MaRDI QIDQ3190018

Yun-Ju Huang, Tsuyoshi Takagi, Naoyuki Shinohara, Christophe Petit

Publication date: 15 September 2014

Published in: Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2324/1434304

zbMATH Keywords

Gröbner basiselliptic curvediscrete logarithm problemindex calculusmultivariable polynomial system

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (7)

On index calculus algorithms for subfield curves ⋮ A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two ⋮ Quasi-subfield polynomials and the elliptic curve discrete logarithm problem ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ On the discrete logarithm problem for prime-field elliptic curves ⋮ Improvement of FPPR method to solve ECDLP

This page was built for publication: Improvement of Faugère et al.’s Method to Solve ECDLP