{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:29:34Z","timestamp":1742999374092,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819997848"},{"type":"electronic","value":"9789819997855"}],"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-981-99-9785-5_26","type":"book-chapter","created":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T18:02:05Z","timestamp":1706983325000},"page":"368-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardware Implementation and\u00a0Optimization of\u00a0Critical Modules of\u00a0SM9 Digital Signature Algorithm"],"prefix":"10.1007","author":[{"given":"Yujie","family":"Shao","sequence":"first","affiliation":[]},{"given":"Tian","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Li","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,4]]},"reference":[{"key":"26_CR1","unstructured":"State Cryptography Administration. SM9 Identification Cryptography Algorithm (2016:3). GM\/T 0044.2016"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1049\/cje.2017.09.008","volume":"27","author":"H Zhu","year":"2018","unstructured":"Zhu, H., Tan, Y., Yu, X., et al.: An identity-based proxy signature on NTRU lattice. Chin. J. Electron. 27(2), 297\u2013303 (2018)","journal-title":"Chin. J. Electron."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Zhu, H., Tan, Y., Zhu, L., et al.: An efficient identity-based proxy blind signature for semioffline services. Wirel. Commun. Mob. Comput. (2018)","DOI":"10.1155\/2018\/5401890"},{"issue":"10","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1587\/elex.18.20210135","volume":"18","author":"H Xiao","year":"2021","unstructured":"Xiao, H., Liu, Y., Li, Z., Liu, G.: Algorithm-hardware co-design of ultra-high radix based high throughput modular multiplier. IEICE Electron. Express 18(10), 1\u20136 (2021)","journal-title":"IEICE Electron. Express"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Zhen, P., Tu, Y., Xia, B., et al.: Research on the miller loop optimization of SM9 bilinear pairings. In: 2017 IEEE 17th International Conference on Communication Technology (ICCT), pp. 138\u2013144. IEEE (2017)","DOI":"10.1109\/ICCT.2017.8359619"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.vlsi.2018.04.013","volume":"64","author":"AT Wang","year":"2019","unstructured":"Wang, A.T., Guo, B.W., Wei, C.J.: Highly-parallel hardware implementation of optimal ate pairing over Barreto-Naehrig curves. Integration 64, 13\u201321 (2019)","journal-title":"Integration"},{"issue":"170","key":"26_CR7","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."},{"issue":"7","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1109\/TVLSI.2010.2049037","volume":"19","author":"A Miyamoto","year":"2010","unstructured":"Miyamoto, A., Homma, N., Aoki, T., et al.: Systematic design of RSA processors based on high-radix Montgomery multipliers. IEEE Trans. Very Large Scale Integration (VLSI) Syst. 19(7), 1136\u20131146 (2010)","journal-title":"IEEE Trans. Very Large Scale Integration (VLSI) Syst."},{"key":"26_CR9","unstructured":"Karatsuba, A.A.: The complexity of computations. In: Proceedings of the Steklov Institute of Mathematics-Interperiodica Translation, vol. 211, pp. 169\u2013183 (1995)"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/TCAD.2006.887923","volume":"26","author":"W Sun","year":"2007","unstructured":"Sun, W., Wirthlin, M.J., Neuendorffer, S.: FPGA pipeline synthesis design exploration using module selection and resource sharing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 26(2), 254\u2013265 (2007)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Hao, Z., Guo, W., Wei, J., et al.: Dual processing engine architecture to speed up optimal ate pairing on FPGA platform. In: 2016 IEEE Trustcom\/BigDataSE\/ISPA, pp. 584\u2013589. IEEE (2016)","DOI":"10.1109\/TrustCom.2016.0113"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11496618_13","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"S Chatterjee","year":"2005","unstructured":"Chatterjee, S., Sarkar, P., Barua, R.: Efficient computation of Tate pairing in projective coordinate over general characteristic fields. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 168\u2013181. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496618_13"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the final exponentiation for calculating pairings on ordinary elliptic curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 78\u201388. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1_6"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Amiet D, Curiger A, Zbinden P. Flexible FPGA-based architectures for curve point multiplication over GF(p), pp. 107\u2013114. IEEE (2016)","DOI":"10.1109\/DSD.2016.70"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"73898","DOI":"10.1109\/ACCESS.2020.2988379","volume":"8","author":"MM Islam","year":"2020","unstructured":"Islam, M.M., Hossain, M.S., Shahjalal, M., Hasan, M.K., Jang, Y.M.: Area-time efficient hardware implementation of modular multiplication for elliptic curve cryptography. IEEE Access 8, 73898\u201373906 (2020)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-9785-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T18:12:51Z","timestamp":1706983971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-9785-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819997848","9789819997855"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-9785-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"4 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIS&P","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"3 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ais&p2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/aisp2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"115","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23 large model and security workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}