Paper 2014/389

Accelerating NTRU based Homomorphic Encryption using GPUs

Wei Dai, Yarkın Doröz, and Berk Sunar

Abstract

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.

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
Homomorphic encryptionGPUsNTRUPrinceAES
Contact author(s)
sunar @ wpi edu
History
2014-05-30: received
Short URL
https://ia.cr/2014/389
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/389,
      author = {Wei Dai and Yarkın Doröz and Berk Sunar},
      title = {Accelerating {NTRU} based Homomorphic Encryption using {GPUs}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/389},
      year = {2014},
      url = {https://eprint.iacr.org/2014/389}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.