Low-Complexity and High-Throughput Number Theoretic Transform Architecture for Polynomial Multiplication in Homomorphic Encryption

The computationally intensive of polynomial ring multiplication in homomorphic encryption (HE) schemes demand an optimized hardware accelerator design, specifically targeted for edge devices. The state-of-the-art algorithm for calculating polynomial ring multiplication is the Number Theoretic Transf...

Full description

Saved in:

Bibliographic Details
Published in:	2024 IEEE International Symposium on Circuits and Systems (ISCAS) pp. 1 - 5
Main Authors:	Sutisna, Nana, Brillianshah, Elkhan J., Syafalni, Infall, Hasanuddin, M. Ogin, Adiono, Trio, Juhana, Tutun
Format:	Conference Proceeding
Language:	English
Published:	IEEE 19-05-2024
Subjects:	Complexity theory Computer architecture Homomorphic Encryption (HE) Measurement Number Theoretic Transform (NTT) Architecture Polynomial Multiplication Polynomials Security Throughput Transforms
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The computationally intensive of polynomial ring multiplication in homomorphic encryption (HE) schemes demand an optimized hardware accelerator design, specifically targeted for edge devices. The state-of-the-art algorithm for calculating polynomial ring multiplication is the Number Theoretic Transform (NTT) which is capable of reducing the number of operations needed from the school book multiplication algorithm. In this work, we propose a novel NTT hardware accelerator design that is suitable for use in implementing a partially homomorphic encryption scheme with a 192-bit level of security. The main novelty presented in this paper is the realization of an area-efficient higher radix NTT and inverse NTT (INTT) accelerator which is achieved via mathematical optimization and a point-based approach to calculating NTT. Compared to previous works with similar throughput per slice metric, the design is able to deliver 5.16× higher throughput for a 2.46× increase in slice count.
ISSN:	2158-1525
DOI:	10.1109/ISCAS58744.2024.10557845