Last fall degree, HFE, and Weil descent attacks on ECDLP

DOI10.1007/978-3-662-47989-6_28MaRDI QIDQ3457129zbMATH OpenOpenAlexFDO

Authors Michiel Kosters, Sze Ling Yeo, Ming-Deh A. Huang

Publication date 10 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-47989-6_28

zbMATH Keywords

solving equationsfirst fall degreeWeil descentelliptic curve discrete logarithm problem (ECDLP)last fall degreeHidden Field Equation (HFE) public key systems

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• First fall degree and Weil descent
• On the last fall degree of zero-dimensional Weil descent systems
• On the asymptotic effectiveness of Weil descent attacks
• On polynomial systems arising from a Weil descent
• On the first fall degree of summation polynomials

Cites work

• A new efficient algorithm for computing Gröbner bases (F₄)
• Constructive and destructive facets of Weil descent on elliptic curves
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Factoring polynomials over finite fields: A survey
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Inverting HFE Is Quasipolynomial
• Inverting HFE systems is quasi-polynomial for all fields
• On polynomial systems arising from a Weil descent
• On the discrete logarithm problem in elliptic curves

Cited in

(14)

• Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
• On index calculus algorithms for subfield curves
• Worst-case subexponential attacks on PRGs of constant degree or constant locality
• Recent progress on the elliptic curve discrete logarithm problem
• Stronger bounds on the cost of computing Gröbner bases for HFE systems
• Complexity bounds on Semaev's naive index calculus method for ECDLP
• scientific article; zbMATH DE number 1617935 (Why is no real title available?)
• On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations
• On the last fall degree of zero-dimensional Weil descent systems
• On polynomial systems arising from a Weil descent
• On the first fall degree of summation polynomials
• On the last fall degree of Weil descent polynomial systems
• Solving degree, last fall degree, and related invariants
• On product decomposition

This page was built for publication: Last fall degree, HFE, and Weil descent attacks on ECDLP

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