Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
type: Item
instance of: scholarly article
title: Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
zbMATH Open document ID: 1307.13031
author: Luk Bettale
author: Jean-Charles Faugère
author: Ludovic Perret
published in: Designs, Codes and Cryptography
publication date: 2013-07-26T00:00:00Z
full work available at URL: MAYA2-UPMCINRIA-v1-key recovery on HFE 2.0.pdf
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 6192137
zbMATH Keywords: hidden field equations
zbMATH Keywords: minrank
zbMATH Keywords: Gröbner bases
describes a project that uses: FGb
describes a project that uses: Magma
MaRDI profile type: Publication
OpenAlex ID: W2093643075
Wikidata QID: Q114226851
cites work: Q4305609
cites work: Hybrid approach for solving multivariate systems over finite fields
cites work: Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
cites work: 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''
cites work: The Magma algebra system. I: The user language
cites work: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
cites work: 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
cites work: The computational complexity of some problems of linear algebra
cites work: An inequality for Hilbert series of graded algebras.
cites work: SSE Implementation of Multivariate PKCs on Modern x86 CPUs
cites work: Q4474187
cites work: Q2707400
cites work: A probabilistic remark on algebraic program testing
cites work: Inverting HFE Systems Is Quasi-Polynomial for All Fields
cites work: Algebraic Attack on HFE Revisited
cites work: The Degree of Regularity of HFE Systems
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Q4660688
cites work: Advances in Cryptology - CRYPTO 2003
cites work: FGb: A Library for Computing Gröbner Bases
cites work: Cryptanalysis of MinRank
cites work: Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
cites work: Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
cites work: On the complexity of the generalized MinRank problem
cites work: Q4198056
cites work: Inverting HFE Is Quasipolynomial
cites work: Kipnis-Shamir Attack on HFE Revisited
cites work: Q4941844
cites work: Unbalanced Oil and Vinegar Signature Schemes
cites work: Q3803032
cites work: A public key system with signature and master key functions
cites work: Q4343439
cites work: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Public Key Cryptography - PKC 2005
cites work: Progress in Cryptology – Mycrypt 2005
cites work: Equivalent keys in ℳultivariate uadratic public key systems
cites work: Q3851616
DOI: 10.1007/S10623-012-9617-2
description: scientific article; zbMATH DE number 6192137