Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
From MaRDI portal
Publication:356715
DOI10.1007/s10623-012-9617-2zbMath1307.13031OpenAlexW2093643075WikidataQ114226851 ScholiaQ114226851MaRDI QIDQ356715
Luk Bettale, Jean-Charles Faugère, Ludovic Perret
Publication date: 26 July 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00776072/file/MAYA2-UPMCINRIA-v1-key_recovery_on_HFE_2.0.pdf
Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (27)
Efficient key recovery for all HFE signature variants ⋮ Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption ⋮ A Rank Attack Against Extension Field Cancellation ⋮ Boolean ring cryptographic equation solving ⋮ The Complexity of MinRank ⋮ MI-T-HFE, A New Multivariate Signature Scheme ⋮ All in the \(C^*\) family ⋮ Efficient public-key operation in multivariate schemes ⋮ First fall degree and Weil descent ⋮ On the last fall degree of zero-dimensional Weil descent systems ⋮ On product decomposition ⋮ Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow ⋮ 2F -- a new method for constructing efficient multivariate encryption schemes ⋮ EFLASH: a new multivariate encryption scheme ⋮ Total break of the SRP encryption scheme ⋮ A multivariate cryptosystem inspired by random linear codes ⋮ On the last fall degree of Weil descent polynomial systems ⋮ Cryptanalysis of the extension field cancellation cryptosystem ⋮ A new encryption scheme for multivariate quadratic systems ⋮ An improved signature model of multivariate polynomial public key cryptosystem against key recovery attack ⋮ Recent Developments in Multivariate Public Key Cryptosystems ⋮ Security analysis via algebraic attack against ``a new encryption scheme for multivariate quadratic system ⋮ High-rank attack on HMFEv ⋮ Chosen ciphertext attack on ZHFE ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case ⋮ New practical multivariate signatures from a nonlinear modifier ⋮ On the effect of projection on rank attacks in multivariate cryptography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of the generalized MinRank problem
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- A probabilistic remark on algebraic program testing
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The computational complexity of some problems of linear algebra
- The Magma algebra system. I: The user language
- 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
- 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
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Equivalent keys in ℳultivariate uadratic public key systems
- The Degree of Regularity of HFE Systems
- Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
- Hybrid approach for solving multivariate systems over finite fields
- Algebraic Attack on HFE Revisited
- Cryptanalysis of MinRank
- Kipnis-Shamir Attack on HFE Revisited
- SSE Implementation of Multivariate PKCs on Modern x86 CPUs
- An inequality for Hilbert series of graded algebras.
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- A public key system with signature and master key functions
- Unbalanced Oil and Vinegar Signature Schemes
- Inverting HFE Systems Is Quasi-Polynomial for All Fields
- Advances in Cryptology - CRYPTO 2003
- Progress in Cryptology – Mycrypt 2005
- Public Key Cryptography - PKC 2005
- Public Key Cryptography - PKC 2005
- FGb: A Library for Computing Gröbner Bases
- Inverting HFE Is Quasipolynomial
This page was built for publication: Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
