{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:48:41Z","timestamp":1764175721002,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683817"},{"type":"electronic","value":"9783031683824"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68382-4_3","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T09:02:41Z","timestamp":1723712561000},"page":"76-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Exploring the\u00a0Advantages and\u00a0Challenges of\u00a0Fermat NTT in\u00a0FHE Acceleration"],"prefix":"10.1007","author":[{"given":"Andrey","family":"Kim","sequence":"first","affiliation":[]},{"given":"Ahmet Can","family":"Mert","sequence":"additional","affiliation":[]},{"given":"Anisha","family":"Mukherjee","sequence":"additional","affiliation":[]},{"given":"Aikata","family":"Aikata","sequence":"additional","affiliation":[]},{"given":"Maxim","family":"Deryabin","sequence":"additional","affiliation":[]},{"given":"Sunmin","family":"Kwon","sequence":"additional","affiliation":[]},{"given":"Hyung Chul","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Sujoy Sinha","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/PROC.1975.9791","volume":"63","author":"RC Agarwal","year":"1975","unstructured":"Agarwal, R.C., Burrus, C.S.: Number theoretic transforms to implement fast digital convolution. Proc. IEEE 63(4), 550\u2013560 (1975)","journal-title":"Proc. IEEE"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal, R., et al.: FAB: an FPGA-based accelerator for bootstrappable fully homomorphic encryption. In: IEEE International Symposium on High-Performance Computer Architecture, HPCA 2023, Montreal, 25 February\u20131 March 2023, pp. 882\u2013895. IEEE (2023). https:\/\/doi.org\/10.1109\/HPCA56546.2023.10070953","DOI":"10.1109\/HPCA56546.2023.10070953"},{"key":"3_CR3","unstructured":"Aikata, A., Mert, A.C., Kwon, S., Deryabin, M., Roy, S.S.: Reed: chiplet-based scalable hardware accelerator for fully homomorphic encryption. arXiv preprint arXiv:2308.02885 (2023)"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Al\u00a0Badawi, A., et al.: OpenFHE: open-source fully homomorphic encryption library. In: Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC 2022), pp. 53\u201363. Association for Computing Machinery, New York (2022).https:\/\/doi.org\/10.1145\/3560827.3563379","DOI":"10.1145\/3560827.3563379"},{"key":"3_CR5","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/3-540-47721-7_24","DOI":"10.1007\/3-540-47721-7_24"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Chou, T.: Faster binary-field multiplication and faster binary-field MACs. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 92\u2013111. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13051-4_6","DOI":"10.1007\/978-3-319-13051-4_6"},{"key":"3_CR7","unstructured":"Bos, J.W., Renes, J., van Vredendaal, C.: Post-quantum cryptography with contemporary co-processors: Beyond kronecker, sch\u00f6nhage-strassen & nussbaumer. In: Butler, K.R.B., Thomas, K. (eds.) 31st USENIX Security Symposium, USENIX Security 2022, Boston, 10\u201312 August 2022, pp. 3683\u20133697. USENIX Association (2022). https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/bos"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. Electron. Colloquium Comput. Complex. 111 (2011). https:\/\/eccc.weizmann.ac.il\/report\/2011\/111","DOI":"10.1145\/2090236.2090262"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) IWE. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 97\u2013106 (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"3_CR10","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (CCS 2017), pp. 1243\u20131255. Association for Computing Machinery, New York (2017).https:\/\/doi.org\/10.1145\/3133956.3134061","DOI":"10.1145\/3133956.3134061"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 360\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: Cid, C., Jacobson, M.J. (eds.) SAC 2018, pp. 347\u2013368. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_16","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Chung, C.M.M., Hwang, V., Kannwischer, M.J., Seiler, G., Shih, C.J., Yang, B.Y.: NTT multiplication for NTT-unfriendly rings: new speed records for Saber and NTRU on cortex-M4 and AVX2. IACR Trans. Cryptogr. Hardware Embed. Syst. 2021(2), 159\u2013188 (2021).https:\/\/doi.org\/10.46586\/tches.v2021.i2.159-188","DOI":"10.46586\/tches.v2021.i2.159-188"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1090\/S0002-9947-1969-0249212-8","volume":"142","author":"SA Cook","year":"1969","unstructured":"Cook, S.A., Aanderaa, S.O.: On the minimum computation time of functions. Trans. Am. Math. Soc. 142, 291\u2013314 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Dai, W., Sunar, B.: cuHE: a homomorphic encryption accelerator library. In: Pasalic, E., Knudsen, L.R. (eds.) Cryptography and Information Security in the Balkans, pp. 169\u2013186. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29172-7_11","DOI":"10.1007\/978-3-319-29172-7_11"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Dimitrov, V., Cooklev, T., Donevsky, B.: Generalized fermat-mersenne number theoretic transform. IEEE Trans. Circuits Syst. II: Analog Digit. Signal Process. 41, 133\u2013139 (1994).https:\/\/doi.org\/10.1109\/82.281844","DOI":"10.1109\/82.281844"},{"key":"3_CR18","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Paper 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"3_CR19","unstructured":"Feldmann, A., et al.: F1: a fast and programmable accelerator for fully homomorphic encryption (extended version) (2021)"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Geelen, R., et al.: BASALISC: Flexible Asynchronous Hardware Accelerator for Fully Homomorphic Encryption (2022). https:\/\/doi.org\/10.48550\/ARXIV.2205.14017","DOI":"10.48550\/ARXIV.2205.14017"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A Fully Homomorphic Encryption Scheme. Ph.D. thesis, Stanford, CA, USA (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"3_CR22","unstructured":"Gil, Y., Jiang, X., Kim, M., Lee, J.: Secure and differentially private Bayesian learning on distributed data. arXiv preprint arXiv:2005.11007 (2020)"},{"key":"3_CR23","unstructured":"Hirner, F., Mert, A.C., Roy, S.S.: Proteus: a tool to generate pipelined number theoretic transform architectures for FHE and ZKP applications. Cryptology ePrint Archive (2023)"},{"key":"3_CR24","unstructured":"JEDEC. High Bandwidth Memory DRAM (HBM3). Tech. Rep. JESD238 (2022)"},{"key":"3_CR25","unstructured":"Karatsuba, A.A., Ofman, Y.P.: Multiplication of many-digital numbers by automatic computers. In: Doklady Akademii Nauk, vol.\u00a0145, pp. 293\u2013294. Russian Academy of Sciences (1962)"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Kim, A., Song, Y., Kim, M., Lee, K., Cheon, J.: Logistic regression model training based on the approximate homomorphic encryption. BMC Med. Genom. 11 (2018). https:\/\/doi.org\/10.1186\/s12920-018-0401-7","DOI":"10.1186\/s12920-018-0401-7"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Kim, J., Kim, S., Choi, J., Park, J., Kim, D., Ahn, J.H.: SHARP: a short-word hierarchical accelerator for robust and practical fully homomorphic encryption. In: Solihin, Y., Heinrich, M.A. (eds.) Proceedings of the 50th Annual International Symposium on Computer Architecture, ISCA 2023, Orlando, 17\u201321 June 2023, pp. 18:1\u201318:15. ACM (2023). https:\/\/doi.org\/10.1145\/3579371.3589053","DOI":"10.1145\/3579371.3589053"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Kim, J., et al.: ARK: Fully Homomorphic Encryption Accelerator with Runtime Data Generation and Inter-Operation Key Reuse (2022). https:\/\/doi.org\/10.48550\/ARXIV.2205.00922","DOI":"10.48550\/ARXIV.2205.00922"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Kim, S., et al.: BTS: an accelerator for bootstrappable fully homomorphic encryption. In: Proceedings of the 49th Annual International Symposium on Computer Architecture (ISCA 2022, pp. 711\u2013725. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3470496.3527415","DOI":"10.1145\/3470496.3527415"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Lee, D., et al.: Design considerations of HBM stacked DRAM and the memory architecture extension. In: 2015 IEEE Custom Integrated Circuits Conference, CICC 2015, San Jose, 28\u201330 September 2015, pp.\u00a01\u20138. IEEE (2015).https:\/\/doi.org\/10.1109\/CICC.2015.7338357","DOI":"10.1109\/CICC.2015.7338357"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Lee, W., Akleylek, S., Wong, D.C., Yap, W., Goi, B., Hwang, S.O.: Parallel implementation of nussbaumer algorithm and number theoretic transform on a GPU platform: application to qtesla. J. Supercomput. 77(4), 3289\u20133314 (2021). https:\/\/doi.org\/10.1007\/S11227-020-03392-X","DOI":"10.1007\/S11227-020-03392-X"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Longa, P., Naehrig, M.: Speeding up the number theoretic transform for faster ideal lattice-based cryptography. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 124\u2013139. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_8","DOI":"10.1007\/978-3-319-48965-0_8"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Mert, A.C., et\u00a0al.: Medha: microcoded hardware accelerator for computing on encrypted data. arXiv preprint arXiv:2210.05476 (2022)","DOI":"10.46586\/tches.v2023.i1.463-500"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Mert, A.C., Ozturk, E., Savas, E.: Design and implementation of encryption\/decryption architectures for BFV homomorphic encryption scheme. IEEE Trans. Very Large Scale Integrat. (VLSI) Syst. 28(2), 353\u2013362 (2020). https:\/\/doi.org\/10.1109\/TVLSI.2019.2943127","DOI":"10.1109\/TVLSI.2019.2943127"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Narasimha, S., et al.: A 7nm CMOS technology platform for mobile and high performance compute application. In: 2017 IEEE International Electron Devices Meeting (IEDM), pp. 29.5.1\u201329.5.4 (2017). https:\/\/doi.org\/10.1109\/IEDM.2017.8268476","DOI":"10.1109\/IEDM.2017.8268476"},{"issue":"2","key":"3_CR36","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TASSP.1980.1163372","volume":"28","author":"H Nussbaumer","year":"1980","unstructured":"Nussbaumer, H.: Fast polynomial transform algorithms for digital convolution. IEEE Trans. Acoust. Speech Signal Process. 28(2), 205\u2013215 (1980). https:\/\/doi.org\/10.1109\/TASSP.1980.1163372","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Park, M., et al.: A 192-Gb 12-High 896-GB\/s HBM3 DRAM With a TSV auto-calibration scheme and machine-learning-based layout optimization. IEEE J. Solid State Circuits 58(1), 256\u2013269 (2023). https:\/\/doi.org\/10.1109\/JSSC.2022.3193354","DOI":"10.1109\/JSSC.2022.3193354"},{"key":"3_CR38","unstructured":"Rambus. HBM3 Memory: Break Through to Greater Bandwidth. https:\/\/go.rambus.com\/hbm3-memory-break-through-to-greater-bandwidth"},{"key":"3_CR39","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On Data Banks and Privacy Homomorphisms. Foundations of Secure Computation, , pp. 169\u2013179. Academia Press (1978)"},{"key":"3_CR40","doi-asserted-by":"publisher","unstructured":"Roy, D.B., Mukhopadhyay, D., Izumi, M., Takahashi, J.: Tile before multiplication: an efficient strategy to optimize DSP multiplier for accelerating prime field ECCc for NIST curves. In: 2014 51st ACM\/EDAC\/IEEE Design Automation Conference (DAC), pp.\u00a01\u20136 (2014). https:\/\/doi.org\/10.1145\/2593069.2593234","DOI":"10.1145\/2593069.2593234"},{"key":"3_CR41","doi-asserted-by":"publisher","unstructured":"Samardzic, N., et al.: CraterLake: a hardware accelerator for efficient unbounded computation on encrypted data. In: Proceedings of the 49th Annual International Symposium on Computer Architecture (ISCA 2022), pp. 173\u2013187. Association for Computing Machinery, New York (2022).https:\/\/doi.org\/10.1145\/3470496.3527393","DOI":"10.1145\/3470496.3527393"},{"key":"3_CR42","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00289470","volume":"7","author":"A Sch\u00f6nhage","year":"1977","unstructured":"Sch\u00f6nhage, A.: Schnelle multiplikation von polynomen \u00fcber k\u00f6rpern der charakteristik 2. Acta Informatica 7, 395\u2013398 (1977). https:\/\/doi.org\/10.1007\/BF00289470","journal-title":"Acta Informatica"},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle multiplikation gro\u00dfer zahlen. Computing 7, 281\u2013292 (1971). https:\/\/doi.org\/10.1007\/BF02242355","DOI":"10.1007\/BF02242355"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Sun, Y., et al.: Demystifying CXL memory with genuine cxl-ready systems and devices. arXiv preprint arXiv:2303.15375 (2023)","DOI":"10.1145\/3613424.3614256"},{"key":"3_CR45","doi-asserted-by":"publisher","unstructured":"Wan, W., et al..: A compute-in-memory chip based on resistive random-access memory. Nature 608(7923), 504\u2013512 (2022). https:\/\/doi.org\/10.1038\/s41586-022-04992-8","DOI":"10.1038\/s41586-022-04992-8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68382-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T09:04:32Z","timestamp":1723712672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68382-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683817","9783031683824"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68382-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}