{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:23:42Z","timestamp":1760081022137,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031709463"},{"type":"electronic","value":"9783031709470"}],"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-70947-0_5","type":"book-chapter","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T09:44:50Z","timestamp":1735379090000},"page":"93-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exploring Constrained-Modulus Modular Multipliers for\u00a0Improved Area, Power and\u00a0Flexibility"],"prefix":"10.1007","author":[{"given":"Mohammed","family":"Nabeel","sequence":"first","affiliation":[]},{"given":"Deepraj","family":"Soni","sequence":"additional","affiliation":[]},{"given":"Ramesh","family":"Karri","sequence":"additional","affiliation":[]},{"given":"Michail","family":"Maniatakos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,29]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","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.\u00a01243\u20131255 (2017)","DOI":"10.1145\/3133956.3134061"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Han, K., Hong, S., Cheon, J.H., Park, D.: Logistic regression on homomorphic encrypted data at scale. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a033 (2019)","DOI":"10.1609\/aaai.v33i01.33019466"},{"key":"5_CR3","unstructured":"Juvekar, C., Vaikuntanathan, V., Chandrakasan, A.: GAZELLE: a low latency framework for secure neural network inference. In: 27th USENIX Security Symposium (USENIX Security 2018) (2018)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1186\/s12920-020-0724-z","volume":"13","author":"M Kim","year":"2020","unstructured":"Kim, M., Song, Y., Li, B., Micciancio, D.: Semi-Parallel logistic regression for GWAS on encrypted data. BMC Med. Genomics 13, 99 (2020)","journal-title":"BMC Med. Genomics"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. Cryptology ePrint Archive, Report 2011\/277 (2011)","DOI":"10.1145\/2090236.2090262"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Riazi, M.S., Laine, K., Pelton, B., Dai, W.: HEAX: an architecture for computing on encrypted data. In: Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, pp.\u00a01295\u20131309 (2020)","DOI":"10.1145\/3373376.3378523"},{"key":"5_CR8","unstructured":"Feldmann, A., et al.: F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (Extended Version). arXiv:2109.05371 (2021). arXiv: 2109.05371"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Samardzic, N., et al.: Craterlake: a hardware accelerator for efficient unbounded computation on encrypted data. In: ISCA, pp.\u00a0173\u2013187 (2022)","DOI":"10.1145\/3470496.3527393"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Soni, D., et\u00a0al.: RPU: the ring processing unit. In: 2023 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), pp.\u00a0272\u2013282. IEEE (2023)","DOI":"10.1109\/ISPASS57527.2023.00034"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Soni, D., et al.: Design space exploration of modular multipliers for ASIC FHE accelerators. In: 2023 24th International Symposium on Quality Electronic Design (ISQED), pp.\u00a01\u20138 (2023)","DOI":"10.1109\/ISQED57927.2023.10129292"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Mert, A.C., Ozturk, E., Savas, E.: Design and implementation of a fast and scalable NTT-based polynomial multiplier architecture. In: 2019 22nd Euromicro Conference on Digital System Design (DSD), pp.\u00a0253\u2013260 (2019)","DOI":"10.1109\/DSD.2019.00045"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Soni, D., Nabeel, M., Karri, R., Maniatakos, M.: Optimizing constrained-modulus barrett multiplier for power and flexibility. In: 2023 IFIP\/IEEE 31st International Conference on Very Large Scale Integration (VLSI-SoC), pp.\u00a01\u20136. IEEE (2023)","DOI":"10.1109\/VLSI-SoC57769.2023.10321936"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC 2009, New York, NY, USA, pp.\u00a0169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-45239-0_4","volume-title":"Cryptography and Coding","author":"JW Bos","year":"2013","unstructured":"Bos, J.W., Lauter, K., Loftus, J., Naehrig, M.: Improved security for a ring-based fully homomorphic encryption scheme. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 45\u201364. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45239-0_4"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"5_CR17","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.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"5_CR18","unstructured":"Fan, J., Vercauteren, F.: Somewhat Practical Fully Homomorphic Encryption. Report Number: 144 (2012)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1666420.1666444","volume":"53","author":"C Gentry","year":"2010","unstructured":"Gentry, C.: Computing arbitrary functions of encrypted data. Commun. ACM 53, 97\u2013105 (2010)","journal-title":"Commun. ACM"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 465\u2013482. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_28"},{"key":"5_CR21","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012)"},{"key":"5_CR22","volume-title":"Number Theory: A Lively Introduction with Proofs, Applications, and Stories","author":"J Pommersheim","year":"2010","unstructured":"Pommersheim, J.: Number Theory: A Lively Introduction with Proofs, Applications, and Stories. Wiley, Hoboken (2010)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-48965-0_8","volume-title":"Cryptology and Network Security","author":"P Longa","year":"2016","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"},{"key":"5_CR24","unstructured":"Albrecht, M., et al.: Homomorphic encryption standard (2018)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850\u2013867. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_49"},{"key":"5_CR26","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: Crystals\u2013dilithium: digital signatures from module lattices (2018). https:\/\/pq-crystals.org\/dilithium\/index.shtml"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS P), pp.\u00a0353\u2013367 (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Nabeel, M., et al.: CoFHEE: a co-processor for fully homomorphic encryption execution. In: Design, Automation and Test in Europe (DATE) Conference (2023)","DOI":"10.23919\/DATE56975.2023.10137020"},{"key":"5_CR29","unstructured":"TSMC Limited: 1612nm technology. https:\/\/www.tsmc.com\/english\/dedicatedFoundry\/technology\/logic\/l_16_12nm. Accessed 19 Nov 2022"},{"key":"5_CR30","unstructured":"TSMC Fights back Intel in Terms of 16nm FinFET - CTIMES News. https:\/\/en.ctimes.com.tw\/DispNews.asp?O=HJY1GE204OGSAA00NK. Accessed 19 Nov 2022"}],"container-title":["IFIP Advances in Information and Communication Technology","VLSI-SoC 2023: Innovations for Trustworthy Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70947-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T10:02:50Z","timestamp":1735380170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70947-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031709463","9783031709470"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70947-0_5","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VLSI-SoC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP\/IEEE International Conference on Very Large Scale Integration - System on a Chip","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vlsi-soc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/vlsi-soc2023\/home?pli=1","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}