{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T10:14:58Z","timestamp":1783419298160,"version":"3.54.6"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T00:00:00Z","timestamp":1783382400000},"content-version":"vor","delay-in-days":99,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100017691","name":"Guangxi Key Research and Development Program","doi-asserted-by":"publisher","award":["AB24010340"],"award-info":[{"award-number":["AB24010340"]}],"id":[{"id":"10.13039\/501100017691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation Project of China","doi-asserted-by":"crossref","award":["62062009"],"award-info":[{"award-number":["62062009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s44443-026-00492-1","type":"journal-article","created":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T17:35:09Z","timestamp":1774892109000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A unified and resource-efficient polynomial multiplication architecture for fully homomorphic encryption"],"prefix":"10.1007","volume":"38","author":[{"given":"Junbin","family":"Qiu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruwei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiang","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,30]]},"reference":[{"key":"492_CR1","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor C, Barrier J, Guelton S, Guinet A, Killijian M-O, Lepoint T (2016) Nfllib: Ntt-based fast lattice library. In: Cryptographers\u2019 Track at the RSA Conference, pp 341\u2013356. Springer","DOI":"10.1007\/978-3-319-29485-8_20"},{"issue":"3","key":"492_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","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):1\u201336","journal-title":"ACM Transactions on Computation Theory (TOCT)"},{"key":"492_CR3","doi-asserted-by":"publisher","unstructured":"Chen X, Lu W, Su T, Chen D (2024) Shp-fsntt: A scalable and high-performance ntt accelerator based on the four-step algorithm. In: 2024 IEEE International Symposium on Circuits and Systems (ISCAS), pp 1\u20135. https:\/\/doi.org\/10.1109\/ISCAS58744.2024.10558123","DOI":"10.1109\/ISCAS58744.2024.10558123"},{"key":"492_CR4","doi-asserted-by":"crossref","unstructured":"Chen X, Yang B, Yin S, Wei S, Liu L (2022) Cfntt: Scalable radix-2\/4 ntt multiplication architecture with an efficient conflict-free memory mapping scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems, 94\u2013126","DOI":"10.46586\/tches.v2022.i1.94-126"},{"key":"492_CR5","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M, Song Y (2017) Homomorphic encryption for arithmetic of approximate numbers. In: Advances in cryptology-ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3\u20137, 2017, Proceedings, Part i 23, pp 409\u2013437. Springer","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"492_CR6","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. J Cryptol 33(1):34\u201391","journal-title":"J Cryptol"},{"key":"492_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2022.104451","volume":"89","author":"K Derya","year":"2022","unstructured":"Derya K, Mert AC, \u00d6zt\u00fcrk E, Sava\u015f E (2022) Coha-ntt: A configurable hardware accelerator for ntt-based polynomial multiplication. Microprocess Microsyst 89:104451","journal-title":"Microprocess Microsyst"},{"key":"492_CR8","doi-asserted-by":"publisher","first-page":"72498","DOI":"10.1109\/ACCESS.2023.3295245","volume":"11","author":"S Di Matteo","year":"2023","unstructured":"Di Matteo S, Gerfo ML, Saponara S (2023) Vlsi design and fpga implementation of an ntt hardware accelerator for homomorphic seal-embedded library. IEEE Access 11:72498\u201372508","journal-title":"IEEE Access"},{"key":"492_CR9","doi-asserted-by":"crossref","unstructured":"Duan J-L, Zhang C, Wang L-H, Shen L (2024) Smbha: A system-level multicore bgv hardware accelerator based on fpga. IEEE Trans Very Large Scale Integr (VLSI) Syst","DOI":"10.1109\/TVLSI.2024.3480997"},{"key":"492_CR10","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive"},{"key":"492_CR11","doi-asserted-by":"crossref","unstructured":"Fan S, Wang Z, Xu W, Hou R, Meng D, Zhang M (2023) Tensorfhe: Achieving practical computation on encrypted data using gpgpu. In: 2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp 922\u2013934. IEEE","DOI":"10.1109\/HPCA56546.2023.10071017"},{"issue":"5","key":"492_CR12","first-page":"1689","volume":"70","author":"Y Geng","year":"2023","unstructured":"Geng Y, Hu X, Li M, Wang Z (2023) Rethinking parallel memory access pattern in number theoretic transform design. IEEE Trans Circuits Syst II Express Briefs 70(5):1689\u20131693","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"key":"492_CR13","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"492_CR14","doi-asserted-by":"crossref","unstructured":"Guan Z, Zhu Y, Huang Y, Lei L, Wang X, Jia H, Chen Y, Zhang B, Dong J, Bian S (2024) Esc-ntt: An elastic, seamless and compact architecture for multi-parameter ntt acceleration. In: 2024 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp 1\u20136. IEEE","DOI":"10.23919\/DATE58400.2024.10546833"},{"key":"492_CR15","doi-asserted-by":"crossref","unstructured":"Halevi S, Shoup V (2014) Algorithms in helib. In: Advances in Cryptology-CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I 34, pp. 554\u2013571. Springer","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"492_CR16","doi-asserted-by":"crossref","unstructured":"Hirner F, Mert AC, Roy SS (2024) Proteus: A pipelined ntt architecture generator. IEEE Trans Very Large Scale Integr (VLSI) Syst","DOI":"10.1109\/TVLSI.2024.3377366"},{"key":"492_CR17","unstructured":"Hummdi AY, Aljaedi A, Bassfar Z, Jamal SS, Hazzazi MM, Rehman MU (2024) Unif-ntt: A unified hardware design of forward and inverse ntt for pqc algorithms. IEEE Access"},{"key":"492_CR18","unstructured":"Jati A, Gupta N, Chattopadhyay A, Sanadhya SK (2019) Spqcop: Side-channel protected post-quantum cryptoprocessor. Cryptology ePrint Archive"},{"key":"492_CR19","doi-asserted-by":"crossref","unstructured":"Jiang L, Lou Q, Joshi N (2022) Matcha: A fast and energy-efficient accelerator for fully homomorphic encryption over the torus. In: Proceedings of the 59th ACM\/IEEE design automation conference, pp 235\u2013240","DOI":"10.1145\/3489517.3530435"},{"key":"492_CR20","doi-asserted-by":"crossref","unstructured":"Kim J, Kim S, Choi J, Park J, Kim D, Ahn JH (2023) Sharp: A short-word hierarchical accelerator for robust and practical fully homomorphic encryption. In: Proceedings of the 50th annual international symposium on computer architecture, pp 1\u201315","DOI":"10.1145\/3579371.3589053"},{"key":"492_CR21","doi-asserted-by":"crossref","unstructured":"Li L, Li R, Zhao Y, Li R, Su Z, Li X (2024) Fhntt: a flexible number theoretic transform design based on hybrid-radix butterfly. In: 2024 IEEE international symposium on parallel and distributed processing with applications (ISPA), pp 1615\u20131622. IEEE","DOI":"10.1109\/ISPA63168.2024.00219"},{"issue":"2","key":"492_CR22","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s13389-025-00376-6","volume":"15","author":"Z Liu","year":"2025","unstructured":"Liu Z, Gu M (2025) A flexible efficient and configurable number theoretic transform architecture implemented on fpga. J Cryptogr Eng 15(2):13","journal-title":"J Cryptogr Eng"},{"issue":"11","key":"492_CR23","doi-asserted-by":"publisher","first-page":"2829","DOI":"10.1109\/TC.2020.3017930","volume":"71","author":"AC Mert","year":"2020","unstructured":"Mert AC, Karabulut E, \u00d6zt\u00fcrk E, Sava\u015f E, Aysu A (2020) An extensive study of flexible design methods for the number theoretic transform. IEEE Trans Comput 71(11):2829\u20132843","journal-title":"IEEE Trans Comput"},{"key":"492_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2020.103219","volume":"78","author":"AC Mert","year":"2020","unstructured":"Mert AC, \u00d6zt\u00fcrk E, Sava\u015f E (2020) Fpga implementation of a run-time configurable ntt-based polynomial multiplication hardware. Microprocess Microsyst 78:103219","journal-title":"Microprocess Microsyst"},{"key":"492_CR25","unstructured":"Microsoft Research (2019) Microsoft SEAL (release 3.2). https:\/\/github.com\/Microsoft\/SEAL. Redmond, WA, USA"},{"issue":"5","key":"492_CR26","doi-asserted-by":"publisher","first-page":"1504","DOI":"10.1109\/TCAD.2022.3205552","volume":"42","author":"J Mu","year":"2022","unstructured":"Mu J, Ren Y, Wang W, Hu Y, Chen S, Chang C-H, Fan J, Ye J, Cao Y, Li H et al (2022) Scalable and conflict-free ntt hardware accelerator design: Methodology, proof, and implementation. IEEE Trans Comput Aided Des Integr Circuits Syst 42(5):1504\u20131517","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"114","key":"492_CR27","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1090\/S0025-5718-1971-0301966-0","volume":"25","author":"JM Pollard","year":"1971","unstructured":"Pollard JM (1971) The fast fourier transform in a finite field. Math Comput 25(114):365\u2013374","journal-title":"Math Comput"},{"key":"492_CR28","doi-asserted-by":"crossref","unstructured":"Putra A, Prasetiyo Chen Y, Kim J, Kim J-Y (2023) Strix: An end-to-end streaming architecture with two-level ciphertext batching for fully homomorphic encryption with programmable bootstrapping. In: Proceedings of the 56th Annual IEEE\/ACM international symposium on microarchitecture, pp 1319\u20131331","DOI":"10.1145\/3613424.3614264"},{"issue":"1","key":"492_CR29","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s10470-025-02414-z","volume":"124","author":"TT Reddy","year":"2025","unstructured":"Reddy TT, Velagaleti S, Satyanarayana B, Kumar GP (2025) Hardware efficient arithmetic reconfigurable fully homomorphic encryption (arfhe) accelerator of low power iot based risc-v processor. Analog Integr Circ Sig Process 124(1):20","journal-title":"Analog Integr Circ Sig Process"},{"issue":"1","key":"492_CR30","first-page":"415","volume":"71","author":"J Ren","year":"2023","unstructured":"Ren J, Du G, Li Z, Jia X, Liao Q, Wang X, Zhang D (2023) An efficient ring polynomial multiplication accelerator for homomorphic encryption. IEEE Trans Circuits Syst II Express Briefs 71(1):415\u2013419","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"key":"492_CR31","doi-asserted-by":"crossref","unstructured":"Samardzic N, Feldmann A, Krastev A, Devadas S, Dreslinski R, Peikert C, Sanchez D (2021) F1: A fast and programmable accelerator for fully homomorphic encryption. In: MICRO-54: 54th Annual IEEE\/ACM international symposium on microarchitecture, pp 238\u2013252","DOI":"10.1145\/3466752.3480070"},{"key":"492_CR32","doi-asserted-by":"crossref","unstructured":"Samardzic N, Feldmann A, Krastev A, Manohar N, Genise N, Devadas S, Eldefrawy K, Peikert C, Sanchez D (2022) Craterlake: a hardware accelerator for efficient unbounded computation on encrypted data. In: Proceedings of the 49th annual international symposium on computer architecture, pp 173\u2013187","DOI":"10.1145\/3470496.3527393"},{"key":"492_CR33","doi-asserted-by":"crossref","unstructured":"Shivdikar K, Bao Y, Agrawal R, Shen M, Jonatan G, Mora E, Ingare A, Livesay N, Abell\u00e1n JL, Kim J et al (2023) Gme: Gpu-based microarchitectural extensions to accelerate homomorphic encryption. In: Proceedings of the 56th annual IEEE\/ACM international symposium on microarchitecture, pp 670\u2013684","DOI":"10.1145\/3613424.3614279"},{"key":"492_CR34","doi-asserted-by":"crossref","unstructured":"Su Y, Yang B-L, Yang C, Yang Z-P, Liu Y-W (2022) A highly unified reconfigurable multicore architecture to speed up ntt\/intt for homomorphic polynomial multiplication. IEEE Trans Very Large Scale Integr (VLSI) Syst 30(8):993\u20131006","DOI":"10.1109\/TVLSI.2022.3166355"},{"key":"492_CR35","unstructured":"Wang W, Huang X, Emmart N, Weems C (2013) Vlsi design of a large-number multiplier for fully homomorphic encryption. IEEE Trans Very Large Scale Integr (VLSI) Syst 22(9):1879\u20131887"},{"issue":"4","key":"492_CR36","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1109\/TPDS.2022.3228628","volume":"34","author":"Z Wang","year":"2023","unstructured":"Wang Z, Li P, Hou R, Li Z, Cao J, Wang X, Meng D (2023) He-booster: An efficient polynomial arithmetic acceleration on gpus for fully homomorphic encryption. IEEE Trans Parallel Distrib Syst 34(4):1067\u20131081","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"492_CR37","volume-title":"A reconfigurable and area-efficient polynomial multiplier using a novel in-place constant-geometry ntt\/intt and conflict-free memory mapping scheme","author":"J Wang","year":"2024","unstructured":"Wang J, Yang C, Meng Y, Zhang F, Hou J, Xiang S, Su Y (2024) A reconfigurable and area-efficient polynomial multiplier using a novel in-place constant-geometry ntt\/intt and conflict-free memory mapping scheme. Regular Papers, IEEE Transactions on Circuits and Systems I"},{"issue":"10","key":"492_CR38","first-page":"4068","volume":"69","author":"Z Ye","year":"2022","unstructured":"Ye Z, Cheung RC, Huang K (2022) Pipentt: A pipelined number theoretic transform architecture. IEEE Trans Circuits Syst II Express Briefs 69(10):4068\u20134072","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"key":"492_CR39","doi-asserted-by":"crossref","unstructured":"Zhang N, Yang B, Chen C, Yin S, Wei S, Liu L (2020) Highly efficient architecture of newhope-nist on fpga using low-complexity ntt\/intt. IACR Transactions on Cryptographic Hardware and Embedded Systems, 49\u201372","DOI":"10.46586\/tches.v2020.i2.49-72"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-026-00492-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00492-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00492-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T09:30:46Z","timestamp":1783416646000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-026-00492-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,30]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["492"],"URL":"https:\/\/doi.org\/10.1007\/s44443-026-00492-1","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,30]]},"assertion":[{"value":"10 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"287"}}