Information | |
---|---|
has gloss | eng: Hidden Fields Equations (commonly abbreviated as HFE) is a public key cryptosystem which was introduced at Eurocrypt in 1996 and proposed by Jacques Patarin following the idea of the Matsumoto and Imai system. HFE is also known as HFE trapdoor function. It is based on polynomials over finite fields \mathbbF}_q of different size to disguise the relationship between the private key and public key. HFE is in fact a family which consists of basic HFE and combinatorial versions of HFE. The HFE family of cryptosystems is based on the hardness of the problem of finding solutions to a system of multivariate quadratic equations (the so called MQ problem) since it uses private affine transformations to hide the extension field and the private polynomials. Hidden Field Equations also have been used to construct digital signature schemes, e.g. Quartz and Sflash. |
lexicalization | eng: Hidden Field Equations |
instance of | e/Finite field |
Meaning | |
---|---|
French | |
has gloss | fra: HFE, pour Hidden Field Equation désigne un algorithme asymétrique de cryptographie à clé publique. Il sagit en fait dun type d'algorithmes, basés sur les opérations polynomiales sur les corps fini. |
lexicalization | fra: Hidden Field Equations |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint