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

DOI10.1007/978-3-662-47989-6_28zbMATH Open1375.94135OpenAlexW2266246005MaRDI QIDQ3457129FDOQ3457129

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

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

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)

Cites Work

• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• 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
• Inverting HFE systems is quasi-polynomial for all fields
• Inverting HFE Is Quasipolynomial
• On polynomial systems arising from a Weil descent
• Constructive and destructive facets of Weil descent on elliptic curves
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• On the discrete logarithm problem in elliptic curves

Cited In (14)

• Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
• Worst-case subexponential attacks on PRGs of constant degree or constant locality
• On index calculus algorithms for subfield curves
• 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
• Title not available (Why is that?)
• 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)