Hidden Field Equations

Hidden Field Equations

Hidden Fields Equations, commonly abbreviated to HFE, is a public key cryptosystem. HFE uses polynomial operations over finite fields. It was proposed by Jacques Patarin at Eurocrypt 96 following the ideas of Matsumoto and Imai. It has long been regarded as the most promising cryptosystem of the kind.fact|date=June 2007 Some advanced attacks were discovered on HFE, none of them has been devastating, however.fact|date=June 2007 HFE is very fast in encryption and produces short digital signatures. It is much less studied than the RSA. HFE has been patented by Jacques Patarin. The patent expires on July 24 2016.

External links

* [http://www.minrank.org/hfe/ Nicolas Courtois HFE page]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Hidden Field Equations — HFE, pour Hidden Field Equation désigne un algorithme asymétrique de cryptographie à clé publique. Il s agit en fait d un type d algorithmes, basés sur les opérations polynomiales sur les corps fini. Il a été proposé par Jacques Patarin à la… …   Wikipédia en Français

  • Hidden Field Equation — Hidden Field Equations HFE, pour Hidden Field Equation désigne un algorithme asymétrique de cryptographie à clé publique. Il s agit en fait d un type d algorithmes, basés sur les opérations polynomiales sur les corps fini. Il a été proposé par… …   Wikipédia en Français

  • Zero-point field — In quantum field theory, the zero point field is the lowest energy state of a field, i.e. its ground state, which is non zero. [cite book | last = Gribbin | first = John | title = Q is for Quantum An Encyclopedia of Particle Physics | publisher …   Wikipedia

  • HFE — Hidden Field Equations HFE, pour Hidden Field Equation désigne un algorithme asymétrique de cryptographie à clé publique. Il s agit en fait d un type d algorithmes, basés sur les opérations polynomiales sur les corps fini. Il a été proposé par… …   Wikipédia en Français

  • Multivariate cryptography — is the generic term for asymmetric cryptographic primitives based on multivariate polynomials over finite fields. In certain cases those polynomials could be defined over both a ground and an extension field. If the polynomials have the degree… …   Wikipedia

  • Multivariate Cryptography — is the generic term for asymmetric cryptographic primitives based on multivariate polynomials over finite fields. In certain cases those polynomials could be defined over both a ground and an extension field. If the polynomials have the degree… …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • XSL attack — In cryptography, the XSL attack is a method of cryptanalysis for block ciphers. The attack was first published in 2002 by researchers Nicolas Courtois and Josef Pieprzyk. It has caused some controversy as it was claimed to have the potential to… …   Wikipedia

  • Advanced Encryption Standard — AES Der Substitutionschritt, einer von 4 Teilschritten pro Runde Entwickler Joan Daemen, Vincent Rijmen Veröffentlicht 1998, Zertifizierung Oktober 2000 Abgeleitet …   Deutsch Wikipedia

  • HFE — could refer to:* In genetics, the HFE gene, * In semiconductor device physics, hFE stands for the small signal Forward Current Gain of a bipolar junction transistor, * in mathematics, a public key algorithm known as the Hidden Field Equations… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”