The Hidden Product of Polynomial Composition (HPPC) Digital Signature is multivariate-based cryptography using an HFE trapdoor. The HPPC scheme provides the technique for choosing the HFE central map. Its technique utilizes the product of the composition of two linearized polynomials. In this research, we proposed the modification of the HPPC scheme. We modify the HPPC scheme such that the scheme is based on HFEv. The linearized polynomial with vinegar variables will be chosen for constructing the central map. In our modification version, the public key becomes a system of polynomials of degree 4 and a map from n+v to n-dimension vector space. For a final remark, Despite an increase in the polynomial degree, HPPCv maintains a computational cost similar to HPPC.
Copyrights © 2025