{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:45:36Z","timestamp":1765370736158,"version":"3.46.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032133007","type":"print"},{"value":"9783032133014","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-13301-4_2","type":"book-chapter","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:45Z","timestamp":1765357965000},"page":"21-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["High-Performance FPGA Implementation of\u00a0a\u00a0Recursive Modular Karatsuba Multiplier over\u00a0$$GF(2^m)$$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4739-2198","authenticated-orcid":false,"given":"Ruby","family":"Kumari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4375-4107","authenticated-orcid":false,"given":"Sumeet","family":"Saurav","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4681-1998","authenticated-orcid":false,"given":"Abhijit","family":"Karmakar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"2_CR1","unstructured":"Deschamps, J.-P.: Hardware Implementation of Finite-Field Arithmetic. McGraw-Hill, Inc., Boston (2009)"},{"key":"2_CR2","volume-title":"Cryptography and Network Security: Principles and Practice (Global Edition-)","author":"S Willam","year":"2022","unstructured":"Willam, S.: Cryptography and Network Security: Principles and Practice (Global Edition-). Pearson Education, Boston (2022)"},{"key":"2_CR3","unstructured":"Kumari, R., Pandey, J.G., Karmakar, A.: An rtl implementation of the data encryption standard (des). arXiv preprint arXiv:2301.05530 (2023)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Inoguchi, Y.: Outline of the ultra fine grained parallel processing by fpga. In: Proceedings. Seventh International Conference on High Performance Computing and Grid in Asia Pacific Region, 2004, pp. 434\u2013441. IEEE (2004)","DOI":"10.1109\/HPCASIA.2004.1324071"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Kumari, R., Rout, T., Saini, B., Pandey, J.G., Karmakar, A.: An efficient hardware implementation of elliptic curve point multiplication over gf (2 m) on fpga. In: International Symposium on VLSI Design and Test, pp. 257\u2013271. Springer, Heidelberg (2023)","DOI":"10.1007\/978-981-97-3756-7_20"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-319-76953-0_7","volume-title":"Topics in Cryptology \u2013 CT-RSA 2018","author":"H Chen","year":"2018","unstructured":"Chen, H., Laine, K., Player, R., Xia, Y.: High-precision arithmetic in\u00a0homomorphic encryption. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 116\u2013136. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_7"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Liu, F., Tian, K.: An unbounded fully homomorphic encryption scheme based on ideal lattices and Chinese remainder theorem. arXiv preprint arXiv:2301.12060 (2023)","DOI":"10.4236\/jis.2023.144021"},{"key":"2_CR8","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"2_CR9","unstructured":"Huang, J ., Lee, J., Li, H.: A fast fpga implementation of tate pairing in cryptography over binary field. In: Security and Management, pp. 3\u20139 (2008)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Arish, S.,\u00a0Sharma, R.K: An efficient floating point multiplier design for high speed applications using karatsuba algorithm and urdhva-tiryagbhyam algorithm. In: 2015 International Conference on Signal Processing and Communication (ICSC), pp. 303\u2013308. IEEE (2015)","DOI":"10.1109\/ICSPCom.2015.7150666"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Prema, C.,\u00a0Mainkanda Babu, C.S.: Enhanced high speed modular multiplier using karatsuba algorithm. In: 2013 International Conference on Computer Communication and Informatics, pp. 1\u20135. IEEE (2013)","DOI":"10.1109\/ICCCI.2013.6466302"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Lee, T.Y., Liu, M.J., Fan, C.C., Tsai, C.C., Wu, H.: Low complexity digit-serial multiplier over gf (2$$\\hat{\\,}$$ m) using karatsuba technology. In: 2013 Seventh International Conference on Complex, Intelligent, and Software Intensive Systems, pp. 461\u2013466. IEEE (2013)","DOI":"10.1109\/CISIS.2013.84"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4316\/AECE.2013.02001","volume":"13","author":"E Cuevas-Farfan","year":"2013","unstructured":"Cuevas-Farfan, E., et al.: Karatsuba-ofman multiplier with integrated modular reduction for (2) m gf. Adv. Electr. Comput. Eng. 13(2), 1\u20135 (2013)","journal-title":"Adv. Electr. Comput. Eng."},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.5573\/JSTS.2022.22.2.53","volume":"22","author":"J Renita","year":"2022","unstructured":"Renita, J., Asokan, N., et al.: Implementation and performance analysis of elliptic curve cryptography using an efficient multiplier. J. Semiconductor Technol. Sci. 22(2), 53\u201360 (2022)","journal-title":"J. Semiconductor Technol. Sci."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Kumari, R., Purohit, G., Karmakar, A.: Efficient hardware implementation of modular multiplier over gf (2$$\\hat{\\,}$$ m) on fpga. arXiv preprint arXiv:2506.09464 (2025)","DOI":"10.1007\/978-981-97-3756-7_20"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Chen, H., Jiang, Y., Jin, B.: Scalable karatsuba multiplier over finite field gf (2 m). In: Informatics and Management Science I, pp. 79\u201384. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-1-4471-4802-9_11","DOI":"10.1007\/978-1-4471-4802-9_11"},{"issue":"7","key":"2_CR17","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1080\/02533839.2019.1644200","volume":"42","author":"T-Y Lee","year":"2019","unstructured":"Lee, T.-Y., Liu, M.-J., Huang, C.-H., Fan, C.-C., Tsai, C.-C., Haixia, W.: Design of a digit-serial multiplier over gf (2 m) using a karatsuba algorithm. J. Chin. Inst. Eng. 42(7), 602\u2013612 (2019)","journal-title":"J. Chin. Inst. Eng."},{"key":"2_CR18","unstructured":"Cheng, Y.: Space-efficient karatsuba multiplication for multi-precision integers. arXiv preprint arXiv:1605.06760 (2016)"},{"key":"2_CR19","unstructured":"Wikipedia contributors. Karatsuba algorithm\u2014wikipedia (2025). https:\/\/en.wikipedia.org\/wiki\/Karatsuba_algorithm. Accessed 10 Sept 2025"},{"key":"2_CR20","unstructured":"MIT OpenCourseWare. Lecture 11: Integer arithmetic, karatsuba multiplication (2011). URL https:\/\/ocw.mit.edu\/courses\/6-006-introduction-to-algorithms-fall-2011\/MIT6_006F11_lec11.pdf. Accessed 10 Sept 2025"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.54254\/2755-2721\/69\/20241470","volume":"69","author":"J Zhang","year":"2024","unstructured":"Zhang, J.: Efficiency of large integer multiplication algorithms: a comparative study of traditional methods and karatsuba\u2019s algorithm. Appl. Comput. Eng. 69, 30\u201336 (2024)","journal-title":"Appl. Comput. Eng."},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Chow, G.C.T.,\u00a0Eguro, K.,\u00a0Luk, W.,\u00a0Leong, P.: A karatsuba-based montgomery multiplier. In: Proceedings of the 2010 International Conference on Field Programmable Logic and Applications, pp. 1\u20136 (2010)","DOI":"10.1109\/FPL.2010.89"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Jain, R.,\u00a0Pahwa, K.,\u00a0Pandey, N.: Booth-encoded karatsuba: a novel hardware-efficient multiplier. In: Proceedings of the 2021 International Conference on VLSI Design, pp. 1\u20136 (2021)","DOI":"10.15598\/aeee.v19i3.4199"},{"key":"2_CR24","unstructured":"Kabin, I.,\u00a0Dyka, Z.,\u00a0Kreiser, D.,\u00a0Langendoerfer, P.: Unified field multiplier for ecc: inherent resistance against horizontal sca attacks. arXiv preprint arXiv:2201.01147 (2022)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Pogue, T.E.,\u00a0Nicolici, N.: Karatsuba matrix multiplication and its efficient custom hardware implementations. arXiv preprint arXiv:2501.08889 (2025)","DOI":"10.1109\/TC.2025.3525606"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Liu, R., Li, S.: A design and implementation of montgomery modular multiplier. In: 2019 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1\u20134. IEEE (2019)","DOI":"10.1109\/ISCAS.2019.8702684"},{"issue":"11","key":"2_CR27","doi-asserted-by":"publisher","first-page":"1470","DOI":"10.1109\/TC.2007.70741","volume":"56","author":"N Petra","year":"2007","unstructured":"Petra, N., De Caro, D., Strollo, A.G.M.: A novel architecture for galois fields gf (2$$\\hat{\\,}$$ m) multipliers based on mastrovito scheme. IEEE Trans. Comput. 56(11), 1470\u20131483 (2007)","journal-title":"IEEE Trans. Comput."},{"issue":"5\u20136","key":"2_CR28","first-page":"487","volume":"23","author":"N Mentens","year":"2004","unstructured":"Mentens, N., Ors, S.B., Preneel, B., Vandewalle, J.: An fpga implementation of a montgomery multiplier over gf (2$$\\hat{\\,}$$ m). Comput. Inf. 23(5\u20136), 487\u2013499 (2004)","journal-title":"Comput. Inf."},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.micpro.2016.07.008","volume":"47","author":"Y Yang","year":"2016","unstructured":"Yang, Y., Chao, W., Li, Z., Yang, J.: Efficient fpga implementation of modular multiplication based on montgomery algorithm. Microprocess. Microsyst. 47, 209\u2013215 (2016)","journal-title":"Microprocess. Microsyst."},{"issue":"1","key":"2_CR30","first-page":"58","volume":"63","author":"JL Ima\u00f1a","year":"2015","unstructured":"Ima\u00f1a, J.L.: High-speed polynomial basis multipliers over $$gf(2^m)$$ for special pentanomials. IEEE Trans. Circ. Syst. I: Reg. Pap. 63(1), 58\u201369 (2015)","journal-title":"IEEE Trans. Circ. Syst. I: Reg. Pap."},{"key":"2_CR31","unstructured":"Samanta, J., Sultana, R., Bhaumik, J.: Fpga based modified karatsuba multiplier. In: Proceedings of International Conference VLSI Signal Processing (ICVSP), vol. 10, p.\u00a012 (2014)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13301-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:51Z","timestamp":1765357971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13301-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"ISBN":["9783032133007","9783032133014"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13301-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"11 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneshwar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}