A unified and resource-efficient polynomial multiplication architecture for fully homomorphic encryption
Authors:
- Junbin QiuJQJunbin Qiu
- Ruwei HuangRHRuwei Huang
- Jiang ShenJSJiang Shen
- Bin LinBLBin Lin
Open Access
- 30 March 2026
- journal article
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 38 (5)
Abstract
No abstract availableFunding Information
- Guangxi Key Research and Development Program (AB24010340)
- National Natural Science Foundation of China (62062009)
This publication has 31 references indexed in Scilit:
- Hardware efficient arithmetic reconfigurable fully homomorphic encryption (ARFHE) accelerator of low power IoT based RISC-V processorAnalog Integrated Circuits and Signal Processing, 2025
- A flexible efficient and configurable number theoretic transform architecture implemented on FPGAJournal of Cryptographic Engineering, 2025
- VLSI Design and FPGA Implementation of an NTT Hardware Accelerator for Homomorphic SEAL-Embedded LibraryIEEE Access, 2023
- TensorFHE: Achieving Practical Computation on Encrypted Data Using GPGPU2023
- CoHA-NTT: A Configurable Hardware Accelerator for NTT-based Polynomial MultiplicationMicroprocessors and Microsystems, 2022
- TFHE: Fast Fully Homomorphic Encryption Over the TorusJournal of Cryptology, 2019
- Homomorphic Encryption for Arithmetic of Approximate Numbers2017
- NFLlib: NTT-Based Fast Lattice Library2016
- Algorithms in HElib2014
- The fast Fourier transform in a finite fieldMathematics of Computation, 1971