{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T11:40:08Z","timestamp":1750506008001,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072019"],"award-info":[{"award-number":["62072019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation","award":["L243031"],"award-info":[{"award-number":["L243031"]}]},{"name":"National Key R&D Program of China","award":["2023YFB4503704 and 2024YFB4505601"],"award-info":[{"award-number":["2023YFB4503704 and 2024YFB4505601"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,21]]},"DOI":"10.1145\/3695053.3731033","type":"proceedings-article","created":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T16:43:11Z","timestamp":1750437791000},"page":"65-77","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Finesse: An Agile Design Framework for Pairing-based Cryptography via Software\/Hardware Co-Design"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6633-4076","authenticated-orcid":false,"given":"Tianwei","family":"Pan","sequence":"first","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3164-048X","authenticated-orcid":false,"given":"Tianao","family":"Dai","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8424-7040","authenticated-orcid":false,"given":"Jianlei","family":"Yang","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0202-5065","authenticated-orcid":false,"given":"Hongbin","family":"Jing","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3293-7709","authenticated-orcid":false,"given":"Yang","family":"Su","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0175-6938","authenticated-orcid":false,"given":"Zeyu","family":"Hao","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2207-6092","authenticated-orcid":false,"given":"Xiaotao","family":"Jia","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3473-9703","authenticated-orcid":false,"given":"Chunming","family":"Hu","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8088-0404","authenticated-orcid":false,"given":"Weisheng","family":"Zhao","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_13"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_27"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Dan Boneh Ben Lynn and Hovav Shacham. 2004. Short signatures from the Weil pairing. Journal of cryptology 17 (2004) 297\u2013319. 10.1007\/s00145-004-0314-9","DOI":"10.1007\/s00145-004-0314-9"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_3_1_7_2","unstructured":"Relic-toolkit. 2024. RELIC: a modern research-oriented cryptographic meta-toolkit with emphasis on efficiency and flexibility. https:\/\/github.com\/relic-toolkit\/relic. Accessed: 2024-10-18."},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Reza Azarderakhsh Dieter Fishbein Gurleen Grewal Shi Hu David Jao Patrick Longa and Rajeev Verma. 2017. Fast software implementations of bilinear pairings. IEEE Transactions on Dependable and Secure Computing (TDSC) 14 6 (2017) 605\u2013619. 10.1109\/TDSC.2015.2507120","DOI":"10.1109\/TDSC.2015.2507120"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Xinyi Hu Debiao He Min Luo Cong Peng Qi Feng and Xinyi Huang. 2023. High-Performance Implementation of the Identity-Based Signature Scheme in IEEE P1363 on GPU. ACM Transactions on Embedded Computing Systems (TAAS) 22 2 (2023) 1\u201335. 10.1145\/3564784","DOI":"10.1145\/3564784"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Junichi Sakamoto Daisuke Fujimoto Riku Anzai Naoki Yoshida and Tsutomu Matsumoto. 2024. High-Throughput Bilinear Pairing Processor for Server-Side FPGA Applications. IEEE Transactions on Very Large Scale Integration (VLSI) Systems (TVLSI) 32 8 (2024) 1498\u20131511. 10.1109\/TVLSI.2024.3152921","DOI":"10.1109\/TVLSI.2024.3152921"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/A-SSCC47793.2019.9056951"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00011"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Georgios Fotiadis and Elisavet Konstantinou. 2019. TNFS resistant families of pairing-friendly elliptic curves. Theoretical Computer Science (TCS) 800 (2019) 73\u201389. 10.1016\/j.tcs.2019.10.017","DOI":"10.1016\/j.tcs.2019.10.017"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48800-3_2"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_2"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","unstructured":"Diego\u00a0F Aranha Youssef El\u00a0Housni and Aurore Guillevic. 2023. A survey of elliptic curves for proof systems. Designs Codes and Cryptography 91 11 (2023) 3333\u20133378. 10.1007\/s10623-022-01135-y","DOI":"10.1007\/s10623-022-01135-y"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","unstructured":"A\u00a0Tengfei Wang B\u00a0Wei Guo and C\u00a0Jizeng Wei. 2019. Highly-parallel hardware implementation of optimal ate pairing over Barreto-Naehrig curves. Integration the VLSI Journal (Integration) 64 (2019) 13\u201321. 10.1016\/j.vlsi.2018.04.013","DOI":"10.1016\/j.vlsi.2018.04.013"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","unstructured":"Arnab Bag Debapriya\u00a0Basu Roy Sikhar Patranabis and Debdeep Mukhopadhyay. 2022. Flexipair: an automated programmable framework for pairing cryptosystems. IEEE Transactions on Computers (TC) 71 3 (2022) 506\u2013519. 10.1109\/TC.2021.3058345","DOI":"10.1109\/TC.2021.3058345"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","unstructured":"Oussama Azzouzi Mohamed Anane Mouloud Koudil Mohamed Issad and Yassine Himeur. 2024. Novel area-efficient and flexible architectures for optimal Ate pairing on FPGA. The Journal of Supercomputing (TJSC) 80 2 (2024) 2633\u20132659. 10.1007\/s11227-023-05578-5","DOI":"10.1007\/s11227-023-05578-5"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","unstructured":"Frederik Vercauteren. 2010. Optimal pairings. IEEE Transactions on Information Theory (TIT) 56 1 (2010) 455\u2013461. 10.1109\/TIT.2009.2034881","DOI":"10.1109\/TIT.2009.2034881"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","unstructured":"David Freeman Michael Scott and Edlyn Teske. 2010. A taxonomy of pairing-friendly elliptic curves. Journal of Cryptology 23 (2010) 224\u2013280. 10.1007\/s00145-009-9048-z","DOI":"10.1007\/s00145-009-9048-z"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_23"},{"key":"e_1_3_3_1_23_2","unstructured":"Augusto\u00a0Jun Devegili Colm OhEigertaigh Michael Scott and Ricardo Dahab. 2006. Multiplication and squaring on pairing-friendly fields. Cryptology ePrint Archive (2006)."},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73489-5_10"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28496-0_25"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Yujun Xie Bin Wang Lijun Zhang Xin Zheng Xiaoling Lin Xiaoming Xiong and Yuan Liu. 2022. A high-performance processor for optimal ate pairing computation over Barreto\u2013Naehrig curves. IET Circuits Devices & Systems 16 5 (2022) 427\u2013436. 10.1049\/cds2.12116","DOI":"10.1049\/cds2.12116"},{"key":"e_1_3_3_1_28_2","unstructured":"Shigeo Mitsunari. 2024. MCL: a portable and fast pairing-based cryptography library. https:\/\/github.com\/herumi\/mcl. Accessed: 2024-10-18."},{"key":"e_1_3_3_1_29_2","unstructured":"MIRACL. 2024. MIRACL: Multiprecision Integer and Rational Arithmetic Cryptographic Library. https:\/\/github.com\/miracl\/MIRACL. Accessed: 2024-10-18."},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2007.11"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","unstructured":"Aaron Stillmaker and Bevan Baas. 2017. Scaling equations for the accurate prediction of CMOS device performance from 180 nm to 7 nm. Integration the VLSI Journal (Integration) 58 (2017) 74\u201381. 10.1016\/j.vlsi.2017.02.002","DOI":"10.1016\/j.vlsi.2017.02.002"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","unstructured":"Xiaofeng Wang Peng Zheng and Qianqian Xing. 2023. Security Analysis of Pairing-based Cryptography. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2309.04693 (2023). 10.48550\/arXiv.2309.04693","DOI":"10.48550\/arXiv.2309.04693"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","unstructured":"Razvan Barbulescu and Sylvain Duquesne. 2019. Updating key size estimations for pairings. Journal of Cryptology 32 (2019) 1298\u20131336. 10.1007\/s00145-018-9280","DOI":"10.1007\/s00145-018-9280"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53018-4_20"}],"event":{"name":"ISCA '25: Proceedings of the 52nd Annual International Symposium on Computer Architecture","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Tokyo Japan","acronym":"SIGARCH '25"},"container-title":["Proceedings of the 52nd Annual International Symposium on Computer Architecture"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3695053.3731033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T10:59:22Z","timestamp":1750503562000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695053.3731033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,20]]},"references-count":33,"alternative-id":["10.1145\/3695053.3731033","10.1145\/3695053"],"URL":"https:\/\/doi.org\/10.1145\/3695053.3731033","relation":{},"subject":[],"published":{"date-parts":[[2025,6,20]]},"assertion":[{"value":"2025-06-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}