Inverting HFE Systems Is Quasi-Polynomial for All Fields
From MaRDI portal
Publication:5199222
DOI10.1007/978-3-642-22792-9_41zbMath1287.94064OpenAlexW122159218MaRDI QIDQ5199222
Timothy J. Hodges, Jintai Ding
Publication date: 12 August 2011
Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_41
Related Items (21)
Efficient key recovery for all HFE signature variants ⋮ Stronger bounds on the cost of computing Gröbner bases for HFE systems ⋮ On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations ⋮ Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP ⋮ Inverting square systems algebraically is exponential ⋮ Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic ⋮ Semi-regularity of pairs of Boolean polynomials ⋮ First fall degree and Weil descent ⋮ Quasi-subfield polynomials and the elliptic curve discrete logarithm problem ⋮ On the last fall degree of zero-dimensional Weil descent systems ⋮ The degree of regularity of a quadratic polynomial ⋮ Homological characterization of bounded \(\mathbb{F}_2\)-regularity ⋮ A multivariate cryptosystem inspired by random linear codes ⋮ On the first fall degree of summation polynomials ⋮ On the last fall degree of Weil descent polynomial systems ⋮ Recent Developments in Multivariate Public Key Cryptosystems ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes ⋮ Analysis of multivariate encryption schemes: application to Dob ⋮ Chosen ciphertext attack on ZHFE ⋮ Cryptanalysis of the lifted unbalanced oil vinegar signature scheme
Uses Software
This page was built for publication: Inverting HFE Systems Is Quasi-Polynomial for All Fields
