PQ-WB-KEM: White-Box ML-KEM-768 1.0
PQ-WB-KEM: Toward a White-Box Construction of ML-KEM-768 with Arithmetic Masking for M2M Communications - Mathematics (MDPI)
Loading...
Searching...
No Matches
Table Construction

Lookup table construction for the NTT-domain base multiply.

+ Collaboration diagram for Table Construction:

Lookup table construction for the NTT-domain base multiply.

The base multiply runs in the NTT domain, where the secret operand s_hat = NTT(s) is full-range over Z_q: the coefficient-domain smallness of s under the centered binomial distribution (eta=2) does not carry into the NTT domain, so the tables are q-indexed rather than indexed on a small value set. Two lookup-only constructions are built and verified against the reference base multiply across all 128 components and all three secret polynomials.

Constructions

Construction Table structure Secret Base Core
A (shared) one full multiply table M[x][y] = x*y mod q held as a program array 22.16 MB 25.57 MB
B (baked) per-component h tables with the secret baked in baked into table content 7.67 MB 11.08 MB

The core is the base tables plus the 3.41 MB output-encoding sublayer. The Construction-A table is k-independent; the Construction-B tables scale with the module rank k.

Storage Comparison

Approach Storage Practical
Naive full-pair tabulation ~368 TB per component No
Galissant-Goubin HFE 256 GB No
PQ-WB-KEM (Construction A) 22.16 MB base / 25.57 MB core Yes
PQ-WB-KEM (Construction B) 7.67 MB base / 11.08 MB core Yes

The measured base tables are about 11,600x (A) and 33,400x (B) smaller than the 2022 Galissant-Goubin HFE white-box.

Entry Count

The degree-2 extension structure reduces tabulation from the naive product of two coefficient pairs to q-indexed scalar tables:

\[ N = q = 3329 \text{ entries per table} \]

against the naive q^4 = 3329^4 approx 123 trillion entries for a full pair-by-pair tabulation.

Extraction Scope

The footprint is a deployment size and carries no security reading. Each baked table h[c] = s_hat * c is Z_q-linear in its public index, so a single read at any nonzero index returns s_hat by a modular inverse: the measured budget that regenerates the full Construction-B baked set bit-exactly is 1,536 bytes, and Construction A, whose shared table is a public function of q alone, is reproduced with no table read whatever. Neither budget grows with the tables.