Papers by Jaiberth Porras Barrera
Lecture Notes in Computer Science, 2016
Let F be a finite field of size q, K a degree n field extension. An HFE polynomial has the form F... more Let F be a finite field of size q, K a degree n field extension. An HFE polynomial has the form F (X) = 0≤j≤i≤n a ij X q i +q j + n i=0
In this thesis we present a new method for building pairs of HFE polynomials of high degree, in s... more In this thesis we present a new method for building pairs of HFE polynomials of high degree, in such a way that the map constructed with this pair is easy to invert. The inversion is accomplished using a low degree polynomial of Hamming weight three, which is derived from a special reduction via Hamming weight three polynomials produced by these two HFE polynomials. This allows us to build new candidates for multivariate trapdoor functions in which we use the pair of HFE polynomials to fabricate the core map. Using this new multivariate trapdoor function we derive an encryption scheme in a similar way as the HFE scheme is created. We show that this encryption scheme is relatively efficient and that it resists the attacks that have threatened the security of HFE. Finally, we propose parameters for a practical implementation of our cryptosystem. 1HFE stands for Hidden Field Equations.
Uploads
Papers by Jaiberth Porras Barrera