Metraipolis › archive › dc_ccca46c63039

Dependency-Aware ROM/CBD Correctness Bounds for ML-KEM-768 at the Heuristic Failure Scale — arXiv:2609.09983

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09983
License (as archived)
CC0-1.0
Archived
2026-10-16T07:54:42.656Z
SHA-256 of the archived text
117a90bfe0b36fc1928f65060b5e2bffb113b98def5004f670db9d1c02b82931
Stable URL of this page
https://metraipolis.com/documento/dc_ccca46c63039

How to cite

Dependency-Aware ROM/CBD Correctness Bounds for ML-KEM-768 at the Heuristic Failure Scale — arXiv:2609.09983 — arXiv (en), https://arxiv.org/abs/2609.09983 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ccca46c63039 (Metraipolis archive dc_ccca46c63039, sha256 117a90bfe0b36fc1928f65060b5e2bffb113b98def5004f670db9d1c02b82931)
BibTeX
@misc{dcccca46c63039,
  title = {Dependency-Aware ROM/CBD Correctness Bounds for ML-KEM-768 at the Heuristic Failure Scale — arXiv:2609.09983},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09983},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ccca46c63039; sha256 117a90bfe0b36fc1928f65060b5e2bffb113b98def5004f670db9d1c02b82931},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09983. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We certify an honest-decapsulation failure upper bound for ML-KEM-768 in an explicit random-function/centered-binomial (ROM/CBD) abstraction. Domain-separated public-matrix streams are modeled as independent uniform ring elements and secret/noise polynomials as independent CBD2 primitives; this is not an information-theoretic statement about the fixed SHAKE instantiation of FIPS 203. Recent formal assessments identify rigorous justification of ML-KEM's heuristic decapsulation-failure scale as an open problem; within the explicit ROM/CBD abstraction studied here, we obtain a dependency-preserving certified upper bound at that scale. The analysis preserves dependencies induced by the public matrix and by both ciphertext-compression terms. Its terminal chain has three components: an exact graph-coupled full-ideal reference for the joint c_u/c_v residual; a proper-ideal bivariate Fourier transport whose rare |T|>=3 branch is closed by an exhaustive three-factor anti-concentration replay; and exact bit-specific FIPS decoding events followed only by a 256-coordinate union bound. A formal partial-Fourier lemma makes the spectral-to-total-variation step explicit. The reduced rational certificate satisfies Pr[K' != K] <= P_* <= 2^-164.81, with -log2(P_*) = 164.810716201343121.... The 164.81 threshold is exact but numerically tight: the certified exponent exceeds it by only about 0.0007162 bit, and 164.82 is not certified. The result is an upper bound for an arbitrary message fixed independently of the public and secret randomness, under honest encryption and decapsulation. It is not an exact DFR, not a fixed-SHAKE equivalence theorem, not a new IND-CCA reduction, and not an adaptive delta-correctness result.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-10 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.09983 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T07:37:41.569Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).