Paper 2014/646
High-speed Polynomial Multiplication Architecture for Ring-LWE and SHE Cryptosystems
Donald Donglong Chen, Nele Mentens, Frederik Vercauteren, Sujoy Sinha Roy, Ray C. C. Cheung, Derek Pao, and Ingrid Verbauwhede
Abstract
Polynomial multiplication is the basic and most computationally intensive operation in ring-Learning With Errors (ring-LWE) encryption and ``Somewhat" Homomorphic Encryption (SHE) cryptosystems. In this paper, the Fast Fourier Transform (FFT) with a linearithmic complexity of
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Minor revision. IEEE Transactions on Circuits and Systems I
- DOI
- 10.1109/TCSI.2014.2350431
- Keywords
- CryptographyPolynomial multiplicationNumber theoretic transform (NTT)FFT Polynomial multiplicationRing-LWESHEPipelined architectureField-programmable gate array (FPGA)
- Contact author(s)
- donglongc @ gmail com
- History
- 2014-08-27: received
- Short URL
- https://ia.cr/2014/646
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/646, author = {Donald Donglong Chen and Nele Mentens and Frederik Vercauteren and Sujoy Sinha Roy and Ray C. C. Cheung and Derek Pao and Ingrid Verbauwhede}, title = {High-speed Polynomial Multiplication Architecture for Ring-{LWE} and {SHE} Cryptosystems}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/646}, year = {2014}, doi = {10.1109/TCSI.2014.2350431}, url = {https://eprint.iacr.org/2014/646} }