Apr 10, 2024 · Small technical update of the security proof: Following a comment of T. Hemmert, we did a small technical update in the IND-CPA security proof of HQC and definitions of hard …

Mar 12, 2025 · This repository contains comprehensive documentation on implementing the Hamming Quasi-Cyclic (HQC) post-quantum cryptography algorithm with a focus on side …

We now prove the IND-CPA security of HQC-β under the hardness assumption that 2-DQCSD with a variable weight problem and 3-DQCSD with a variable weight problem are hard.

Jul 30, 2025 · It describes the mathematical foundations of code-based cryptography, the detailed construction of HQC, the underlying computational problem of syndrome decoding in quasi …

Sep 1, 2018 · The underlying hard mathematical problem of HQC is presented as the s -DQCSD (Decision Quasi-Cyclic Syndrome Decoding) problem, which refers to the question of …

HQC (H amming Q uasi- C yclic) is a code-based Key Encapsulation Mechanism (KEM) whose security is based on the hardness of solving the Quasi-Cyclic Syndrome Decoding (QCSD) …

Mar 21, 2025 · HQC is a key encapsulation mechanism (KEM) based on code theory, and more particularly on the hardness of the well-known syndrome decoding problem in the specific …

Jan 5, 2025 · Cryptography based on the presumed hardness of decoding codes -- i.e., code-based cryptography -- has recently seen increased interest due to its plausible security against …

Several papers improved the hardware implementation of HQC. These papers are closing the gap between HQC and lattice-based cryptosystems such as Kyber, positioning HQC as a …

May 12, 2025 · Unlike FIPS 203, the HQC algorithm is not based on lattice theory but on a different hard problem. As a KEM, the HQC algorithm serves as both a complement and an …