{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T14:09:18Z","timestamp":1772201358784,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032155405","type":"print"},{"value":"9783032155412","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-15541-2_5","type":"book-chapter","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T20:07:45Z","timestamp":1769803665000},"page":"77-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Comparison of\u00a0Unified Multiplier Designs for\u00a0the\u00a0Falcon Post-quantum Digital Signature"],"prefix":"10.1007","author":[{"given":"Rahul","family":"Magesh","sequence":"first","affiliation":[]},{"given":"Modini","family":"Ayyagari","sequence":"additional","affiliation":[]},{"given":"Sharath","family":"Pendyala","sequence":"additional","affiliation":[]},{"given":"Aydin","family":"Aysu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,31]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Polynomial-Time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172","DOI":"10.1137\/S0097539795293172"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). https:\/\/doi.org\/10.1145\/359340.359342","DOI":"10.1145\/359340.359342"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theor. 22(6), 644\u2013654 (1976). https:\/\/ieeexplore.ieee.org\/document\/1055638","DOI":"10.1109\/TIT.1976.1055638"},{"key":"5_CR4","unstructured":"Fouque, P.A., et al.: Falcon: Fast-Fourier Lattice-based Compact Signatures over NTRU."},{"key":"5_CR5","unstructured":"I. T. L. Computer Security\u00a0Division, \u201cPost-Quantum Cryptography | CSRC | CSRC,\u201d (2017). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology (NIST), \u201cSHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions,\u201d U.S. Department of Commerce. Technical report. FIPS PUB 202, August 2015. https:\/\/doi.org\/10.6028\/NIST.FIPS.202","DOI":"10.6028\/NIST.FIPS.202"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract) In: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, ser. STOC \u201996. New York, NY, USA: Association for Computing Machinery, pp. 99\u2013108 (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"5_CR8","unstructured":"Bos, J.P.B., et al.: CRYSTALS-Dilithium: Algorithm Specifications and Supporting Documentation (Round 3 Submission) (2022). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-3-submissions, Accessed 22 Sep 2024"},{"key":"5_CR9","unstructured":"Bernstein, D., et al.: SPHINCS+: Submission to the NIST Post-Quantum Cryptography Standardization Project (Round 3) (2022). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-3-submissions, Accessed 22 Sep 2024"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Karabulut, E., Aysu, A.: A hardware-software co-design for the discrete gaussian sampling of FALCON digital signature. In: 2024 IEEE International Symposium on Hardware Oriented Security and Trust (HOST) (2024). https:\/\/ieeexplore.ieee.org\/document\/10545399\/","DOI":"10.1109\/HOST55342.2024.10545399"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Kim, Y., Song, J., Seo, S.C.: Accelerating Falcon on ARMv8. IEEE Access 10, 44\u00a0446\u201344\u00a0460 (2022). https:\/\/ieeexplore.ieee.org\/document\/9762260","DOI":"10.1109\/ACCESS.2022.3169784"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Lee, Y., et al.: An efficient hardware\/software co-design for FALCON on low-end embedded systems. IEEE Access 12, 57\u00a0947\u201357\u00a0958 (2024). https:\/\/ieeexplore.ieee.org\/document\/10496572","DOI":"10.1109\/ACCESS.2024.3387489"},{"key":"5_CR13","unstructured":"Schmid, M., Amiet, D., Wendler, J., Zbinden, P., Wei, T.: Falcon Takes Off - A Hardware Implementation of the Falcon Signature Scheme IACR Cryptol. ePrint Arch. (2023). https:\/\/www.semanticscholar.org\/paper\/Falcon-Takes-Off-A-Hardware-"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Yu, X., Sun, Y., Zhao, Y., Kuang, H., Han, J.: RVCE-FAL: A RISC-V Scalar-vector custom extension for faster FALCON digital signature. In: 2024 Design, Automation and Test in Europe Conference and Exhibition (DATE), pp. 1\u20136 (2024) iSSN: 1558-1101. https:\/\/ieeexplore.ieee.org\/document\/10546713","DOI":"10.23919\/DATE58400.2024.10546713"},{"key":"5_CR15","unstructured":"Qiu, J., Aysu, A.: SHIFT SNARE: uncovering secret keys in FALCON via single-trace analysis. Cryptology ePrint Archive, Paper 2025\/146, (2025). https:\/\/eprint.iacr.org\/2025\/146"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Ustun, E., San, I., Yin, J., Yu, C., Zhang, Z.: IMpress: large integer multiplication expression rewriting for FPGA HLS. In: 2022 IEEE 30th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), pp. 1\u201310. New York City, NY, USA: IEEE (2022). https:\/\/ieeexplore.ieee.org\/document\/9786123\/","DOI":"10.1109\/FCCM53951.2022.9786123"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Rafferty, C., O\u2019Neill, M., Hanley, N.: Evaluation of Large Integer Multiplication Methods on Hardware. In: IEEE Transactions on Computers, vol.\u00a066, no.\u00a08, pp. 1369\u20131382 (2017). https:\/\/ieeexplore.ieee.org\/document\/7869256\/","DOI":"10.1109\/TC.2017.2677426"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on Theory of computing, ser. STOC \u201909, pp. 169\u2013178. New York, NY, USA: Association for Computing Machinery (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"5_CR19","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 ECC for NIST curves. In: Proceedings of the 51st Annual Design Automation Conference, pp. 1\u20136. San Francisco CA USA: ACM (2014). https:\/\/doi.org\/10.1145\/2593069.2593234","DOI":"10.1145\/2593069.2593234"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Comba, P.G.: Exponentiation cryptosystems on the IBM PC. IBM Syst. J. 29(4), 526\u2013538 (1990). https:\/\/ieeexplore.ieee.org\/document\/5387492","DOI":"10.1147\/sj.294.0526"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Khan, S., Javeed, K., Shah, Y.A.: High-speed FPGA implementation of full-word Montgomery multiplier for ECC applications. Microprocess. Microsyst. 62, 91\u2013101 (2018). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0141933117302843","DOI":"10.1016\/j.micpro.2018.07.005"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Advances in Cryptology \u2013 CRYPTO \u201985, pp. 417\u2013426. Springer (1986)","DOI":"10.1007\/3-540-39799-X_31"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Ducas, L., Prest, T.: Fast Fourier Orthogonalization. In: Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, ser. ISSAC \u201916, pp. 191\u2013198. New York, NY, USA: Association for Computing Machinery (2016). https:\/\/doi.org\/10.1145\/2930889.2930923","DOI":"10.1145\/2930889.2930923"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Lee, W.K., Zhao, R.K., Steinfeld, R., Sakzad, A., Hwang, S.O.: High throughput lattice-based signatures on GPUs: comparing Falcon and Mitaka. IEEE Trans. Parallel Distrib. Syst. 35(4), 675\u2013692 (2024). https:\/\/ieeexplore.ieee.org\/document\/10440463","DOI":"10.1109\/TPDS.2024.3367319"},{"issue":"3\u20134","key":"5_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle multiplikation gro\u00dfer zahlen. Computing 7(3\u20134), 281\u2013292 (1971)","journal-title":"Computing"},{"issue":"170","key":"5_CR27","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"5_CR28","first-page":"214","volume":"4","author":"A Toom","year":"1963","unstructured":"Toom, A.: The complexity of multiplication. Sib. Math. J. 4, 214\u2013216 (1963)","journal-title":"Sib. Math. J."},{"key":"5_CR29","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Physics Doklady, vol.\u00a07, pp. 595\u2013596 (1963) originally published in Russian in 1962"},{"key":"5_CR30","unstructured":"Karatsuba algorithm for fast multiplication using Divide and Conquer algorithm section: Divide and Conquer (2013). https:\/\/www.geeksforgeeks.org\/karatsuba-algorithm-for-fast-multiplication-using-"},{"key":"5_CR31","unstructured":"Skywater SKY130 PDK documentation. https:\/\/skywater-pdk.readthedocs.io\/en\/main\/index.html"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Shalan, M., Edwards, T.: Building OpenLANE: a 130nm openroad-based tapeout- proven flow: invited paper. In: IEEE\/ACM International Conference On Computer Aided Design (ICCAD), pp. 1\u20136 (2020)","DOI":"10.1145\/3400302.3415735"},{"key":"5_CR33","unstructured":"7 Series DSP48E1 Slice User Guide (UG479) (2018)"},{"key":"5_CR34","unstructured":"7 Series FPGAs Data Sheet: Overview (DS180) (2020)"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Tu, Y., He, P., Ko\u00e7, K., Xie, J.: LEAP: Lightweight and efficient accelerator for sparse polynomial multiplication of HQC. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 31(6) 892\u2013896 (2023). https:\/\/ieeexplore.ieee.org\/document\/10068178\/","DOI":"10.1109\/TVLSI.2023.3246923"}],"container-title":["Lecture Notes in Computer Science","Lightweight Cryptography for Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15541-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T13:13:58Z","timestamp":1772198038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15541-2_5"}},"subtitle":["A Case Study of Baseline, Tiling, Comba and Karatsuba Approaches for FPGA and ASIC"],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032155405","9783032155412"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15541-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"31 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LightSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Lightweight Cryptography for Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","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":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lightsec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.encrypt-on.com\/activities\/conferences\/lightsec-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}