Optimizing Systolic Array-Based NTT Accelerators

Lattice-based Post-quantum cryptography and Homomorphic Encryption schemes have become the key methodologies for today’s and the future’s secure world. This comes at the cost of a vastly increased computational load due to the multiplication of wide-integer coefficient polynomials. NIST recommends Number Theoretic Transform (NTT) as an efficient remedy. Nevertheless, NTT strongly requires acceleration for large numbers of coefficients. This paper explores the use of systolic arrays as NTT accelerators and finds an optimal hardware architecture configuration across problem sizes. Design-space exploration is performed, resulting in a new design configuration for an efficient two-dimensional NTT accelerator without losing the ability to execute other workloads. Our finding indicates that for 22 nm technology, an optimal systolic array accelerator requires an area of 53.04 mm2. The accelerator can efficiently execute and apply NTT on a polynomial with 4096 32-bit integer coefficients requiring 3296 cycles, and 1794.92 nJ.

Authors

Institutions

Publication Details

Journal
IEEE Embedded Systems Letters
Published
2025-04-22
DOI
https://doi.org/10.1109/les.2025.3562707
Citations
1
Primary Topic
Wireless Communication Networks Research
Type
article
Field-Weighted Citation Impact
1.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Systolic Array-Based NTT Accelerators

Saleh Mulhem, Mladen Bereković, Rainer Buchty, Lukas Groth et al.
1 citations
IEEE Embedded Systems Letters
Wireless Communication Networks Research
1.49
article

Optimizing Systolic Array-Based NTT Accelerators

Saleh Mulhem, Mladen Bereković, Rainer Buchty, Lukas Groth, Eike Schultz
article en
1 citations

Abstract

Lattice-based Post-quantum cryptography and Homomorphic Encryption schemes have become the key methodologies for today’s and the future’s secure world. This comes at the cost of a vastly increased computational load due to the multiplication of wide-integer coefficient polynomials. NIST recommends Number Theoretic Transform (NTT) as an efficient remedy. Nevertheless, NTT strongly requires acceleration for large numbers of coefficients. This paper explores the use of systolic arrays as NTT accelerators and finds an optimal hardware architecture configuration across problem sizes. Design-space exploration is performed, resulting in a new design configuration for an efficient two-dimensional NTT accelerator without losing the ability to execute other workloads. Our finding indicates that for 22 nm technology, an optimal systolic array accelerator requires an area of 53.04 mm2. The accelerator can efficiently execute and apply NTT on a polynomial with 4096 32-bit integer coefficients requiring 3296 cycles, and 1794.92 nJ.

IEEE Embedded Systems LettersVol. 18(1)
University of Lübeck (DE)
Bundesministerium für Bildung und Forschung
Affordable and clean energy
Openalex Percentile: Top 18%
Wireless Communication Networks Research
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.