Inverting HFE Is Quasipolynomial

DOI10.1007/11818175_20zbMath1161.94400OpenAlexW1602770810MaRDI QIDQ5756633

Louis Granboulan, Antoine Joux, Jacques Stern

Publication date: 4 September 2007

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

Full work available at URL: https://doi.org/10.1007/11818175_20

Mathematics Subject Classification ID

Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (14)

Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP ⋮ Inverting square systems algebraically is exponential ⋮ MI-T-HFE, A New Multivariate Signature Scheme ⋮ Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic ⋮ 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 ⋮ On the first fall degree of summation polynomials ⋮ Kipnis-Shamir Attack on HFE Revisited ⋮ 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 ⋮ On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack ⋮ Chosen ciphertext attack on ZHFE

This page was built for publication: Inverting HFE Is Quasipolynomial