Skip to content
Open access

Constant-Time Symmetry Exploitation for NTT Twiddle Factors in ML-KEM: A Unified Cost Model for Embedded Deployments

2026 · Computers, Materials & Continua · Vol 88, pp. 1-10 · 1 citation · 32 references

TL;DR

A Memory-Arithmetic Trade-off model is developed that unifies ROM, random-access memory (RAM), latency, energy, and side-channel risk into one device-aware objective and supports hardware-aware strategy selection with explicit assumptions on threat model and constant-time scope.

Abstract

: The standardization of the Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM, FIPS 203) creates urgent demand for efficient post-quantum cryptography on resource-constrained devices. In such deployments, twiddle-factor management in the Number Theoretic Transform (NTT) induces a practical trade-off: full tables reduce latency but consume read-only memory (ROM), while on-the-fly generation reduces ROM but increases arithmetic cost. This paper makes two contributions. First, we present a constant-time half-table strategy ( S hal f ) with branchless reconstruction logic and a formal indexing rule consistent with implementation. Second, we develop a Memory-Arithmetic Trade-off (MAT) model that unifies ROM, random-access memory (RAM), latency, energy, and side-channel risk into one device-aware objective. On ARM Cortex-M4, the proposed strategy reduces twiddle-factor ROM by 50% with a cycle overhead of about 3%–6% vs. full-table lookup in the same C framework. We additionally report cross-platform measurements on RISC-V and x86, where empirical best-strategy outcomes match MAT predictions. The resulting framework supports hardware-aware strategy selection with explicit assumptions on threat model and constant-time scope.

Read PDF

Similar papers

Open access Aug 2026

PQ-WB-KEM: Toward a White-Box Construction of ML-KEM-768 with Arithmetic Masking for M2M Communications

Machine-to-machine and Internet of Things endpoints operate in physically accessible environments, motivating decapsulation-path hardening against an adversary with full code access. We present PQ-WB-KEM, a feasibility study that is, to our knowledge, the first systematic exploration of the table-based white-box design...

Uğur Coruh · 0 citations
Preprint Sep 2026

Implementation and Evaluation of NTT Arithmetic for ML-KEM on a CGLA

An eight-stage cyclic radix-2 driver over the ML-KEM modulus is implemented by splitting each twiddle into 8-bit and 4-bit parts before modular reduction, differs from the standardized seven-layer incomplete negacyclic NTT and does not implement the full ML-KEM polynomial multiplication path.

Takuto Ando, Yasuhiko Nakashima · 0 citations
Conference Aug 2026

A High-Speed and Low-Complexity NTT Hardware Architecture for CRYSTALS-Kyber

With the ongoing standardization of Post-Quantum Cryptography (PQC), polynomial multiplication in lattice-based cryptographic schemes has emerged as a critical performance bottleneck. The Number Theoretic Transform (NTT), as the core technique for accelerating such computations, plays a decisive role in determining the...

Qing-Xin Xie, Li-Ping Wang, Xiao Liu et al. · 0 citations
Book Open access Nov 2026

Too Small to Hide: Single-Trace Key Recovery from ML-KEM Key Generation

Key generation in ML-KEM (CRYSTALS-Kyber) samples a short secret from a centered binomial distribution (CBD) and immediately transforms it with the number-theoretic transform (NTT). Each execution draws fresh randomness, so an attacker obtains a single trace and cannot average. We show that one power trace of the optim...

V. Jahandideh · 0 citations

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