{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:48:42Z","timestamp":1768517322377,"version":"3.49.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031562341","type":"print"},{"value":"9783031562358","type":"electronic"}],"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-3-031-56235-8_8","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:02:34Z","timestamp":1711634554000},"page":"153-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Implementing Lattice-Based PQC on\u00a0Resource-Constrained Processors:"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2432-482X","authenticated-orcid":false,"given":"Lu","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9221-4230","authenticated-orcid":false,"given":"Mingqiang","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6982-2537","authenticated-orcid":false,"given":"Weijia","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"8_CR1","unstructured":"Cortex-M0 technical reference manual. http:\/\/infocenter.arm.com\/help\/topic\/com.arm.doc.ddi0432c\/DDI0432C_cortex_m0_r0p0_trm.pdf"},{"key":"8_CR2","unstructured":"Cortex-M0+ technical reference manual. http:\/\/infocenter.arm.com\/help\/topic\/com.arm.doc.ddi0484b\/DDI0484B_cortex_m0p_r0p0_trm.pdf"},{"key":"8_CR3","unstructured":"The eXtended Keccak code package. https:\/\/github.com\/XKCP\/XKCP\/blob\/master\/lib\/low\/KeccakP-1600\/ARM"},{"key":"8_CR4","doi-asserted-by":"publisher","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","DOI":"10.46586\/tches.v2022.i1.127-151"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/978-3-031-09234-3_42","volume-title":"Applied Cryptography and Network Security","author":"A Abdulrahman","year":"2022","unstructured":"Abdulrahman, A., Hwang, V., Kannwischer, M.J., Sprenkels, D.: Faster Kyber and Dilithium on the cortex-M4. In: Ateniese, G., Venturi, D. (eds.) ACNS 2022. LNCS, vol. 13269, pp. 853\u2013871. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_42"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Alagic, G., et al.: NISTIR8309-status report on the second round of the NIST post-quantum cryptography standardization process (2020). https:\/\/doi.org\/10.6028\/NIST.IR.8309","DOI":"10.6028\/NIST.IR.8309"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Alkim, E., Evkan, H., Lahr, N., Niederhagen, R., Petri, R.: ISA extensions for finite field arithmetic accelerating Kyber and NewHope on RISC-V. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(3), 219\u2013242 (2020). https:\/\/doi.org\/10.13154\/tches.v2020.i3.219-242","DOI":"10.13154\/tches.v2020.i3.219-242"},{"key":"8_CR8","unstructured":"Avanzi, R., et al.: CRYSTALS-Kyber (version 3.0). NIST Post-Quantum Cryptography Standardization Project (2020). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/post-quantum-cryptography\/documents\/round-3\/submissions\/Kyber-Round3.zip"},{"key":"8_CR9","unstructured":"Bai, S., et al.: CRYSTALS-Dilithium. NIST Post-Quantum Cryptography Standardization Project (2020). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/post-quantum-cryptography\/documents\/round-3\/submissions\/Dilithium-Round3.zip"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-47721-7_24","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"P Barrett","year":"1987","unstructured":"Barrett, P.: Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311\u2013323. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_24"},{"key":"8_CR11","unstructured":"Basso, A., et al.: SABER: mod-LWR based KEM (round 3 submission). NIST Post-Quantum Cryptography Standardization Project (2020). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/post-quantum-cryptography\/documents\/round-3\/submissions\/SABER-Round3.zip"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Becker, H., Hwang, V., Kannwischer, M.J., Yang, B., Yang, S.: Neon NTT: faster Dilithium, Kyber, and Saber on cortex-A72 and apple M1. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1), 221\u2013244 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i1.221-244","DOI":"10.46586\/tches.v2022.i1.221-244"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-030-23696-0_11","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2019","author":"L Botros","year":"2019","unstructured":"Botros, L., Kannwischer, M.J., Schwabe, P.: Memory-efficient high-speed implementation of Kyber on cortex-M4. In: Buchmann, J., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2019. LNCS, vol. 11627, pp. 209\u2013228. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23696-0_11"},{"key":"8_CR14","unstructured":"Chen, C., et al.: NTRU. NIST Post-Quantum Cryptography Standardization Project (2020). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/post-quantum-cryptography\/documents\/round-3\/submissions\/NTRU-Round3.zip"},{"key":"8_CR15","doi-asserted-by":"publisher","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","DOI":"10.46586\/tches.v2021.i2.159-188"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1090\/S0002-9947-1969-0249212-8","volume":"142","author":"SA Cook","year":"1969","unstructured":"Cook, S.A., Aanderaa, S.O.: On the minimum computation time of functions. Trans. Am. Math. Soc. 142, 291\u2013314 (1969)","journal-title":"Trans. Am. Math. Soc."},{"issue":"90","key":"8_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"8_CR18","unstructured":"Fouque, P.A., et al.: Falcon: fast-Fourier lattice-based compact signatures over NTRU. NIST Post-Quantum Cryptography Standardization Project (2020). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/post-quantum-cryptography\/documents\/round-3\/submissions\/Falcon-Round3.zip"},{"key":"8_CR19","doi-asserted-by":"publisher","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","DOI":"10.13154\/tches.v2020.i4.239-280"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Gentleman, W.M., Sande, G.: Fast Fourier transforms: for fun and profit. In: Proceedings of the November 7\u201310, 1966, fall joint computer conference, pp. 563\u2013578 (1966)","DOI":"10.1145\/1464291.1464352"},{"key":"8_CR21","unstructured":"Kannwischer, M.J., Rijneveld, J., Schwabe, P., Stoffelen, K.: pqm4: testing and benchmarking NIST PQC on ARM cortex-m4. IACR Cryptol. ePrint Arch. 844 (2019). https:\/\/eprint.iacr.org\/2019\/844"},{"key":"8_CR22","first-page":"595","volume":"7","author":"A Karatsuba","year":"1963","unstructured":"Karatsuba, A.: Multiplication of multidigit numbers on automata. Sov. Phys. Dokl. 7, 595\u2013596 (1963)","journal-title":"Sov. Phys. Dokl."},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Karmakar, A., Mera, J.M.B., Roy, S.S., Verbauwhede, I.: Saber on ARM CCA-secure module lattice-based key encapsulation on ARM. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(3), 243\u2013266 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i3.243-266","DOI":"10.13154\/tches.v2018.i3.243-266"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-48965-0_8","volume-title":"Cryptology and Network Security","author":"P Longa","year":"2016","unstructured":"Longa, P., Naehrig, M.: Speeding up the number theoretic transform for faster ideal lattice-based cryptography. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 124\u2013139. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_8"},{"key":"8_CR25","doi-asserted-by":"publisher","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","DOI":"10.13154\/tches.v2020.i2.222-244"},{"issue":"170","key":"8_CR26","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":"8_CR27","doi-asserted-by":"publisher","unstructured":"Natarajan, D., Dai, W.: Seal-embedded: a homomorphic encryption library for the internet of things. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(3), 756\u2013779 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i3.756-779","DOI":"10.46586\/tches.v2021.i3.756-779"},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Nejatollahi, H., Dutt, N.D., Ray, S., Regazzoni, F., Banerjee, I., Cammarota, R.: Post-quantum lattice-based cryptography implementations: a survey. ACM Comput. Surv. 51(6), 129:1\u2013129:41 (2019). https:\/\/doi.org\/10.1145\/3292548","DOI":"10.1145\/3292548"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-030-81293-5_13","volume-title":"Post-Quantum Cryptography","author":"DT Nguyen","year":"2021","unstructured":"Nguyen, D.T., Gaj, K.: Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 234\u2013254. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_13"},{"key":"8_CR30","doi-asserted-by":"publisher","unstructured":"Roy, S.S., Basso, A.: High-speed instruction-set coprocessor for lattice-based key encapsulation mechanism: Saber in hardware. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(4), 443\u2013466 (2020). https:\/\/doi.org\/10.13154\/tches.v2020.i4.443-466","DOI":"10.13154\/tches.v2020.i4.443-466"},{"key":"8_CR31","unstructured":"Seiler, G.: Faster AVX2 optimized NTT multiplication for ring-LWE lattice cryptography. IACR Cryptol. ePrint Arch. 39 (2018). http:\/\/eprint.iacr.org\/2018\/039"},{"issue":"5","key":"8_CR32","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete Logarithmson a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J. Comput."},{"key":"8_CR33","first-page":"714","volume":"3","author":"AL Toom","year":"1963","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. Sov. Math. Dokl. 3, 714\u2013716 (1963)","journal-title":"Sov. Math. Dokl."},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Zhu, Y., et al.: LWRpro: an energy-efficient configurable crypto-processor for Module-LWR. IEEE Trans. Circuits Syst. I Regul. Pap. 68(3), 1146\u20131159 (2021). https:\/\/doi.org\/10.1109\/TCSI.2020.3048395","DOI":"10.1109\/TCSI.2020.3048395"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56235-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:04:40Z","timestamp":1711634680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56235-8_8"}},"subtitle":["A Case Study for\u00a0Kyber\/Saber\u2019s Polynomial Multiplication on\u00a0ARM Cortex-M0\/M0$$+$$"],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562341","9783031562358"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56235-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Goa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2023","order":10,"name":"conference_id","label":"Conference ID","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":"74","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":"27","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":"36% - 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","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":"4","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)"}}]}}