{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T09:29:27Z","timestamp":1743845367198,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T00:00:00Z","timestamp":1603756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T00:00:00Z","timestamp":1603756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s11265-020-01608-0","type":"journal-article","created":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T05:02:57Z","timestamp":1603774977000},"page":"643-656","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Ultra-Highly Parallel Polynomial Multiplier for the Bootstrapping Algorithm in a Fully Homomorphic Encryption Scheme"],"prefix":"10.1007","volume":"93","author":[{"given":"Weihang","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin M.","family":"Case","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gengran","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9413-2455","authenticated-orcid":false,"given":"Yingjie","family":"Lao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,27]]},"reference":[{"key":"1608_CR1","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Lauter, K., Loftus, J., & Naehrig, M. (2013). Improved security for a ring-based fully homomorphic encryption scheme. In IMA International conference on cryptography and coding (pp. 45\u201364): Springer.","DOI":"10.1007\/978-3-642-45239-0_4"},{"issue":"3","key":"1608_CR2","first-page":"13","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014). (leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT), 6(3), 13.","journal-title":"ACM Transactions on Computation Theory (TOCT)"},{"key":"1608_CR3","first-page":"616","volume":"2013","author":"X Cao","year":"2013","unstructured":"Cao, X., Moore, C., O\u2019Neill, M., O\u2019Sullivan, E., & Hanley, N. (2013). Accelerating fully homomorphic encryption over the integers with super-size hardware multiplier and modular reduction. IACR Cryptology ePrint Archive, 2013, 616.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"1608_CR4","unstructured":"Case, B.M., Gao, S., Hu, G., & Xu, Q. (2019). Fully homomorphic encryption with k-bit arithmetic operations. Cryptology ePrint Archive, Report 2019\/521. https:\/\/eprint.iacr.org\/2019\/521."},{"issue":"1","key":"1608_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TCSI.2014.2350431","volume":"62","author":"DD Chen","year":"2015","unstructured":"Chen, D.D., Mentens, N., Vercauteren, F., Roy, S.S., Cheung, R.C., Pao, D., & Verbauwhede, I. (2015). High-speed polynomial multiplication architecture for ring-LWE and SHE cryptosystems. IEEE Trans. on Circuits and Systems, 62(1), 157\u2013166.","journal-title":"IEEE Trans. on Circuits and Systems"},{"key":"1608_CR6","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., & Player, R. (2017). Simple encrypted arithmetic library-SEAL v2. 1. In International conference on financial cryptography and data security (pp. 3\u201318): Springer.","DOI":"10.1007\/978-3-319-70278-0_1"},{"key":"1608_CR7","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., & Song, Y. (2017). Homomorphic encryption for arithmetic of approximate numbers. In International conference on the theory and application of cryptology and information security (pp. 409\u2013437): Springer.","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"1608_CR8","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., & Izabach\u00e8ne, M. (2020). Tfhe: fast fully homomorphic encryption over the torus. Journal of Cryptology, 33(1), 34\u201391.","journal-title":"Journal of Cryptology"},{"key":"1608_CR9","doi-asserted-by":"crossref","unstructured":"Dai, W., & Sunar, B. (2015). cuhe: a homomorphic encryption accelerator library. In International conference on cryptography and information security in the balkans (pp. 169\u2013186): Springer.","DOI":"10.1007\/978-3-319-29172-7_11"},{"key":"1608_CR10","doi-asserted-by":"crossref","unstructured":"Dor\u00f6z, Y., \u00d6zt\u00fcrk, E., & Sunar, B. (2013). Evaluating the hardware performance of a million-bit multiplier. In 2013 euromicro conference on digital system design (DSD) (pp. 955\u2013962): IEEE.","DOI":"10.1109\/DSD.2013.108"},{"issue":"6","key":"1608_CR11","first-page":"1509","volume":"64","author":"Y Dor\u00f6z","year":"2015","unstructured":"Dor\u00f6z, Y., \u00d6zt\u00fcrk, E., & Sunar, B. (2015). Accelerating fully homomorphic encryption in hardware. IEEE Transactions on Computers, 64(6), 1509\u20131521.","journal-title":"IEEE Transactions on Computers"},{"key":"1608_CR12","doi-asserted-by":"crossref","unstructured":"Ducas, L., & Micciancio, D. (2015). FHEW: bootstrapping homomorphic encryption in less than a second. In Annual international conference on the theory and applications of cryptographic techniques (pp. 617\u2013640): Springer.","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"1608_CR13","first-page":"144","volume":"2012","author":"J Fan","year":"2012","unstructured":"Fan, J., & Vercauteren, F. (2012). Somewhat practical fully homomorphic encryption. IACR Cryptology ePrint Archive, 2012, 144.","journal-title":"IACR Cryptology ePrint Archive"},{"issue":"9","key":"1608_CR14","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1109\/TVLSI.2017.2691727","volume":"25","author":"X Feng","year":"2017","unstructured":"Feng, X., & Li, S. (2017). Design of an area-effcient million-bit integer multiplier using double modulus NTT. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 25(9), 2658\u20132662.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"issue":"1","key":"1608_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/TCSII.2018.2840108","volume":"66","author":"X Feng","year":"2018","unstructured":"Feng, X., & Li, S. (2018). Accelerating an FHE integer multiplier using negative wrapped convolution and ping-pong FFT. IEEE Transactions on Circuits and Systems II: Express Briefs, 66(1), 121\u2013125.","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"key":"1608_CR16","unstructured":"Gao, S. (2018). Efficient fully homomorphic encryption scheme. Cryptology ePrint Archive, Report 2018\/637. https:\/\/eprint.iacr.org\/2018\/637."},{"key":"1608_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., & Waters, B. (2013). Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In Advances in cryptology\u2013CRYPTO 2013 (pp. 75\u201392): Springer.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1608_CR18","unstructured":"Halevi, S., & Shoup, V. (2014). Bootstrapping for HElib. Cryptology ePrint Archive, Report 2014\/873. https:\/\/eprint.iacr.org\/2014\/873."},{"key":"1608_CR19","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., & Rosen, A. (2008). SWIFFT: A modest proposal for FFT hashing. In International workshop on fast software encryption (pp. 54\u201372): Springer.","DOI":"10.1007\/978-3-540-71039-4_4"},{"key":"1608_CR20","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., & Regev, O. (2010). On ideal lattices and learning with errors over rings. In Annual international conference on the theory and applications of cryptographic techniques (pp. 1\u201323): Springer.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"1608_CR21","doi-asserted-by":"crossref","unstructured":"Mert, A.C., \u00d6zt\u00fcrk, E., & Sava\u015f, E. (2019). Design and implementation of encryption\/decryption architectures for BFV homomorphic encryption scheme. IEEE Transactions on Very Large Scale Integration (VLSI) Systems.","DOI":"10.1109\/TVLSI.2019.2943127"},{"key":"1608_CR22","unstructured":"Naranjo, J., L\u00f3pez-Ramos, J., & Casado, L. (2010). Applications of the extended euclidean algorithm to privacy and secure communications. In Proc. of 10th international conference on computational and mathematical methods in science and engineering (pp. 702\u2013713)."},{"issue":"1","key":"1608_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TC.2016.2574340","volume":"66","author":"E \u00d6zt\u00fcrk","year":"2017","unstructured":"\u00d6zt\u00fcrk, E., Dor\u00f6z, Y., Savas\u0307, E., & Sunar, B. (2017). A custom accelerator for homomorphic encryption applications. IEEE Transactions on Computers, 66(1), 3\u201316.","journal-title":"IEEE Transactions on Computers"},{"issue":"114","key":"1608_CR24","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1090\/S0025-5718-1971-0301966-0","volume":"25","author":"JM Pollard","year":"1971","unstructured":"Pollard, J.M. (1971). The fast Fourier transform in a finite field. Mathematics of computation, 25(114), 365\u2013374.","journal-title":"Mathematics of computation"},{"key":"1608_CR25","doi-asserted-by":"crossref","unstructured":"P\u00f6ppelmann, T., & G\u00fcneysu, T. (2012). Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware. In International conference on cryptology and information security in Latin America (pp. 139\u2013158): Springer.","DOI":"10.1007\/978-3-642-33481-8_8"},{"key":"1608_CR26","doi-asserted-by":"crossref","unstructured":"P\u00f6ppelmann, T., Naehrig, M., Putnam, A., & Macias, A. (2015). Accelerating homomorphic evaluation on reconfigurable hardware. In International workshop on cryptographic hardware and embedded systems (pp. 143\u2013163): Springer.","DOI":"10.1007\/978-3-662-48324-4_8"},{"key":"1608_CR27","doi-asserted-by":"crossref","unstructured":"Riazi, M.S., Laine, K., Pelton, B., & Dai, W. (2019). HEAX: high-performance architecture for computation on homomorphically encrypted data in the cloud. arXiv:1909.09731.","DOI":"10.1145\/3373376.3378523"},{"key":"1608_CR28","unstructured":"Roy, S.S., Jarvinen, K., Vliegen, J., Vercauteren, F., & Verbauwhede, I. (2018). HEPCloud: an FPGA-based multicore processor for FV somewhat homomorphic function evaluation. IEEE Transactions on Computers."},{"key":"1608_CR29","unstructured":"Roy, S.S., Turan, F., Jarvinen, K., Vercauteren, F., & Verbauwhede, I. (2019). FPGA-Based high-performance parallel architecture for homomorphic computing on encrypted data. In 2019 IEEE International symposium on high performance computer architecture (HPCA) (pp. 387\u2013398): IEEE."},{"key":"1608_CR30","doi-asserted-by":"crossref","unstructured":"Roy, S.S., Vercauteren, F., Mentens, N., Chen, D.D., & Verbauwhede, I. (2014). Compact ring-LWE cryptoprocessor. In International workshop on cryptographic hardware and embedded systems (pp. 371\u2013391): Springer.","DOI":"10.1007\/978-3-662-44709-3_21"},{"issue":"9","key":"1608_CR31","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1109\/TC.2017.2686385","volume":"66","author":"SS Roy","year":"2017","unstructured":"Roy, S.S., Vercauteren, F., Vliegen, J., & Verbauwhede, I. (2017). Hardware assisted fully homomorphic function evaluation and encrypted search. IEEE Transactions on Computers, 66(9), 1562\u20131572.","journal-title":"IEEE Transactions on Computers"},{"key":"1608_CR32","doi-asserted-by":"crossref","unstructured":"Tan, W., Hu, G., Case, B., Gao, S., & Lao, Y. (2019). An efficient polynomial multiplier architecture for the bootstrapping algorithm in a fully homomorphic encryption scheme. In 2019 IEEE International workshop on signal processing systems (SiPS) (pp. 85\u201390): IEEE.","DOI":"10.1109\/SiPS47522.2019.9020592"},{"key":"1608_CR33","doi-asserted-by":"crossref","unstructured":"Ye, J.H., & Shieh, M.D. (2018). Low-complexity vlsi design of large integer multipliers for fully homomorphic encryption. IEEE Transactions on Very Large Scale Integration (VLSI) Systems.","DOI":"10.1109\/TVLSI.2018.2829539"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-020-01608-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11265-020-01608-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-020-01608-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:35:48Z","timestamp":1635291348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11265-020-01608-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,27]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1608"],"URL":"https:\/\/doi.org\/10.1007\/s11265-020-01608-0","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"type":"print","value":"1939-8018"},{"type":"electronic","value":"1939-8115"}],"subject":[],"published":{"date-parts":[[2020,10,27]]},"assertion":[{"value":"15 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}