Algebraic cryptanalysis of HFE and Filter Generators.

Jean-Charles Faugère 1
1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : HFE (Hidden Fields Equations) is a public key cryptosystem using polynomial operations over finite fields. It has been proposed by Jacques Patarin at Eurocrypt 96 following the ideas of Matsumoto and Imai. It has long been regarded as a very promising cryptosystem because it can be used to produce signatures as short as 128, 100 and even 80 bits. HFE gives the shortest (unbroken) signatures known except with the recent McEliece signature scheme. Without the secret univariate polynomial it is necessary to solve polynomial system of equations. One of the most efficient tool for solving algebraic system is Gröbner bases
keyword : grobner hfe
Type de document :
Communication dans un congrès
Cryptographic Research in Europe : Fourth NESSIE Workshop and Second STORK workshop 2003, 2003, Lund, Suède, pp.3, 2003
Liste complète des métadonnées

https://hal.inria.fr/inria-00107731
Contributeur : Publications Loria <>
Soumis le : jeudi 19 octobre 2006 - 09:07:11
Dernière modification le : jeudi 11 janvier 2018 - 06:20:00
Document(s) archivé(s) le : mercredi 29 mars 2017 - 13:18:34

Identifiants

  • HAL Id : inria-00107731, version 1

Collections

Citation

Jean-Charles Faugère. Algebraic cryptanalysis of HFE and Filter Generators.. Cryptographic Research in Europe : Fourth NESSIE Workshop and Second STORK workshop 2003, 2003, Lund, Suède, pp.3, 2003. 〈inria-00107731〉

Partager

Métriques

Consultations de la notice

75

Téléchargements de fichiers

26