Improvement of FPPR method to solve ECDLP

DOI10.1186/S40736-015-0012-6MaRDI QIDQ740119zbMATH OpenOpenAlexWikidataFDO

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

Publication date 12 August 2016

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

discrete logarithm problemelliptic curveindex calculusmultivariable polynomial systemGröbner basis

Mathematics Subject Classification ID

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

Recommendations

• Improvement of Faugère et al.'s method to solve ECDLP
• scientific article; zbMATH DE number 5811421
• Improving the filtering of branch-and-bound MDD solver
• Improving a primal–dual simplex-type algorithm using interior point methods
• Improved -constraint method for multiobjective programming
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
• An improved general Phase-I method in linear programming
• An extension of the Fletcher-Reeves method to linear equality constrained optimization problem

Cites work

• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• A Variant of the F4 Algorithm
• A monte carlo method for factorization
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Algorithmic Number Theory
• An improved Monte Carlo factorization algorithm
• Cover and decomposition index calculus on elliptic curves made practical. Application to a previously unreachable curve over \(\mathbb{F}_{p^6}\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Elliptic curve discrete logarithm problem over small degree extension fields
• Improvement of Faugère et al.'s method to solve ECDLP
• Improving the complexity of index calculus algorithms in elliptic curves over binary fields
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Kangaroos, monopoly and discrete logarithms
• On polynomial systems arising from a Weil descent
• On the discrete logarithm problem in elliptic curves
• Solving the elliptic curve discrete logarithm problem using Semaev polynomials, Weil descent and Gröbner basis methods -- an experimental study

Cited in

(2)

• Improvement of Faugère et al.'s method to solve ECDLP
• Solving 114-bit ECDLP for a Barreto-Naehrig curve

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740119)