Skip to main content
Article thumbnail
Location of Repository

HFE and BDDs: A Practical Attempt at Cryptanalysis

By Jean-Francis Michon, Pierre Valarcher and Jean-Baptiste Yunès

Abstract

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

Topics: cryptanalysis, BDD, HFE, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Publisher: Birkhauser
Year: 2004
OAI identifier: oai:HAL:hal-00081338v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.