{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T04:54:34Z","timestamp":1777006474569,"version":"3.51.4"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T00:00:00Z","timestamp":1674518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100018532","name":"Major Scientific and Technological Innovation Project of Shandong Province","doi-asserted-by":"crossref","award":["2020CXGC010115, 2020CXGC010107"],"award-info":[{"award-number":["2020CXGC010115, 2020CXGC010107"]}],"id":[{"id":"10.13039\/501100018532","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U21A20466, 62172307, 61972294, and 61932016"],"award-info":[{"award-number":["U21A20466, 62172307, 61972294, and 61932016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Special Project on Science and Technology Program of Hubei Provience","award":["2020AEA013"],"award-info":[{"award-number":["2020AEA013"]}]},{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"crossref","award":["2020CFA052"],"award-info":[{"award-number":["2020CFA052"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Wuhan Municipal Science and Technology Project","award":["2020010601012187"],"award-info":[{"award-number":["2020010601012187"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>\n            Identity-based cryptography is proposed to solve the complicated certificate management of traditional public-key cryptography. The pairing computation and high-level tower extension field arithmetic turn out to be the performance bottleneck of pairing-based signature schemes. Graphics processing units have been increasingly popular for general-purpose computing in recent years. They have shown a lot of promise in speeding up cryptographic schemes such as AES, RSA, and ECDSA. However, to our knowledge, the research on parallel implementation of pairings and identity-based cryptographic schemes on graphics processing units is somewhat outdated. Therefore, in this article, we implement the identity-based signature scheme in the IEEE P1363 Standard on a modern NVIDIA RTX 3060 card. We convert the pairing computation in signature verification into a product of pairings with fixed arguments and therefore avoid the scalar multiplication in \ud835\udd3e\n            <jats:sub>2<\/jats:sub>\n            . Then we employ the precomputation technique to improve the elliptic curve scalar multiplication, exponentiation in\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(\\mathbb {F}_{p^{12}}\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            and the pairing computation. We also apply PTX ISA to multiple-precision arithmetic. Experiments demonstrate that our implementation can perform 43,856\/46,753\/39,798 pairings\/sec for the Optimal Ate pairing, the pairing with a fixed argument, and two pairings with fixed arguments, respectively. Peak throughputs of signature generation and verification can achieve 322.6 and 40.6 kops\/sec over the BN254 curve.\n          <\/jats:p>","DOI":"10.1145\/3564784","type":"journal-article","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T11:24:58Z","timestamp":1664277898000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["High-Performance Implementation of the Identity-Based Signature Scheme in IEEE P1363 on GPU"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9900-1713","authenticated-orcid":false,"given":"Xinyi","family":"Hu","sequence":"first","affiliation":[{"name":"Wuhan University and Qilu University of Technology (Shandong Academy of Sciences), Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2446-7436","authenticated-orcid":false,"given":"Debiao","family":"He","sequence":"additional","affiliation":[{"name":"Wuhan University and MatrixElements Technologies, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1819-9332","authenticated-orcid":false,"given":"Min","family":"Luo","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9958-3255","authenticated-orcid":false,"given":"Cong","family":"Peng","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6927-7855","authenticated-orcid":false,"given":"Qi","family":"Feng","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0070-1707","authenticated-orcid":false,"given":"Xinyi","family":"Huang","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,24]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43414-7_1"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_5"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.3390\/computation9120142"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2507120"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPL50879.2020.00038"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2003.1199336"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_28"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_22"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_28"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17455-1_2"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9005-7"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_13"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_30"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38553-7_2"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_2"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2007.11"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06320-1_16"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73489-5_10"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86130-8_17"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3492734"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1994-1218343-6"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3098987"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/11745853_17"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_25"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_13"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_30_2","volume-title":"Guide to Elliptic Curve Cryptography","author":"Hankerson Darrel","year":"2006","unstructured":"Darrel Hankerson, Alfred J. Menezes, and Scott Vanstone. 2006. Guide to Elliptic Curve Cryptography. Springer Science & Business Media, New York, NY."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36492-7_20"},{"key":"e_1_3_2_32_2","first-page":"293","volume-title":"Doklady Akademii Nauk (Proceedings of the USSR Academy of Sciences)","author":"Karatsuba Anatolii Alekseevich","year":"1962","unstructured":"Anatolii Alekseevich Karatsuba and Yu P. Ofman. 1962. Multiplication of many-digital numbers by automatic computers. In Doklady Akademii Nauk (Proceedings of the USSR Academy of Sciences). Russian Academy of Sciences, Moscow, Russia, 293\u2013294."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/40.502403"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-97348-3_11"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2013048"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-70665-4_115"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.5555\/548089"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14712-8_7"},{"key":"e_1_3_2_40_2","unstructured":"NVIDIA. 2022. cuRAND Library. Retrieved February 22 2022 from https:\/\/docs.nvidia.com\/cuda\/curand\/index.html."},{"key":"e_1_3_2_41_2","unstructured":"NVIDIA. 2022. Parallel Thread Execution ISA Version 7.6. Retrieved February 22 2022 from https:\/\/docs.nvidia.com\/cuda\/parallel-thread-execution\/index.html."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/10722028_23"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1995.465359"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2603974"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:20020682"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/11780656_18"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04873-4_1"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.3022797"},{"key":"e_1_3_2_49_2","unstructured":"Michael Scott. 2019. Pairing Implementation Revisited. Retrieved October 5 2022 from https:\/\/eprint.iacr.org\/2019\/077.pdf."},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03298-1_6"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_5"},{"key":"e_1_3_2_52_2","unstructured":"Brian Smith. 2017. The Most Efficient Known Addition Chains for Field Element & Scalar Inversion for the Most Popular & Most Unpopular Elliptic Curves. Retrieved February 22 2022 from https:\/\/briansmith.org\/ecc-inversion-addition-chains-01."},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85053-3_6"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2656-7_33"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034881"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2018.04.013"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2016.2605087"},{"issue":"592","key":"e_1_3_2_58_2","first-page":"149","article-title":"Sur les fonctions alg\u00e9briquesa corps de constantes fini","volume":"210","author":"Weil Andr\u00e9","year":"1940","unstructured":"Andr\u00e9 Weil. 1940. Sur les fonctions alg\u00e9briquesa corps de constantes fini. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences (Paris) 210, 592-594 (1940), 149.","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences (Paris)"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2013.6662370"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240771"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17533-1_31"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2329681"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15087-1_23"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564784","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:23Z","timestamp":1750182683000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,24]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1145\/3564784"],"URL":"https:\/\/doi.org\/10.1145\/3564784","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,24]]},"assertion":[{"value":"2022-05-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-19","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-01-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}