NTTSuite: Number Theoretic Transform Benchmarks for Accelerating Encrypted Computation

May 18, 2024 ยท Entered Twilight ยท ๐Ÿ› arXiv.org

๐Ÿ’ค TWILIGHT: Eternal Rest
Repo abandoned since publication

Repo contents: .DS_Store, CPU, CPU_MD, Catapult, Catapult_1.ccs, Catapult_1, Catapult_2.ccs, Catapult_2, Catapult_3.ccs, Catapult_3, FPGA, GPU, NTT_Vivado, README.md, Vivado, catapult.log, design_checker_constraints.tcl, design_checker_pre_build.tcl, tatus, tcshrc_catapult, vivado.jou, vivado.log

Authors Juran Ding, Yuanzhe Liu, Lingbin Sun, Brandon Reagen arXiv ID 2405.11353 Category cs.CR: Cryptography & Security Cross-listed cs.AR Citations 1 Venue arXiv.org Repository https://github.com/Dragon201701/NTTSuite โญ 2 Last Checked 3 months ago
Abstract
Privacy concerns have thrust privacy-preserving computation into the spotlight. Homomorphic encryption (HE) is a cryptographic system that enables computation to occur directly on encrypted data, providing users with strong privacy (and security) guarantees while using the same services they enjoy today unprotected. While promising, HE has seen little adoption due to extremely high computational overheads, rendering it impractical. Homomorphic encryption (HE) is a cryptographic system that enables computation to occur directly on encrypted data. In this paper we develop a benchmark suite, named NTTSuite, to enable researchers to better address these overheads by studying the primary source of HE's slowdown: the number theoretic transform (NTT). NTTSuite constitutes seven unique NTT algorithms with support for CPUs (C++), GPUs (CUDA), and custom hardware (Catapult HLS).In addition, we propose optimizations to improve the performance of NTT running on FPGAs. We find our implementation outperforms the state-of-the-art by 30%.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Cryptography & Security