Accelerating fully homomorphic encryption using GPU

2012 IEEE Conference on High Performance Extreme Computing, HPEC 2012

Volumn , Issue , 2012, Pages

  Wang, Wei ^a   Hu, Yin ^a   Chen, Lianmu ^a   Huang, Xinming ^a   Sunar, Berk ^a  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

fully homomorphic encryption; GPU; large number modular multiplication

Indexed keywords

ARBITRARY FUNCTIONS; ARITHMETIC OPERATIONS; BARRETT MODULAR REDUCTIONS; ENCRYPTED DATA; EXPERIMENTAL STUDIES; FULLY HOMOMORPHIC ENCRYPTION; GPU; GRAPHICS PROCESSING UNIT; MASSIVE PARALLELISM; MODULAR MULTIPLICATION; MODULAR REDUCTION; SPEED-UP FACTORS; TIME-CONSUMING TASKS;

ALGORITHMS; COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; GENERAL PURPOSE COMPUTERS; PROGRAM PROCESSORS;

CRYPTOGRAPHY;

EID: 84873549758     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPEC.2012.6408660     Document Type: Conference Paper

References (18)

1. C. Gentry, "Fully homomorphic encryption using ideal lattices," in Proceedings of the 41st annual ACM symposium on Theory of computing. ACM, 2009, pp. 169-178.
2. R. Rivest, L. Adleman, and M. Dertouzos, "On data banks and privacy homomorphisms," Foundations of secure computation, vol. 32, no. 4, pp. 169-178, 1978.
3. C. Gentry and S. Halevi, "Implementing Gentry's fully-homomorphic encryption scheme," Advances in Cryptology-EUROCRYPT 2011, pp. 129-148, 2011.
4. D. Cousins, K. Rohloff, C. Peikert, and R. Schantz, "SIPHER: Scalable implementation of primitives for homomorphic encryption-FPGA implementation using Simulink," High Performance Extreme Computing Conference, 2011.
5. X. Cui, Y. Chen, and H. Mei, "Improving performance of matrix multiplication and fft on gpu," in Parallel and Distributed Systems (ICPADS), 2009 15th International Conference on. IEEE, 2009, pp. 42-48.
6. N. Govindaraju, N. Raghuvanshi, and D. Manocha, "Fast and approximate stream mining of quantiles and frequencies using graphics processors," in Proceedings of the 2005 ACM SIGMOD international conference on Management of data. ACM, 2005, pp. 611-622. (Pubitemid 43038962)
7. J. Baladron Pezoa, D. Fasoli, and O. Faugeras, "Three applications of gpu computing in neuroscience," Computing in Science & Engineering, no. 99, pp. 1-1, 2011.
8. C. Gentry, "A fully homomorphic encryption scheme," Ph.D. dissertation, Stanford University, 2009.
9. A. Schonhage and V. Strassen, "Schnelle multiplikation grosser zahlen," Computing, vol. 7, no. 3, pp. 281-292, 1971.
10. N. Emmart and C. Weems, "High precision integer multiplication with a gpu using strassen's algorithm with multiple fft sizes," Parallel Processing Letters, vol. 21, no. 3, p. 359, 2011.
11. J. Solinas, "Generalized mersenne numbers," Technical Reports, 1999.
12. D. Bailey, "Ffts in external of hierarchical memory," in Proceedings of the 1989 ACM/IEEE conference on Supercomputing. ACM, 1989, pp. 234-242.
13. C. Mclvor, M. McLoone, and J. McCanny, "Fast montgomery modular multiplication and rsa cryptographic processor architectures," in Signals, Systems and Computers, 2003. Conference Record of the Thirty-Seventh Asilomar Conference on, vol. 1. IEEE, 2003, pp. 379-384.
14. A. Daly and W. Marnane, "Efficient architectures for implementing montgomery modular multiplication and rsa modular exponentiation on reconfigurable logic," in Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays. ACM, 2002, pp. 40-49.
15. P. Giorgi, T. Izard, A. Tisserand et al., "Comparison of modular arithmetic algorithms on gpus," 2009.
16. P. Montgomery, "Modular multiplication without trial division," Mathematics of computation, vol. 44, no. 170, pp. 519-521, 1985.
17. P. Barrett, "Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor," in Advances in Cryptology: CRYPTO 1986. Springer, 1987, pp. 311-323.
18. V. Shoup, "NTL: A library for doing number theory," 2001.