The Security of Hidden Field Equations (HFE)

@inproceedings{Courtois2001TheSO,
  title={The Security of Hidden Field Equations (HFE)},
  author={Nicolas Courtois},
  booktitle={CT-RSA},
  year={2001}
}
We consider the basic version of the asymmetric cryptosystem HFE from Eurocrypt 96. We propose a notion of non-trivial equations as a tentative to account for a large class of attacks on one-way functions. We found equations that give experimental evidence that basic HFE can be broken in expected polynomial time for any constant degree d. It has been independently proven by Shamir and Kipnis [Crypto’99]. We designed and implemented a series of new advanced attacks that are much more efficient… CONTINUE READING
92 Citations
14 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 14 references

La sécurité des primitives cryptographiques basées sur les problèmes algébriques multivariables MQ, IP, MinRank, et HFE

  • Nicolas Courtois
  • PhD thesis,
  • 2001
10 Excerpts

Efficient Algorithms for solving Overdefined Systems of Multivariate Polynomial Equations

  • Nicolas Courtois, Adi Shamir, Jacques Patarin, Alexander Klimov
  • In Advances in Cryptology,
  • 2000
3 Excerpts

The Minrank problem. MinRank, a new Zero-knowledge scheme based on the NP-complete problem

  • Nicolas Courtois
  • Presented at the rump session of Crypto
  • 2000
3 Excerpts

La Cryptographie Multivariable; Mémoire d’habilitation

  • Jacques Patarin
  • à diriger des recherches de l’Université Paris
  • 1999
3 Excerpts

Public Quadratic Polynomialtuples for efficient signatureverification and messageencryption ”

  • Tsutomu Matsumoto, Hideki Imai
  • Hidden Monomial Cryptosystems ”
  • 1998

Similar Papers

Loading similar papers…