Paper 2023/830 Original: eprint.iacr.org/2023/830 ↗
HPPC: Hidden Product of Polynomial Composition
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 GeMSS. 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 https://github.com/kub0x/MPKC-HPPC
Metadata
- Available format(s)
PDF- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- History
- 2023-06-06: last updated
- 2023-06-04: published
- Short URL
- https://ia.cr/2023/830
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/830,
author = {Borja Gomez Rodriguez},
title = {HPPC: Hidden Product of Polynomial Composition},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/830},
year = {2023},
url = {https://eprint.iacr.org/2023/830}
}