Metraipolis › archive › dc_11b4ff3aa83a

Implementation and Evaluation of NTT Arithmetic for ML-KEM on a CGLA — arXiv:2609.28904

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.28904
License (as archived)
CC0-1.0
Archived
2026-10-08T04:51:03.314Z
SHA-256 of the archived text
e2095895700a6f79fb18c8c091ac1e496d0a8612048f82eaaddc8653acc7b544
Stable URL of this page
https://metraipolis.com/documento/dc_11b4ff3aa83a

How to cite

Implementation and Evaluation of NTT Arithmetic for ML-KEM on a CGLA — arXiv:2609.28904 — arXiv (en), https://arxiv.org/abs/2609.28904 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_11b4ff3aa83a (Metraipolis archive dc_11b4ff3aa83a, sha256 e2095895700a6f79fb18c8c091ac1e496d0a8612048f82eaaddc8653acc7b544)
BibTeX
@misc{dc11b4ff3aa83a,
  title = {Implementation and Evaluation of NTT Arithmetic for ML-KEM on a CGLA — arXiv:2609.28904},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.28904},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_11b4ff3aa83a; sha256 e2095895700a6f79fb18c8c091ac1e496d0a8612048f82eaaddc8653acc7b544},
  year = {2026}
}

Archived text

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

FIPS 203 standardizes ML-KEM for post-quantum key establishment. Its polynomial multiplication relies on NTT butterflies with exact modular arithmetic over q = 3329. Dedicated NTT accelerators minimize latency with fixed modular arithmetic and stage schedules. A CPU-Grounded Linear Array (CGLA) reuses one programmable linear datapath across several workloads. Mapping the transform to this datapath requires exact FP32 reconstruction and explicit stage transitions across the ARM-to-CGLA interface. We implement an eight-stage cyclic radix-2 driver over the ML-KEM modulus by splitting each twiddle into 8-bit and 4-bit parts before modular reduction. This driver differs from the standardized seven-layer incomplete negacyclic NTT and does not implement the full ML-KEM polynomial multiplication path. The arithmetic sequence keeps every integer below 2^24. One 41-PE call fuses the first two radix-2 stages, and six 47-PE calls execute the remaining stages while scattering outputs into next-stage records. Across four cohorts, 105 FPGA runs match all 817152 output coefficients. At batch size 64, measured FPGA end-to-end latency is 27.5 us per NTT, and the ASIC projection is 6.74 us. With PE gating, projected ASIC system energy is 10.1 uJ per NTT at batch size 8 and 58.9 uJ at batch size 64.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-25 in cs.AR).
Categorie arXiv: Hardware Architecture (cs.AR).
Pagina del lavoro: https://arxiv.org/abs/2609.28904 — 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-08T04:28:37.293Z dalla pagina https://arxiv.org/catchup/cs.AR/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).