{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:30:29Z","timestamp":1787495429704,"version":"build-2736575974"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819248049","type":"print"},{"value":"9789819248056","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T00:00:00Z","timestamp":1787529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T00:00:00Z","timestamp":1787529600000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-4805-6_27","type":"book-chapter","created":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T13:46:40Z","timestamp":1787492800000},"page":"404-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["HieraNTT: A Memory Hierarchy-Aware Data Access Architecture for\u00a0Efficient Number Theoretic Transform on\u00a0GPU"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1945-6182","authenticated-orcid":false,"given":"Qian","family":"Xiong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4035-0411","authenticated-orcid":false,"given":"Weiliang","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5671-0576","authenticated-orcid":false,"given":"Ligang","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9261-8478","authenticated-orcid":false,"given":"Yufan","family":"Bai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5798-2282","authenticated-orcid":false,"given":"Yao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3934-7605","authenticated-orcid":false,"given":"Hai","family":"Jin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8451-8656","authenticated-orcid":false,"given":"Xuanhua","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,24]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Proceedings of the Advances in Cryptology, pp. 409\u2013437. Cham (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Proceedings of the Advances in Cryptology, pp. 3\u201333. Berlin, Heidelberg (2016)","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"27_CR4","unstructured":"Encryptorion-lab: Phantomfhe: A cuda-accelerated homomorphic encryption library (2025). https:\/\/github.com\/encryptorion-lab\/phantom-fhe\/commit\/1f4a198443b3af77118e51f53d5b8f332154b875"},{"key":"27_CR5","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Proceedings of the Part II, of the 35th Annual International Conference on Advances in Cryptology, pp. 305\u2013326. Berlin, Heidelberg (2016)","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"27_CR7","unstructured":"Hamburg, M.: Ed448-goldilocks, a new elliptic curve, p. 625 (2015)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Ma, W., et al.: GZKP: a GPU accelerated zero-knowledge proof system, pp. 340\u2013353. ASPLOS 2023, New York, NY, USA (2023)","DOI":"10.1145\/3575693.3575711"},{"key":"27_CR9","unstructured":"Nvidia: GPU Device Memory Guide (2025)"},{"key":"27_CR10","unstructured":"PolygonZero: Plonky2: Fast Recursive Arguments With Plonk and Fri (2025). https:\/\/github.com\/0xPolygonZero\/plonky2\/commit\/5d9da5a65bbcba2c66eb29c035090eb2e9ccb05f"},{"key":"27_CR11","unstructured":"Supranational: Zero-Knowledge Template Library (2025). https:\/\/github.com\/supranational\/sppark\/commit\/9cd5cbd310433665a9e8c26837355cb41ca88b06"},{"issue":"5","key":"27_CR12","doi-asserted-by":"publisher","first-page":"4895","DOI":"10.1109\/TDSC.2024.3363900","volume":"21","author":"H Yang","year":"2024","unstructured":"Yang, H., et al.: Phantom: a CUDA-accelerated word-wise homomorphic encryption library. IEEE Trans. Dependable Secure Comput. 21(5), 4895\u20134906 (2024)","journal-title":"IEEE Trans. Dependable Secure Comput."}],"container-title":["Lecture Notes in Computer Science","Advanced Parallel Processing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-4805-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T13:46:42Z","timestamp":1787492802000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-4805-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,24]]},"ISBN":["9789819248049","9789819248056"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-4805-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,24]]},"assertion":[{"value":"24 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"Artificial intelligence tools, if used, were used only for language organization and figure\/table polishing, and did not participate in the generation of the core ideas or technical content.","order":2,"name":"Ethics","label":"Artificial Intelligence Statement","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"APPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Advanced Parallel Processing Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brussels","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"appt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.appt-conference.com\/2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}