Stronger bounds on the cost of computing Gröbner bases for HFE systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Stronger bounds on the cost of computing Gröbner bases for HFE systems

Abstract

We give upper bounds for the solving degree and the last fall degree of the polynomial system associated to the HFE (Hidden Field Equations) cryptosystem. Our bounds improve the known bounds for this type of systems. We also present new results on the connection between the solving degree and the last fall degree and prove that, in some cases, the solving degree is independent of coordinate changes.
Fichier principal
Vignette du fichier
11.pdf (250.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02912309 , version 1 (05-08-2020)

Identifiers

  • HAL Id : hal-02912309 , version 1

Cite

Elisa Gorla, Daniela Mueller, Christophe Petit. Stronger bounds on the cost of computing Gröbner bases for HFE systems. MEGA 2019 - International Conference on Effective Methods in Algebraic Geometry, Jun 2019, Madrid, Spain. ⟨hal-02912309⟩

Collections

MEGA MEGA2019
39 View
44 Download

Share

Gmail Facebook X LinkedIn More