Accelerating NTRU based Homomorphic Encryption using GPUs
Dept. of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, MA 01609
Cryptology ePrint Archive: Report 2014/389, 2014
@article{dai2014accelerating,
title={Accelerating NTRU based Homomorphic Encryption using GPUs},
author={Dai, Wei and Doroz, Yarkin and Sunar, Berk},
year={2014}
}
In this work we introduce a large polynomial arithmetic library optimized for Nvidia GPUs to support fully homomorphic encryption schemes. To realize the large polynomial arithmetic library we convert the polynomial with large coefficients using the Chinese Remainder Theorem into many polynomials with small coefficients, and then carry out modular multiplications in the residue space using a custom developed discrete Fourier transform library. We further extend the library to support the homomorphic evaluation operations, i.e. addition, multiplication, and relinearization, in an NTRU based somewhat homomorphic encryption library. Finally, we put the library to use to evaluate homomorphic evaluation of two block ciphers: Prince and AES, which show 2.57 times and 7.6 times speedup, respectively, over an Intel Xeon software implementation.
June 2, 2014 by hgpu
