Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
From MaRDI portal
(Redirected from Publication:356715)
Recommendations
Cites work
- scientific article; zbMATH DE number 1583768 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 1030996 (Why is no real title available?)
- scientific article; zbMATH DE number 2081078 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- A new efficient algorithm for computing Gröbner bases (F₄)
- A probabilistic remark on algebraic program testing
- A public key system with signature and master key functions
- Advances in Cryptology - CRYPTO 2003
- Algebraic Attack on HFE Revisited
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An inequality for Hilbert series of graded algebras.
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Comments on the translation of my PhD thesis: ``An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Cryptanalysis of MinRank
- Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
- Equivalent keys in Multivariate Quadratic public key systems
- FGb: A Library for Computing Gröbner Bases
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Hybrid approach for solving multivariate systems over finite fields
- Inverting HFE Is Quasipolynomial
- Inverting HFE systems is quasi-polynomial for all fields
- Kipnis-Shamir Attack on HFE Revisited
- On the complexity of the generalized MinRank problem
- Progress in Cryptology – Mycrypt 2005
- Public Key Cryptography - PKC 2005
- Public Key Cryptography - PKC 2005
- SSE Implementation of Multivariate PKCs on Modern x86 CPUs
- The Magma algebra system. I: The user language
- The computational complexity of some problems of linear algebra
- The degree of regularity of HFE systems
- Unbalanced Oil and Vinegar Signature Schemes
Cited in
(52)- Total break of the SRP encryption scheme
- Boolean ring cryptographic equation solving
- A new multivariate primitive from CCZ equivalence
- A multivariate cryptosystem inspired by random linear codes
- Cryptanalysis of the Square cryptosystems
- A rank attack against extension field cancellation
- First fall degree and Weil descent
- All in the \(C^*\) family
- New practical multivariate signatures from a nonlinear modifier
- On the effect of projection on rank attacks in multivariate cryptography
- Efficient key recovery for all HFE signature variants
- Smaller public keys for MinRank-based schemes
- Advances in Cryptology - CRYPTO 2003
- MI-T-HFE, a new multivariate signature scheme
- A correct justification for the CHMT algorithm for solving underdetermined multivariate systems
- Differential Properties of the HFE Cryptosystem
- Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
- On the last fall degree of zero-dimensional Weil descent systems
- Cryptanalysis of HFE with Internal Perturbation
- High-rank attack on HMFEv
- Chosen ciphertext attack on ZHFE
- Public Key Cryptography - PKC 2005
- Algebraic Attack on HFE Revisited
- On the last fall degree of Weil descent polynomial systems
- Kipnis-Shamir Attack on HFE Revisited
- Two-Face: new public key multivariate schemes
- The complexity of MinRank
- The complexity of the SupportMinors Modeling for the MinRank problem
- A polynomial time key-recovery attack on the Sidon cryptosystem
- An improved signature model of multivariate polynomial public key cryptosystem against key recovery attack
- Efficient public-key operation in multivariate schemes
- On product decomposition
- A new encryption scheme for multivariate quadratic systems
- Improved cryptanalysis of HFERP
- Cryptanalysis of 2R− Schemes
- Cryptanalysis of the extension field cancellation cryptosystem
- Key recovery attack for all parameters of \(\mathrm{HFE}^-\)
- Last fall degree of semilocal polynomial systems
- Recent developments in multivariate public key cryptosystems
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Security analysis via algebraic attack against ``a new encryption scheme for multivariate quadratic system
- On semi-local decomposition
- DME: A Full Encryption, Signature and KEM Multivariate Public Key Cryptosystem
- A family of weak keys in HFE and the corresponding practical key-recovery
- Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
- Inverting HFE Is Quasipolynomial
- Cryptanalysis of two quartic encryption schemes and one improved MFE scheme
- An Efficient Provable Distinguisher for HFE
- Analysis of multivariate encryption schemes: application to Dob and C^*
- 2F -- a new method for constructing efficient multivariate encryption schemes
- Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow
- EFLASH: a new multivariate encryption scheme
This page was built for publication: Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356715)
