Skip to content
Open access

From Multiplication to Recovery: A Single-trace Side-Channel Attack on HQC

Sep 2026 · IACR Trans. Cryptogr. Hardw. Embed. Syst. · Vol 2026, pp. 890-916 · 0 citations · 43 references
Computer Science

TL;DR

This work presents a comprehensive Soft-Analytical Side-Channel Attack (SASCA) targeting the implementation of the iterative Karatsuba algorithm, and presents the optimized factor graph and algorithm tailored to the binary values and sparsity of HQC to make the SASCA more practical.

Abstract

Hamming Quasi-Cyclic (HQC) has been selected by NIST as a standard for code-based Post-Quantum Cryptography (PQC) Key Encapsulation Mechanisms (KEMs). While HQC offers robust theoretical security based on the Decisional Quasi- Cyclic Syndrome Decoding problem, its physical implementation is vulnerable to side-channel attacks. Previous research has predominantly focused on vulnerabilities during the decoding stage. However, the Karatsuba polynomial multiplication in the latest HQC specifications has not been thoroughly analyzed. In this work, we present a comprehensive Soft-Analytical Side-Channel Attack (SASCA) targeting the implementation of the iterative Karatsuba algorithm. We present the optimized factor graph and algorithm tailored to the binary values and sparsity of HQC to make the SASCA more practical. Furthermore, we introduce a joint recovery framework that combines the leakage of polynomial multiplication with the leakage of decoder using valid ciphertexts. We demonstrate the efficiency of our attack against the reference implementation and extend our attack to the Liboqs library, achieving a high success rate even in the presence of high noise levels.

Read PDF

Similar papers

Revisiting Simple Power Analysis of Polynomial Multiplication in the HQC Implementation

This work revisits the side-channel resistance of the latest HQC reference implementation, with a focus on its polynomial multiplication routine used in decryption, and proposes a zero-cost mitigation based on swapping operand roles so that the mask computation depends only on public data.

Trevor Yap, X. −574, Shivam Bhasin et al. · 0 citations

Design and Analysis of Four-State Quantum Public-Key Encryption Scheme

This paper analyzes the four-state QPKE scheme of Liu et al. and shows that its ciphertext structure leaks information about computational-basis plaintexts, and proposes sQPKE, a simple quantum public-key encryption scheme that uses only elementary operations.

Rahul Kumar, Vikas Srivastava · 0 citations
2026

Multi-Instance Security Degradation of Code-Based KEMs

It is shown that in a BIKE multi-instance setting an attacker can construct a DOOM instance with nM syndromes, and multi-instance security of code-based KEMs degrades as a function of M.

Alexander May, Gabriel Sá Diogo · 0 citations
Preprint Aug 2026

A Lightweight Fault-Detection Scheme for Barrett Modular Multiplication Using Multiple Conditional Reduction Paths

A Statistical Reduction Monitoring (SRM) method is employed to protect the BM M unit against such adversarial conditions, which incurs minimal hardware overhead while providing efficient detection of both random and deliberate faults in PQC and FHE infrastructures.

Rourab Paul, Paresh Baidya, Krishnendu Guha et al. · 0 citations

Less Than a Bit to Rule Them All – Key Recovery from Randomness Leakage in ML-DSA

It is shown that not all leaky signatures carry information about the secret subkey, and the notion of informative signature relations is introduced, which allows us to define a preprocessing step, called filter-and-shift that leads to ILWE instances that require a smaller sample amount.

Simon Damm, Nicolai Kraus, Alexander May et al. · 1 citation · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.