{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:45:01Z","timestamp":1764175501857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031411809"},{"type":"electronic","value":"9783031411816"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-41181-6_24","type":"book-chapter","created":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T19:02:38Z","timestamp":1696359758000},"page":"439-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Arithmetic for\u00a0Polynomial Multiplication in\u00a0Post-quantum Lattice-Based Cryptosystem on\u00a0RISC-V Platform"],"prefix":"10.1007","author":[{"given":"Haosong","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Rui","family":"Su","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jiankuo","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Donglong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,4]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.46586\/tches.v2022.i1.127-151","volume":"2022","author":"A Abdulrahman","year":"2022","unstructured":"Abdulrahman, A., Chen, J., Chen, Y., Hwang, V., Kannwischer, M.J., Yang, B.: Multi-moduli NTTs for saber on Cortex-M3 and Cortex-M4. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1), 127\u2013151 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i1.127-151","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-03356-8_19","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D.J.: Batch binary Edwards. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 317\u2013336. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_19"},{"doi-asserted-by":"publisher","unstructured":"Bodrato, M., Zanoni, A.: Integer and polynomial multiplication: towards optimal Toom-Cook matrices. In: Wang, D. (ed.) Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC 2007, Waterloo, Ontario, Canada, 28 July\u20131 August 2007, pp. 17\u201324. ACM (2007). https:\/\/doi.org\/10.1145\/1277548.1277552","key":"24_CR3","DOI":"10.1145\/1277548.1277552"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.46586\/tches.v2021.i2.159-188","volume":"2021","author":"CM Chung","year":"2021","unstructured":"Chung, C.M., Hwang, V., Kannwischer, M.J., Seiler, G., Shih, C., Yang, B.: NTT multiplication for NTT-unfriendly rings new speed records for Saber and NTRU on Cortex-M4 and AVX2. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(2), 159\u2013188 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i2.159-188","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-89339-6_16","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"J-P D\u2019Anvers","year":"2018","unstructured":"D\u2019Anvers, J.-P., Karmakar, A., Sinha Roy, S., Vercauteren, F.: Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 282\u2013305. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_16"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"414","DOI":"10.46586\/tches.v2022.i1.414-460","volume":"2022","author":"T Fritzmann","year":"2022","unstructured":"Fritzmann, T., et al.: Masked accelerators and instruction set extensions for post-quantum cryptography. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1), 414\u2013460 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i1.414-460","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.13154\/tches.v2020.i4.239-280","volume":"2020","author":"T Fritzmann","year":"2020","unstructured":"Fritzmann, T., Sigl, G., Sep\u00falveda, J.: RISQ-V: tightly coupled RISC-V accelerators for post-quantum cryptography. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(4), 239\u2013280 (2020). https:\/\/doi.org\/10.13154\/tches.v2020.i4.239-280","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"4","key":"24_CR8","doi-asserted-by":"publisher","first-page":"718","DOI":"10.46586\/tches.v2022.i4.718-750","volume":"2022","author":"V Hwang","year":"2022","unstructured":"Hwang, V., et al.: Verified NTT multiplications for NISTPQC KEM lattice finalists: Kyber, SABER, and NTRU. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(4), 718\u2013750 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i4.718-750","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"222","DOI":"10.13154\/tches.v2020.i2.222-244","volume":"2020","author":"JMB Mera","year":"2020","unstructured":"Mera, J.M.B., Karmakar, A., Verbauwhede, I.: Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(2), 222\u2013244 (2020). https:\/\/doi.org\/10.13154\/tches.v2020.i2.222-244","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"10","key":"24_CR10","doi-asserted-by":"publisher","first-page":"4068","DOI":"10.1109\/TCSII.2022.3184703","volume":"69","author":"Z Ye","year":"2022","unstructured":"Ye, Z., Cheung, R.C.C., Huang, K.: PipeNTT: a pipelined number theoretic transform architecture. IEEE Trans. Circ. Syst. II Express Briefs 69(10), 4068\u20134072 (2022). https:\/\/doi.org\/10.1109\/TCSII.2022.3184703","journal-title":"IEEE Trans. Circ. Syst. II Express Briefs"},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.13154\/tches.v2020.i2.49-72","volume":"2020","author":"N Zhang","year":"2020","unstructured":"Zhang, N., Yang, B., Chen, C., Yin, S., Wei, S., Liu, L.: Highly efficient architecture of NewHope-NIST on FPGA using low-complexity NTT\/INTT. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(2), 49\u201372 (2020). https:\/\/doi.org\/10.13154\/tches.v2020.i2.49-72","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41181-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T19:05:45Z","timestamp":1696359945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41181-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031411809","9783031411816"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41181-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"19 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sulab-sever.u-aizu.ac.jp\/ACNS2023\/committees.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"263","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":"53","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":"20% - 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":"3.9","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":"14.2","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":"For the workshops 34 full papers have been accepted from a total of 73 submissions; 13 poster papers are also included.","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)"}}]}}