Inverting HFE Is Quasipolynomial
From MaRDI portal
Recommendations
Cited in
(29)- Key recovery attack for all parameters of \(\mathrm{HFE}^-\)
- On the last fall degree of zero-dimensional Weil descent systems
- On the first fall degree of summation polynomials
- On the last fall degree of Weil descent polynomial systems
- Cryptanalysis of the extension field cancellation cryptosystem
- An algebraic attack on rank metric code-based cryptosystems
- Security analysis via algebraic attack against ``a new encryption scheme for multivariate quadratic system
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
- On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations
- Inverting square systems algebraically is exponential
- On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack
- Chosen ciphertext attack on ZHFE
- scientific article; zbMATH DE number 2127876 (Why is no real title available?)
- Last fall degree, HFE, and Weil descent attacks on ECDLP
- MI-T-HFE, a new multivariate signature scheme
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
- Cryptanalysis of two quartic encryption schemes and one improved MFE scheme
- An Efficient Provable Distinguisher for HFE
- Cryptanalysis of MinRank
- Kipnis-Shamir Attack on HFE Revisited
- Cryptanalysis of the Square cryptosystems
- First fall degree and Weil descent
- On the Security of HFE, HFEv- and Quartz
- Recent developments in multivariate public key cryptosystems
- Inverting HFE systems is quasi-polynomial for all fields
- Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions
- Advances in Cryptology - CRYPTO 2003
- Last fall degree of semilocal polynomial systems
- On semi-local decomposition
This page was built for publication: Inverting HFE Is Quasipolynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756633)
