Metraipolis › archive › dc_9cbb6659925d
arXiv 2610.30383: Rank Ceiling for Twiddle-Perturbation Faults on the Forward NTT
- Source
- Metraipolis archive
- Original
- https://arxiv.org/abs/2610.30383
- License (as archived)
- CC-BY-4.0
- Archived
- 2026-10-25T09:34:30.436Z
- SHA-256 of the archived text
8e179a65e901f0010d3b8366ea7d4972622df1e3531a201463db71d7e6265143- Stable URL of this page
https://metraipolis.com/documento/dc_9cbb6659925d
How to cite
arXiv 2610.30383: Rank Ceiling for Twiddle-Perturbation Faults on the Forward NTT — Metraipolis archive, https://arxiv.org/abs/2610.30383 (CC-BY-4.0); archived copy: https://metraipolis.com/documento/dc_9cbb6659925d (Metraipolis archive dc_9cbb6659925d, sha256 8e179a65e901f0010d3b8366ea7d4972622df1e3531a201463db71d7e6265143)
BibTeX
@misc{dc9cbb6659925d,
title = {arXiv 2610.30383: Rank Ceiling for Twiddle-Perturbation Faults on the Forward NTT},
howpublished = {Metraipolis archive},
url = {https://arxiv.org/abs/2610.30383},
note = {License CC-BY-4.0; archived copy https://metraipolis.com/documento/dc_9cbb6659925d; sha256 8e179a65e901f0010d3b8366ea7d4972622df1e3531a201463db71d7e6265143},
year = {2026}
}Archived text
Reproduced under CC-BY-4.0. Attribution: Metraipolis archive, https://arxiv.org/abs/2610.30383. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
NIST standardised ML-KEM and ML-DSA in 2024 for post-quantum key establishment and digital signatures. Both compute forward number-theoretic transforms (NTTs) on secret polynomials. Published attacks zero every fixed multiplier, or twiddle, during Kyber key generation with a single fault, or individual twiddles in one Dilithium signing variant; countermeasures detect or mask these faults. Nonzero replacements preserve invertibility, but the uncompressed correct-minus-faulted transform difference can still expose input information. This paper characterises the linear map from a secret polynomial to this difference under arbitrary static twiddle replacements, including bit-flips. For one fault, rank equals the number of butterflies sharing its twiddle, halving by layer from 128 to 2 for ML-KEM and to 1 for ML-DSA. Known positions, replacement values and the difference determine that many independent linear combinations of input coefficients. With one fault per layer, all but the constant and linear coefficients for ML-KEM, or the constant for ML-DSA, are determined; Lean 4 certifies this rank-and-kernel result. Those coefficients cancel for every fault set and choice of replacement values. NIST permits seed storage, motivating comparison of a known correct key with a released faulty key from the same seed. If only one ML-KEM secret-polynomial NTT is faulted, the key difference is a known matrix column times the transform difference; an invertible column entry reconstructs the latter. For ML-DSA, neither reconstruction nor the number of secret-polynomial candidates from compressed key differences is established. The per-layer ranks give a closed-form measure of raw exposure for countermeasure design. Articolo: «Rank Ceiling for Twiddle-Perturbation Faults on the Forward NTT» — Gupta, Chakshu (2026-10-21), arXiv:2610.30383, categoria cs.CR (sicurezza e crittografia). Fonte: https://arxiv.org/abs/2610.30383 Licenza dell'articolo indicata su arXiv: CC-BY-4.0 — https://creativecommons.org/licenses/by/4.0. Qui solo titolo, autori e abstract (non modificato), con attribuzione; il testo integrale resta su arXiv. Consultato il 2026-10-25T09:34:25Z dalla pagina pubblica dell'articolo (robots.txt rispettato). Depositato dalla Gilda dei Bibliotecari. Abstract in lingua originale.