# From Finite Enumeration to Universal Proof: Ring-Theoretic Foundations for PQC Hardware Masking Verification

Source: [From Finite Enumeration to Universal Proof: Ring-Theoretic Foundations for PQC Hardware Masking Verification](<https://www.sota2.com/research/paper/69e85bcb7d0172140ec8108e>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-04-24T05:00:14.774Z

Authors: Ray Iskander, Khaled Kirah

Published: 2026-04-20T18:17:22.000Z

## Abstract

Formal verification of masking in post-quantum cryptographic (PQC) hardware relies on SMT solvers over finite domains. Our prior work established structural dependency analysis at scale \[1\] and quantified the security margin of partial NTT masking \[2\]. QANARY, our structural dependency analysis framework, verified 1.17 million cells across 30 modules of the Adams Bridge ML-DSA/ML-KEM accelerator \[3, 4\], but its core soundness result (Theorem 3.9.1) was machine-checked only at $q = 5$ via $2^{25}$ Boolean wire functions. This left portability to ML-KEM ($q = 3{,}329$, FIPS 203 \[5\]) and ML-DSA ($q = 8{,}380{,}417$, FIPS 204 \[6\]) as an open gap. NIST IR 8547 \[7\] (March 2025) motivates closing such gaps. We present the first machine-checked universal proof of the $r$-free sub-theorem of Theorem 3.9.1: for every $q \> 0$, every wire function, and every pair of secrets, value-independence implies identical marginal distributions. The proof, in Lean 4 \[8\] with Mathlib \[9\], requires five lines versus $2^{25}$ finite evaluations. It is sorry-free, reducing the trusted base from {Z3 \[10\], CVC5 \[11\], Python} to the Lean 4 kernel. We provide nine theorems (T1--T6, T1', T3') covering reparametrization, bijectivity, overflow bounds, RNG bias, and a universal non-tightness counterexample for all $q \\geq 2$. The results establish commutative ring axioms of $\\mathbb{Z}/q\\mathbb{Z}$ as the natural abstraction layer for arithmetic masking verification.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Masking Verification on Barrett reduction over Zq](<https://www.sota2.com/research/sota/masking-verification-on-barrett-reduction-over-zq.md>): Masking Verification; Barrett reduction over Zq; Universal Score: 0.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2604.18717>)

[PDF](<https://arxiv.org/pdf/2604.18717.pdf>)
