[Resource Topic] 2023/830: HPPC: Hidden Product of Polynomial Composition

Welcome to the resource topic for 2023/830

Title:
HPPC: Hidden Product of Polynomial Composition

Authors: Borja Gomez Rodriguez

Abstract:

The article introduces HPPC a new Digital Signature scheme that intends to resist known previous attacks applied to HFE-based schemes like QUARTZ and GeMMS. The idea is to use maximal degree for the central HFE polynomial whereas the trapdoor polynomial has low degree in order to sign messages by finding polynomial roots in an extension field via Berlekamp’s algorithm. This work has been submitted to NIST’s Post-Quantum Cryptography challenge (PQC) and code is available at GitHub - kub0x/MPKC-HPPC

ePrint: https://eprint.iacr.org/2023/830

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .