{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T13:09:03Z","timestamp":1774530543013,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031293702","type":"print"},{"value":"9783031293719","type":"electronic"}],"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-29371-9_15","type":"book-chapter","created":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T13:24:05Z","timestamp":1680182645000},"page":"292-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Time-Efficient Finite Field Microarchitecture Design for\u00a0Curve448 and\u00a0Ed448 on\u00a0Cortex-M4"],"prefix":"10.1007","author":[{"given":"Mila","family":"Anastasova","sequence":"first","affiliation":[]},{"given":"Reza","family":"Azarderakhsh","sequence":"additional","affiliation":[]},{"given":"Mehran Mozaffari","family":"Kermani","sequence":"additional","affiliation":[]},{"given":"Lubjana","family":"Beshaj","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,31]]},"reference":[{"key":"15_CR1","unstructured":"National Institute of Standards and Technology: Security Requirements for Cryptographic Modules. Technical report, Federal Information Processing Standards Publications (FIPS PUBS) 140-2, Change Notice 2 December 03, 2002, U.S. Department of Commerce, Washington, D.C. (2001)"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"15_CR3","unstructured":"Bernstein, D.J., Lange, T.: Security dangers of the NIST curves. In: Invited talk. International State of the Art Cryptography Workshop, Athens, Greece (2013)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"DJ Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: New Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 207\u2013228. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_14"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-23951-9_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 124\u2013142. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_9"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3309759","volume":"45","author":"A Faz-Hern\u00e1ndez","year":"2019","unstructured":"Faz-Hern\u00e1ndez, A., L\u00f3pez, J., Dahab, R.: High-performance implementation of elliptic curve cryptography using vector instructions. ACM Trans. Math. Softw. (TOMS) 45(3), 1\u201335 (2019)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"15_CR7","unstructured":"Hisil, H., Egrice, B., Yassi, M.: Fast 4 way vectorized ladder for the complete set of montgomery curves. Cryptology ePrint Archive (2020)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Nath, K., Sarkar, P.: Security and efficiency trade-offs for elliptic curve Diffie-Hellman at the 128-bit and 224-bit security levels. J. Cryptogr. Eng. 1\u201315 (2021)","DOI":"10.1007\/s13389-021-00261-y"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"D\u00fcll, M., et al.: High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers. Des. Codes Cryptogr. 77, 493\u2013514 (2015). https:\/\/doi.org\/10.1007\/s10623-015-0087-1","DOI":"10.1007\/s10623-015-0087-1"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-030-25283-0_6","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2017","author":"H Fujii","year":"2019","unstructured":"Fujii, H., Aranha, D.F.: Curve25519 for the Cortex-M4 and beyond. In: Lange, T., Dunkelman, O. (eds.) LATINCRYPT 2017. LNCS, vol. 11368, pp. 109\u2013127. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25283-0_6"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s42400-021-00078-6","volume":"4","author":"S Ullah","year":"2021","unstructured":"Ullah, S., Zahilah, R.: Curve25519 based lightweight end-to-end encryption in resource constrained autonomous 8-bit IoT devices. Cybersecurity 4(1), 1\u201313 (2021). https:\/\/doi.org\/10.1186\/s42400-021-00078-6","journal-title":"Cybersecurity"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3312742","volume":"18","author":"F Turan","year":"2019","unstructured":"Turan, F., Verbauwhede, I.: Compact and flexible FPGA implementation of Ed25519 and X25519. ACM Trans. Embed. Comput. Syst. (TECS) 18(3), 1\u201321 (2019)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Niasar, M.B., El Khatib, R., Azarderakhsh, R., Mozaffari-Kermani, M.: Fast, small, and area-time efficient architectures for key-exchange on Curve25519. In: 2020 IEEE 27th Symposium on Computer Arithmetic (ARITH), pp. 72\u201379. IEEE (2020)","DOI":"10.1109\/ARITH48897.2020.00019"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Bisheh-Niasar, M., Azarderakhsh, R., Mozaffari-Kermani, M.: Cryptographic accelerators for digital signature based on Ed25519. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 29(7), 1297\u20131305 (2021)","DOI":"10.1109\/TVLSI.2021.3077885"},{"key":"15_CR15","unstructured":"De Santis, F., Sigl, G.: Towards side-channel protected X25519 on ARM Cortex-M4 processors. In: Proceedings of Software Performance Enhancement for Encryption and Decryption, and Benchmarking, Utrecht, The Netherlands, pp. 19\u201321 (2016)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/978-3-319-66787-4_32","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"Z Liu","year":"2017","unstructured":"Liu, Z., Longa, P., Pereira, G.C.C.F., Reparaz, O., Seo, H.: Four$$\\mathbb{Q}$$ on embedded devices with strong countermeasures against side-channel attacks. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 665\u2013686. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_32"},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/s41635-020-00106-w","volume":"4","author":"L Weissbart","year":"2020","unstructured":"Weissbart, L., Chmielewski, \u0141, Picek, S., Batina, L.: Systematic side-channel analysis of Curve25519 with machine learning. J. Hardw. Syst. Secur. 4(4), 314\u2013328 (2020)","journal-title":"J. Hardw. Syst. Secur."},{"key":"15_CR18","unstructured":"Hamburg, M.: Ed448-Goldilocks, a new elliptic curve. Cryptology ePrint Archive (2015)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-72565-9_9","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"T Oliveira","year":"2018","unstructured":"Oliveira, T., L\u00f3pez, J., H\u0131\u015f\u0131l, H., Faz-Hern\u00e1ndez, A., Rodr\u00edguez-Henr\u00edquez, F.: How to (pre-)compute a ladder. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 172\u2013191. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_9"},{"issue":"6","key":"15_CR20","doi-asserted-by":"publisher","first-page":"863","DOI":"10.4218\/etrij.2018-0445","volume":"41","author":"H Seo","year":"2019","unstructured":"Seo, H.: Compact implementations of Curve Ed448 on low-end IoT platforms. ETRI J. 41(6), 863\u2013872 (2019)","journal-title":"ETRI J."},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-68890-5_7","volume-title":"Information Security and Cryptology \u2013 ICISC 2020","author":"H Seo","year":"2021","unstructured":"Seo, H., Azarderakhsh, R.: Curve448 on 32-bit ARM Cortex-M4. In: Hong, D. (ed.) ICISC 2020. LNCS, vol. 12593, pp. 125\u2013139. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68890-5_7"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Anastasova, M., Bisheh-Niasar, M., Seo, H., Azarderakhsh, R., Kermani, M.M.: Efficient and side-channel resistant design of high-security Ed448 on ARM Cortex-M4. In: 2022 IEEE International Symposium on Hardware Oriented Security and Trust (HOST), pp. 93\u201396, IEEE (2022)","DOI":"10.1109\/HOST54066.2022.9839742"},{"issue":"177","key":"15_CR23","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-23951-9_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"M Hutter","year":"2011","unstructured":"Hutter, M., Wenger, E.: Fast multi-precision multiplication for public-key cryptography on embedded microprocessors. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 459\u2013474. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_30"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-35416-8_5","volume-title":"Information Security Applications","author":"H Seo","year":"2012","unstructured":"Seo, H., Kim, H.: Multi-precision multiplication for public-key cryptography on embedded microprocessors. In: Lee, D.H., Yung, M. (eds.) WISA 2012. LNCS, vol. 7690, pp. 55\u201367. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35416-8_5"},{"issue":"1","key":"15_CR26","first-page":"27","volume":"13","author":"H Seo","year":"2015","unstructured":"Seo, H., Kim, H.: Consecutive operand-caching method for multiprecision multiplication. J. Inf. Commun. Converg. Eng. 13(1), 27\u201335 (2015)","journal-title":"J. Inf. Commun. Converg. Eng."},{"issue":"10","key":"15_CR27","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1109\/TC.2020.3023045","volume":"70","author":"H Seo","year":"2020","unstructured":"Seo, H., Anastasova, M., Jalali, A., Azarderakhsh, R.: Supersingular isogeny key encapsulation (SIKE) round 2 on ARM Cortex-M4. IEEE Trans. Comput. 70(10), 1705\u20131718 (2020)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"15_CR28","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.3390\/app10041539","volume":"10","author":"H Seo","year":"2020","unstructured":"Seo, H.: Memory efficient implementation of modular multiplication for 32-bit ARM Cortex-M4. Appl. Sci. 10(4), 1539 (2020)","journal-title":"Appl. Sci."},{"issue":"10","key":"15_CR29","doi-asserted-by":"publisher","first-page":"4129","DOI":"10.1109\/TCSI.2021.3096916","volume":"68","author":"M Anastasova","year":"2021","unstructured":"Anastasova, M., Azarderakhsh, R., Kermani, M.M.: Fast strategies for the implementation of SIKE round 3 on ARM Cortex-M4. IEEE Trans. Circuits Syst. I Regul. Pap. 68(10), 4129\u20134141 (2021)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"15_CR30","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-90022-9_24","volume-title":"Security and Privacy in Communication Networks","author":"M Anastasova","year":"2021","unstructured":"Anastasova, M., Bisheh-Niasar, M., Azarderakhsh, R., Kermani, M.M.: Compressed SIKE round 3 on ARM Cortex-M4. In: Garcia-Alfaro, J., Li, S., Poovendran, R., Debar, H., Yung, M. (eds.) SecureComm 2021. LNICST, vol. 399, pp. 441\u2013457. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90022-9_24"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Josefsson, S., Liusvaara, I.: Edwards-curve digital signature algorithm (EdDSA). RFC 8032, January 2017","DOI":"10.17487\/RFC8032"},{"key":"15_CR32","unstructured":"ARM: Cortex-M4 ISA. https:\/\/developer.arm.com\/documentation\/100166\/0001. Accessed 1 May 2022"},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-28632-5_9","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"N Gura","year":"2004","unstructured":"Gura, N., Patel, A., Wander, A., Eberle, H., Shantz, S.C.: Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 119\u2013132. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28632-5_9"},{"key":"15_CR34","unstructured":"Scott, M., Szczechowiak, P.: Optimizing multiprecision multiplication for public key cryptography. Cryptology ePrint Archive (2007)"},{"issue":"1","key":"15_CR35","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jss.2012.06.074","volume":"86","author":"Y Lee","year":"2013","unstructured":"Lee, Y., Kim, I.-H., Park, Y.: Improved multi-precision squaring for low-end RISC microcontrollers. J. Syst. Softw. 86(1), 60\u201371 (2013)","journal-title":"J. Syst. Softw."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29371-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T13:26:21Z","timestamp":1680182781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29371-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031293702","9783031293719"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29371-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/","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":"69","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":"24","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":"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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}