Name
Title | ||
|---|---|---|
Breaking the Hardness Assumption and IND-CPA Security of HQC Submitted to NISTPQC Project |
Abstract | ||
|---|---|---|
Hamming quasi-cyclic (HQC) cryptosystem, proposed by Aguilar Melchor et al., is a code-based key encapsulation mechanism (KEM) submitted for the NIST standardisation process of post-quantum cryptography (PQC). Under the assumption that the s-decision quasi-cyclic syndrome decoding (s-DQCSD) problem is hard for s = 2 and 3, HQC, viewed as a public-key encryption scheme, is proven to be indistinguis... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1049/iet-ifs.2019.0214 | IET Information Security |
Keywords | DocType | Volume |
computational complexity,cyclic codes,decoding,optimisation,public key cryptography,quantum cryptography | Journal | 14 |
Issue | ISSN | Citations |
3 | 1751-8709 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhen Liu | 1 | 1 | 1.05 |
| Yanbin Pan | 2 | 35 | 13.29 |
| Tianyuan Xie | 3 | 0 | 3.38 |