HFE and BDDs: A Practical Attempt at Cryptanalysis - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

HFE and BDDs: A Practical Attempt at Cryptanalysis

Résumé

HFE (Hidden Field Equations) is a public key cryptosystem using univariate polynomials over finite fields. It was proposed by J. Patarin in 1996. Well chosen parameters during the construction produce a system of quadratic multivariate polynomials over GF(2) as the public key. An enclosed trapdoor is used to decrypt messages. We propose a ciphertext-only attack which mainly consists in satisfying a boolean formula. Our algorithm is based on BDDs (Binary Decision Diagrams), introduced by Bryant in 1986, which allow to represent and manipulate, possibly efficiently, boolean functions. This paper is devoted to some experimental results we obtained while trying to solve the Patarin's challenge. This approach was not successful, nevertheless it provided some interesting information about the security of HFE cryptosystem.

Mots clés

Fichier non déposé

Dates et versions

hal-00081338 , version 1 (22-06-2006)

Identifiants

  • HAL Id : hal-00081338 , version 1

Citer

Jean-Francis Michon, Pierre Valarcher, Jean-Baptiste Yunès. HFE and BDDs: A Practical Attempt at Cryptanalysis. 2004, pp.11. ⟨hal-00081338⟩
128 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More