{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T17:09:30Z","timestamp":1784999370155,"version":"3.55.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T00:00:00Z","timestamp":1597104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T00:00:00Z","timestamp":1597104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2020R1A2B5B01002145"],"award-info":[{"award-number":["2020R1A2B5B01002145"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2019H1D3A1A01102607"],"award-info":[{"award-number":["2019H1D3A1A01102607"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Fundamental Research Grant Scheme Malaysia","award":["FRGS\/1\/2018\/STG06\/UTAR\/03\/1"],"award-info":[{"award-number":["FRGS\/1\/2018\/STG06\/UTAR\/03\/1"]}]},{"name":"Fundamental Research Grant Scheme Malaysia","award":["FRGS\/1\/2018\/STG06\/UTAR\/03\/1"],"award-info":[{"award-number":["FRGS\/1\/2018\/STG06\/UTAR\/03\/1"]}]},{"name":"Fundamental Research Grant Scheme Malaysia","award":["FRGS\/1\/2018\/STG06\/UTAR\/03\/1"],"award-info":[{"award-number":["FRGS\/1\/2018\/STG06\/UTAR\/03\/1"]}]},{"name":"TUBITAK","award":["EEEAG-117E636"],"award-info":[{"award-number":["EEEAG-117E636"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11227-020-03392-x","type":"journal-article","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T09:30:36Z","timestamp":1597138236000},"page":"3289-3314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Parallel implementation of Nussbaumer algorithm and number theoretic transform on a GPU platform: application to qTESLA"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4659-8979","authenticated-orcid":false,"given":"Wai-Kong","family":"Lee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sedat","family":"Akleylek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Denis Chee-Keong","family":"Wong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wun-She","family":"Yap","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bok-Min","family":"Goi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4240-6255","authenticated-orcid":false,"given":"Seong-Oun","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"3392_CR1","doi-asserted-by":"crossref","unstructured":"Shor P (1994) Algorithms for quantum computation: discrete logarithm and factoring. In: IEEE Proceedings of the 35th Annual Symposium on Foundations of Computer Science. IEEE, Santa Fe, pp 124\u2013134","DOI":"10.1109\/SFCS.1994.365700"},{"key":"3392_CR2","unstructured":"NIST Post-Quantum Cryptography Standardization: Round 2 Submission. https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-2-Submissions. Accessed 25 May 2019"},{"key":"3392_CR3","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. Springer","DOI":"10.1007\/978-3-319-29172-7_11"},{"issue":"9","key":"3392_CR4","first-page":"1301","volume":"67","author":"W Dai","year":"2018","unstructured":"Dai W, Chen D, Cheung RCC, Koc CK (2018) FFT-based McLaughlin\u2019s montgomery exponentiation without conditional selections. IEEE Trans Comput 67(9):1301\u20131314","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"3392_CR5","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1109\/TCSII.2019.2917621","volume":"67","author":"X Feng","year":"2019","unstructured":"Feng X, Li S, Xu S (2019) RLWE-oriented high-speed polynomial multiplier utilizing multi-lane Stockham NTT algorithm. IEEE Trans Circuits Systems II Express Briefs 67(3):556\u2013559","journal-title":"IEEE Trans Circuits Systems II Express Briefs"},{"key":"3392_CR6","doi-asserted-by":"crossref","unstructured":"Akleylek S, Tok ZY (2014) Efficient arithmetic for lattice-based cryptography on GPU using the CUDA platform. In: 22nd IEEE Signal Processing and Communications Applications Conference (SIU), Trabzon","DOI":"10.1109\/SIU.2014.6830364"},{"key":"3392_CR7","doi-asserted-by":"crossref","unstructured":"Akleylek S, Dagdelen O, Tok ZY (2016) On the efficiency of polynomial multiplication for lattice-based cryptography on GPUs using CUDA. In: International Conference on Cryptography and Information Security in the Balkans. Koper, pp 155\u2013168","DOI":"10.1007\/978-3-319-29172-7_10"},{"key":"3392_CR8","doi-asserted-by":"crossref","unstructured":"Lee W-K, Akleylek S, Yap W-S, Goi B-M (2019) Accelerating number theoretic transform in GPU platform for qTESLA scheme. In: 15th International Conference on Information Security Practice and Experience (ISPEC 2019), Kuala Lumpur","DOI":"10.1007\/978-3-030-34339-2_3"},{"key":"3392_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TASSP.1980.1163372","volume":"28","author":"H Nussbaumer","year":"1980","unstructured":"Nussbaumer H (1980) Fast polynomial transform algorithms for digital convolution. IEEE Trans Acoust Speech Signal Process 28:205\u2013215","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"issue":"90","key":"3392_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley JW, Tukey JW (1965) An algorithm for the machine calculation of complex Fourier series. Math Comput 19(90):297\u2013301","journal-title":"Math Comput"},{"key":"3392_CR11","first-page":"563","volume":"29","author":"WM Gentleman","year":"1966","unstructured":"Gentleman WM, Sande G (1966) Fast Fourier transforms\u2014for fun and profit. Proc Joint Comput Conf 29:563\u2013578","journal-title":"Proc Joint Comput Conf"},{"key":"3392_CR12","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1109\/PROC.1967.5957","volume":"55","author":"WT Cochran","year":"1967","unstructured":"Cochran WT, Cooley JW, Favin DL, Helms HD, Kaenel RA, Lang WW, Maling GC, Nels DE (1967) What is the fast Fourier transform? Proc IEEE 55:1664\u20131674","journal-title":"Proc IEEE"},{"key":"3392_CR13","unstructured":"Bindel N, Akleylek S, Alkim E, Barreto PSLM, Buchmann J, Eaton E, Gutoski G, Kramer J, Longa P, Polat H, Jefferson, ER, Zanon G (2020) qTESLA. https:\/\/qtesla.org\/wp-content\/uploads\/2019\/04\/qTESLA_round2_04.26.2019.pdf. Accessed 17 Jan 2020"},{"issue":"114","key":"3392_CR14","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"},{"issue":"3","key":"3392_CR15","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S0129626411000266","volume":"21","author":"N Emmart","year":"2011","unstructured":"Emmart N, Weems CC (2011) High precision integer multiplication with a GPU using Strassen\u2019s algorithm with multiple FFT sizes. Parallel Process Lett 21(3):359\u2013375","journal-title":"Parallel Process Lett"},{"issue":"3","key":"3392_CR16","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TC.2013.154","volume":"64","author":"W Wang","year":"2013","unstructured":"Wang W, Hu Y, Chen L, Huang X, Sunar B (2013) Exploring the feasibility of fully homomorphic encryption. IEEE Trans Comput 64(3):698\u2013706","journal-title":"IEEE Trans Comput"},{"key":"3392_CR17","doi-asserted-by":"crossref","unstructured":"Barrett P (1986) Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. Advances in Cryptology\u2014CRYPTO\u2019 86. Lecture Notes in Computer Science, vol 263, pp 311\u2013323","DOI":"10.1007\/3-540-47721-7_24"},{"issue":"1","key":"3392_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TETCI.2017.2772792","volume":"2","author":"N Shone","year":"2018","unstructured":"Shone N, Ngoc TN, Phai VD, Shi Q (2018) A deep learning approach to network intrusion detection. IEEE Trans Emerg Top Comput Intell 2(1):41\u201350","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"issue":"11","key":"3392_CR19","doi-asserted-by":"publisher","first-page":"2518","DOI":"10.1109\/TVLSI.2018.2858014","volume":"26","author":"WK Lee","year":"2018","unstructured":"Lee WK, Achar R, Nakhla MS (2018) Dynamic GPU parallel sparse LU factorization for fast circuit simulation. IEEE Trans Very Large Scale Integration (VLSI) Syst 26(11):2518\u20132529","journal-title":"IEEE Trans Very Large Scale Integration (VLSI) Syst"},{"key":"3392_CR20","doi-asserted-by":"crossref","unstructured":"Emmart N, Zheng, F, Weems C (2018) Faster modular exponentiation using double precision floating point arithmetic on the GPU. In: Proceedings of the IEEE 25th Symposium on Computer Arithmetic. IEEE, Amherst, Massachusetts, pp 130\u2013137","DOI":"10.1109\/ARITH.2018.8464792"},{"key":"3392_CR21","unstructured":"CUDA Programming Guide v10.2. https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html. Accessed 27 Dec 2019"},{"key":"3392_CR22","doi-asserted-by":"crossref","unstructured":"Du C, Bai G (2016) Efficient polynomial multiplier architecture for ring-LWE based public key cryptosystems. In: IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, Montreal, pp 1162\u20131165","DOI":"10.1109\/ISCAS.2016.7527452"},{"issue":"170","key":"3392_CR23","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 (1985) Modular multiplication without trial division. Math Comput 44(170):519\u2013521","journal-title":"Math Comput"},{"key":"3392_CR24","unstructured":"Garben van der Lubbe. A New Hope for Nussbaumer. Bachelor Thesis, Radboud University. https:\/\/www.cs.ru.nl\/bachelors-theses\/2016\/Gerben_van_der_Lubbe_4389026_A_New_Hope_for_Nussbaumer.pdf. Accessed 1 July 2019"},{"key":"3392_CR25","unstructured":"Avanzi R, Bos JW, Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schanck JM, Schwabe P, Seiler G, Stehl\u00e9 D CRYSTALS-KYBER: Algorithm Specifications and Supporting Documentation. https:\/\/pq-crystals.org\/. Accessed 25 June 2020"},{"key":"3392_CR26","unstructured":"Alkim E, Avanzi R, Bos J, Ducas L, Piedra A, P\u00f6ppelmann T, Schwabe P, Stebila D, Newhope-Algorithm Specifications and Supporting Documentation. https:\/\/newhopecrypto.org\/. Accessed 25 June 2020"},{"key":"3392_CR27","unstructured":"Lyubashevsky V, Ducas L, Kiltz E, Lepoint T, Schwabe P, Seiler G, Stehle D. CRYSTALS-DILITHIUM. https:\/\/pq-crystals.org\/. Accessed 25 June 2020"},{"key":"3392_CR28","unstructured":"D-Wave Systems. https:\/\/www.dwavesys.com\/quantum-computing. Accessed 24 May 2020"},{"issue":"3","key":"3392_CR29","doi-asserted-by":"publisher","first-page":"4448","DOI":"10.1109\/JIOT.2018.2881425","volume":"6","author":"CC Chang","year":"2018","unstructured":"Chang CC, Lee WK, Liu Y, Goi BM, Phan RCW (2018) Signature gateway: offloading signature generation to IoT gateway accelerated by GPU. IEEE Internet Things J 6(3):4448\u20134461","journal-title":"IEEE Internet Things J"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03392-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03392-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03392-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,6]],"date-time":"2022-11-06T13:47:21Z","timestamp":1667742441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03392-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,11]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["3392"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03392-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,11]]},"assertion":[{"value":"11 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}