Skip to main navigation Skip to search Skip to main content

HyperNTT: An Ultra-High Throughput Number Theoretic Transform Accelerator for FHE

  • Hunan University
  • Beijing Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

As the most computationally intensive operator in fully homomorphic encryption (FHE), the number theoretic transform (NTT) critically determines FHE's computational efficiency. In this paper, we propose HyperNTT, an ultra-high throughput NTT accelerator. Its conflict-free dataflow eliminates transposition overhead in the four-step NTT algorithm, while ping-pong buffering enables stall-free pipelined execution. We further introduce a low-cost FPGA-optimized Montgomery modular reduction circuit to minimize DSP usage without sacrificing frequency. Experiments show that HyperNTT outperforms comparable state-of-the-art designs, delivering up to a 130.2× improvement in throughput. Its overall performance, measured in area time product (ATP), is enhanced by 2.1× to 16.8×.

Original languageEnglish
Title of host publicationISCAS 2026 - 2026 IEEE International Symposium on Circuits and Systems
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2748-2752
Number of pages5
ISBN (Electronic)9798331577698
DOIs
Publication statusPublished - 2026
Event2026 IEEE International Symposium on Circuits and Systems, ISCAS 2026 - Shanghai, China
Duration: 24 May 202627 May 2026

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
ISSN (Print)0271-4310

Conference

Conference2026 IEEE International Symposium on Circuits and Systems, ISCAS 2026
Country/TerritoryChina
CityShanghai
Period24/05/2627/05/26

Keywords

  • Cryptography
  • FPGA
  • Hardware Accelerator
  • Number Theoretic Transform

Fingerprint

Dive into the research topics of 'HyperNTT: An Ultra-High Throughput Number Theoretic Transform Accelerator for FHE'. Together they form a unique fingerprint.

Cite this