Improvement of FPPR method to solve ECDLP
DOI10.1186/S40736-015-0012-6zbMATH Open1358.94063OpenAlexW2082123516WikidataQ59404378 ScholiaQ59404378MaRDI QIDQ740119FDOQ740119
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)
Full work available at URL: https://doi.org/10.1186/s40736-015-0012-6
Recommendations
- Improvement of Faugère et al.'s method to solve ECDLP
- scientific article
- Improving the filtering of branch-and-bound MDD solver
- Improving a primal–dual simplex-type algorithm using interior point methods
- Improved \(\varepsilon\)-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
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]discrete logarithm problemelliptic curveindex calculusmultivariable polynomial system
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)
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- A monte carlo method for factorization
- Kangaroos, monopoly and discrete logarithms
- Cover and decomposition index calculus on elliptic curves made practical. Application to a previously unreachable curve over \(\mathbb{F}_{p^6}\)
- Improving the complexity of index calculus algorithms in elliptic curves over binary fields
- An improved Monte Carlo factorization algorithm
- On polynomial systems arising from a Weil descent
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Elliptic curve discrete logarithm problem over small degree extension fields
- On the discrete logarithm problem in elliptic curves
- Algorithmic Number Theory
- Solving the elliptic curve discrete logarithm problem using Semaev polynomials, Weil descent and Gröbner basis methods -- an experimental study
- A Variant of the F4 Algorithm
- Improvement of Faugère et al.'s method to solve ECDLP
Cited In (2)
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)
