Improvement of FPPR method to solve ECDLP

DOI10.1186/s40736-015-0012-6zbMath1358.94063OpenAlexW2082123516WikidataQ59404378 ScholiaQ59404378MaRDI QIDQ740119

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

Publication date: 12 August 2016

Published in: Pacific Journal of Mathematics for Industry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s40736-015-0012-6

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Kangaroos, monopoly and discrete logarithms
• Elliptic curve discrete logarithm problem over small degree extension fields
• Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study
• Cover and Decomposition Index Calculus on Elliptic Curves Made Practical
• Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
• A Variant of the F4 Algorithm
• On the discrete logarithm problem in elliptic curves
• Improvement of Faugère et al.’s Method to Solve ECDLP
• An improved Monte Carlo factorization algorithm
• A monte carlo method for factorization
• On Polynomial Systems Arising from a Weil Descent
• Algorithmic Number Theory

This page was built for publication: Improvement of FPPR method to solve ECDLP