{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:31:05Z","timestamp":1759336265130,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030900212"},{"type":"electronic","value":"9783030900229"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90022-9_24","type":"book-chapter","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T08:06:08Z","timestamp":1635926768000},"page":"441-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Compressed SIKE Round 3 on ARM Cortex-M4"],"prefix":"10.1007","author":[{"given":"Mila","family":"Anastasova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mojtaba","family":"Bisheh-Niasar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Azarderakhsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehran Mozaffari","family":"Kermani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"24_CR1","unstructured":"T.N.I. of Standards and T. (NIST): Post-quantum cryptography standardization, 2017\u20132018. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization. Accessed 6 Jun 2021"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25405-5_2","volume-title":"Post-Quantum Cryptography","author":"D Jao","year":"2011","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 19\u201334. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Azarderakhsh, R., Jao, D., Kalach, K., Koziel, B., Leonardi, C.: Key compression for isogeny-based cryptosystems. In: Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, pp. 1\u201310 (2016)","DOI":"10.1145\/2898420.2898421"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-319-56620-7_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"C Costello","year":"2017","unstructured":"Costello, C., Jao, D., Longa, P., Naehrig, M., Renes, J., Urbanik, D.: Efficient compression of SIDH public keys. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 679\u2013706. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_24"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-34621-8_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Naehrig","year":"2019","unstructured":"Naehrig, M., Renes, J.: Dual isogenies and their application to public-key compression for isogeny-based cryptography. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 243\u2013272. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_9"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s13389-020-00245-4","volume":"11","author":"G Pereira","year":"2021","unstructured":"Pereira, G., Doliskani, J., Jao, D.: x-only point addition formula and faster compressed SIKE. J. Cryptogr. Eng. 11(1), 57\u201369 (2021). https:\/\/doi.org\/10.1007\/s13389-020-00245-4","journal-title":"J. Cryptogr. Eng."},{"key":"24_CR7","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":"4","key":"24_CR8","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."},{"key":"24_CR9","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: IEEE 27th Symposium on Computer Arithmetic (ARITH), vol. 2020, pp. 72\u201379. IEEE (2020)","DOI":"10.1109\/ARITH48897.2020.00019"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-030-65277-7_10","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"M Bisheh Niasar","year":"2020","unstructured":"Bisheh Niasar, M., Azarderakhsh, R., Kermani, M.M.: Efficient hardware implementations for elliptic curve cryptography over Curve448. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 228\u2013247. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_10"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Anastasova, M., Azarderakhsh, R., Kermani, M.M.: Fast strategies for the implementation of SIKE round 3 on ARM Cortex-M4. IEEE Trans. Circ. Syst. I Reg. Pap. 68(10), 4129\u20134141 (2021)","DOI":"10.1109\/TCSI.2021.3096916"},{"key":"24_CR12","doi-asserted-by":"crossref","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, 1705\u20131718 (2020)","journal-title":"IEEE Trans. Comput."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Seo, H., Liu, Z., Longa, P., Hu, Z.: SIDH on ARM: faster modular multiplications for faster post-quantum supersingular isogeny key exchange. IACR Trans. Cryptogr. Hardware Embed. Syst. 2018, 1\u201320 (2018)","DOI":"10.46586\/tches.v2018.i3.1-20"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-48965-0_6","volume-title":"Cryptology and Network Security","author":"B Koziel","year":"2016","unstructured":"Koziel, B., Jalali, A., Azarderakhsh, R., Jao, D., Mozaffari-Kermani, M.: NEON-SIDH: efficient implementation of supersingular Isogeny Diffie-Hellman key exchange protocol on ARM. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 88\u2013103. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_6"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Seo, H., Sanal, P., Jalali, A., Azarderakhsh, R.: Optimized implementation of SIKE round 2 on 64-bit ARM Cortex-A processors. IEEE Trans. Circ. Syst. I Regul. Pap. 67, 2659-2671 (2020)","DOI":"10.1109\/TCSI.2020.2979410"},{"key":"24_CR16","unstructured":"Elkhatib, R., Azarderakhsh, R., Mozaffari-Kermani, M.: Efficient and Fast Hardware Architectures for SIKE Round 2 on FPGA. Cryptology ePrint Archive 2020\/611, Technical report (2020)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Koziel, B., Ackie, A.-B., El Khatib, R., Azarderakhsh, R., Kermani, M.M.: SIKE\u2019d up: fast hardware architectures for supersingular isogeny key encapsulation. IEEE Trans. Circ. Syst. I Regul. Pap. 67, 4842\u20134854 (2020)","DOI":"10.1109\/TCSI.2020.2992747"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Elkhatib, R., Azarderakhsh, R., Mozaffari-Kermani, M.: Highly optimized montgomery multiplier for SIKE primes on FPGA. In: IEEE 27th Symposium on Computer Arithmetic (ARITH). IEEE, vol. 2020, pp. 64\u201371 (2020)","DOI":"10.1109\/ARITH48897.2020.00018"},{"issue":"12","key":"24_CR19","doi-asserted-by":"publisher","first-page":"2672","DOI":"10.1109\/TVLSI.2020.3025046","volume":"28","author":"J-H Phoon","year":"2020","unstructured":"Phoon, J.-H., Lee, W.-K., Wong, D.C.-K., Yap, W.-S., Goi, B.-M.: Area-time-efficient code-based postquantum key encapsulation mechanism on FPGA. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 28(12), 2672\u20132684 (2020)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"24_CR20","unstructured":"Kannwischer, M.J., Rijneveld, J., Schwabe, P., Stoffelen, K.: pqm4: testing and benchmarking NIST PQC on ARM Cortex-M4 (2019)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: 4th International Workshop on Post-Quantum Cryptography, PQCrypto 2011, pp. 19\u201334 (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2","DOI":"10.1007\/978-3-642-25405-5_2"},{"key":"24_CR22","unstructured":"SIKE: Sike website. https:\/\/sike.org\/. Accessed 6 Jun 2021"},{"key":"24_CR23","unstructured":"Jao, D., et al.: Supersingular Isogeny Key Encapsulation. Submission to the NIST Post-Quantum Standardization Project (2017). https:\/\/sike.org\/"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"PSLM Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354\u2013369. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_23"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"SD Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324\u2013337. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45455-1_26"},{"issue":"5","key":"24_CR26","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/TC.2018.2878829","volume":"68","author":"GH Zanon","year":"2018","unstructured":"Zanon, G.H., Simplicio, M.A., Pereira, G.C., Doliskani, J., Barreto, P.S.: Faster key compression for isogeny-based cryptosystems. IEEE Trans. Comput. 68(5), 688\u2013701 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Hutchinson, A., Karabina, K., Pereira, G.: Memory optimization techniques for computing discrete logarithms in compressed SIKE (2021)","DOI":"10.1007\/978-3-030-81293-5_16"},{"issue":"1","key":"24_CR28","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms overGF(p) and its cryptographic significance (corresp.). IEEE Trans. Inf. Theor. 24(1), 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"24_CR29","unstructured":"Earnshaw, R.: Procedure call standard for the ARM architecture. ARM Limited (October 2003)"},{"key":"24_CR30","first-page":"932","volume":"2018","author":"P Koppermann","year":"2018","unstructured":"Koppermann, P., Pop, E., Heyszl, J., Sigl, G.: 18 seconds to key exchange: limitations of supersingular isogeny Diffie-Hellman on embedded devices. IACR Cryptol. ePrint Arch. 2018, 932 (2018)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"24_CR31","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":"24_CR32","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":"24_CR33","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":"24_CR34","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. Convergence Eng. 13(1), 27\u201335 (2015)","journal-title":"J. inf. Commun. Convergence Eng."},{"key":"24_CR35","unstructured":"PQCryptov3.3: Sidh library. https:\/\/github.com\/Microsoft\/PQCrypto-SIDH"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90022-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T11:04:05Z","timestamp":1673694245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90022-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030900212","9783030900229"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90022-9_24","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2021\/","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":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","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":"56","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":"39% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}