{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:58:51Z","timestamp":1746593931619,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447734"},{"type":"electronic","value":"9783662447741"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44774-1_14","type":"book-chapter","created":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T12:50:47Z","timestamp":1412686247000},"page":"169-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["High-Speed Fully Homomorphic Encryption Over the Integers"],"prefix":"10.1007","author":[{"given":"Xiaolin","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ciara","family":"Moore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1ire","family":"O\u2019Neill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Hanley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009). http:\/\/crypto.stanford.edu\/craig","DOI":"10.1145\/1536414.1536440"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings the 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M van Dijk","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully Homomorphic Encryption over the Integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"NP Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 420\u2013443. Springer, Heidelberg (2010)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-20465-4_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"C Gentry","year":"2011","unstructured":"Gentry, C., Halevi, S.: Implementing gentry\u2019s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129\u2013148. Springer, Heidelberg (2011)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C, Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. Cryptology ePrint Archive, Report 2011\/277 (2011)","DOI":"10.1145\/2090236.2090262"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-22792-9_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J-S Coron","year":"2011","unstructured":"Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 487\u2013504. Springer, Heidelberg (2011)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-642-29011-4_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"J-S Coron","year":"2012","unstructured":"Coron, J.-S., Naccache, D., Tibouchi, M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 446\u2013464. Springer, Heidelberg (2012)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical? Cryptology ePrint Archive, Report 2011\/405 (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. Cryptology ePrint Archive, Report 2012\/099 (2012)","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Wang, W., Hu, Y., Chen, L. Huang, X., Sunar, B.: Accelerating fully homomorphic encryption using GPU. In: High Performance Extreme Computing Conference 2012, pp. 1\u20135, IEEE (2012)","DOI":"10.1109\/HPEC.2012.6408660"},{"issue":"3","key":"14_CR13","first-page":"281","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle multiplikation grosser Zahlen. Computing (Springer) 7(3), 281\u2013292 (1971)","journal-title":"Computing (Springer)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-47721-7_24","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"P Barrett","year":"1987","unstructured":"Barrett, P.: Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital Signal Processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311\u2013323. Springer, Heidelberg (1987)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Cousins, D.B., Rohloff, K., Peikert, C., Schantz, R.: SIPHER: scalable implementation of primitives for homomorphic encryption - FPGA implementation using Simulink. In: IEEE High Performance Extreme Computing Conference (2011)","DOI":"10.1109\/HPEC.2012.6408672"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Cousins, D.B., Rohloff, K., Peikert, C., Schantz, R.: SIPHER: An update on SIPHER (Scalable Implementation of Primitives for Homomorphic EncRyption) - FPGA implementation using Simulink. In: IEEE Conference on High Performance Extreme Computing, pp. 1\u20135 (2012)","DOI":"10.1109\/HPEC.2012.6408672"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Dor\u00f6z, Y., \u00d6zt\u00fcrk, E., Sunar, B.: Evaluating the Hardware Performance of a Million-Bit Multiplier. In:Digital System Design, pp. 955\u2013962 (2013)","DOI":"10.1109\/DSD.2013.108"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Wang, W., Huang, X.: FPGA implementation of a large-number multiplier for fully homomorphic encryption. In: International Symposium on Circuits and Systems, pp. 2589\u20132592 (2013)","DOI":"10.1109\/ISCAS.2013.6572408"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Dor\u00f6z, Y., \u00d6zt\u00fcrk, E., Sunar, B.: Accelerating Fully Homomorphic Encryption in Hardware. Under review. http:\/\/ecewp.ece.wpi.edu\/wordpress\/vernam\/files\/2013\/09\/Accelerating-Fully-Homomorphic-Encryption-in-Hardware.pdf","DOI":"10.1109\/TC.2014.2345388"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-38348-9_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"JH Cheon","year":"2013","unstructured":"Cheon, J.H., Coron, J.-S., Kim, J., Lee, M.S., Lepoint, T., Tibouchi, M., Yun, A.: Batch fully homomorphic encryption over the integers. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 315\u2013335. Springer, Heidelberg (2013)"},{"key":"14_CR21","unstructured":"Cao, X., Moore, C., O\u2019Neill, M., O\u2019Sullivan, E., Hanley, N.: Accelerating fully homomorphic encryption over the integers with super-size hardware multiplier and modular reduction. Cryptology ePrint Archive, Report 2013\/616 (2013)"},{"key":"14_CR22","unstructured":"Craven, S., Patterson, C., Athanas, P.: Super-sized multiplies: how do FPGAs fare in extended digit multipliers?. In: 7th International Conference on Military and Aerospace Programmable Logic Devices (2004)"},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S0129626411000266","volume":"21","author":"N Emmart","year":"2011","unstructured":"Emmart, N., Weems, C.: High precision integer multiplication with a GPU using Strassen\u2019s algorithm with multiple FFT sizes. Parallel Process. Lett. 21(3), 359\u2013375 (2011)","journal-title":"Parallel Process. Lett."},{"key":"14_CR24","unstructured":"GMP, The GNU Multiple Precision Arithmetic Library [Online]. Multiplication Algorithms. http:\/\/gmplib.org\/manual\/Multiplication-Algorithms.html"},{"key":"14_CR25","unstructured":"Xilinx Product Specification: LogiCORE IP Multiplier v11.2. http:\/\/www.xilinx.com\/support\/documentation\/ip-documentation\/mult-gen-ds255.pdf"},{"issue":"170","key":"14_CR26","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P Montgomery","year":"1985","unstructured":"Montgomery, P.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"14_CR27","unstructured":"Kalach, K., David, J.P.: Hardware implementation of large number multiplication by FFT with modular arithmetic. In: 3rd International IEEE-NEWCAS Conference, pp. 267\u2013270 (2005)"},{"key":"14_CR28","unstructured":"Solinas, J.A.: Generalized Mersenne Numbers. Issue 39 of Research report, University of Waterloo. Faculty of Mathematics (1999)"},{"key":"14_CR29","unstructured":"Dhem, J.F.: Design of an efficient public-key cryptographic library for RISC-based smart cards. Ph.D thesis, Universit\u00e9 catholique de Louvain (1998). http:\/\/users.belgacom.net\/dhem\/these\/"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Zimmermann, R.: Efficient VLSI implementation of modulo ($$2^n \\pm 1$$) addition and multiplication. In: IEEE Symposium on Computer Arithmetic, pp. 158\u2013167 (1999)","DOI":"10.1109\/ARITH.1999.762841"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44774-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T01:33:22Z","timestamp":1746408802000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44774-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447734","9783662447741"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44774-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}