Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
DOI10.1007/978-3-662-47989-6_28zbMath1375.94135OpenAlexW2266246005MaRDI QIDQ3457129
Sze Ling Yeo, Michiel Kosters, 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
solving equationsfirst fall degreeWeil descentelliptic curve discrete logarithm problem (ECDLP)last fall degreeHidden Field Equation (HFE) public key systems
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (12)
Cites Work
- 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
- Constructive and destructive facets of Weil descent on elliptic curves
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- On the discrete logarithm problem in elliptic curves
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- On Polynomial Systems Arising from a Weil Descent
- Inverting HFE Systems Is Quasi-Polynomial for All Fields
- Inverting HFE Is Quasipolynomial
- Factoring polynomials over finite fields: A survey
This page was built for publication: Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP