{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:30:02Z","timestamp":1743013802114,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031459320"},{"type":"electronic","value":"9783031459337"}],"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-45933-7_21","type":"book-chapter","created":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T09:02:37Z","timestamp":1700470957000},"page":"347-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multiprime Strategies for\u00a0Serial Evaluation of\u00a0eSIDH-Like Isogenies"],"prefix":"10.1007","author":[{"given":"Jason T.","family":"LeGrow","sequence":"first","affiliation":[]},{"given":"Brian","family":"Koziel","sequence":"additional","affiliation":[]},{"given":"Reza","family":"Azarderakhsh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"21_CR1","unstructured":"Azarderakhsh, R., et al.: Practical Supersingular Isogeny Group Key Agreement. Cryptology ePrint Archive, Report 2019\/330 (2019)"},{"key":"21_CR2","unstructured":"Azarderakhsh, R., et al.: Supersingular Isogeny Key Encapsulation. Technical report (2020). https:\/\/www.sike.org"},{"key":"21_CR3","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":"21_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2140\/obs.2020.4.39","volume":"4","author":"D Bernstein","year":"2020","unstructured":"Bernstein, D., et al.: Faster computation of isogenies of large prime degree. Open Book Series 4, 39\u201355 (2020)","journal-title":"Open Book Series"},{"key":"21_CR5","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. Cryptology ePrint Archive, Paper 2022\/975 (2022)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"21_CR7","unstructured":"Cervantes-V\u00e1zquez, D., Rodr\u00edguez-Henr\u00edquez, F.: A note on the cost of computing odd degree isogenies. Cryptology ePrint Archive, Report 2019\/1373 (2019)"},{"key":"21_CR8","unstructured":"Cervantes-V\u00e1zquez, D., et al.: eSIDH: the revenge of the SIDH. Cryptology ePrint Archive, Report 2020\/021 (2020)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-70697-9_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"C Costello","year":"2017","unstructured":"Costello, C., Hisil, H.: A simple and compact algorithm for SIDH with arbitrary degree isogenies. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 303\u2013329. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_11"},{"issue":"6","key":"21_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR11","unstructured":"De Feo, L., et al.: SIDH Proof of Knowledge. Cryptology ePrint Archive, Paper 2021\/1023 (2021)"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1515\/jmc-2012-0015","volume":"8","author":"L De Feo","year":"2014","unstructured":"De Feo, L., et al.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. J. Math. Cryptol. 8(3), 209\u2013247 (2014)","journal-title":"J. Math. Cryptol."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Furukawa, S., et al.: Multi-party key exchange protocols from supersingular isogenies. In: 2018 International Symposium on Information Theory and Its Applications (ISITA), pp. 208\u2013212 (2018)","DOI":"10.23919\/ISITA.2018.8664316"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Ghantous, W., et al.: Efficiency of SIDH-based signatures (yes, SIDH). Cryptology ePrint Archive, Paper 2023\/433 (2023)","DOI":"10.1515\/jmc-2023-0023"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-57808-4_24","volume-title":"Applied Cryptography and Network Security","author":"A Hutchinson","year":"2020","unstructured":"Hutchinson, A., LeGrow, J., Koziel, B., Azarderakhsh, R.: Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020. LNCS, vol. 12146, pp. 481\u2013501. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_24"},{"key":"21_CR16","unstructured":"Maino, L., Martindale, C.: An attack on SIDH with arbitrary starting curve. Cryptology ePrint Archive, Paper 2022\/1026 (2022)"},{"issue":"170","key":"21_CR17","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":"21_CR18","unstructured":"Robert, D.: Breaking SIDH in polynomial time. Cryptology ePrint Archive, Paper 2022\/1038 (2022)"},{"key":"21_CR19","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. C. R. Acad. Sci. Paris S\u00e9r. A-B 273, A238\u2013A241 (1971)"}],"container-title":["Lecture Notes in Computer Science","Science of Cyber Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45933-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T06:56:16Z","timestamp":1730530576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45933-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031459320","9783031459337"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45933-7_21","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":"21 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SciSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Science of Cyber Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"11 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scisec2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scisec.org\/index.html","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":"60","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":"21","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":"6","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":"5","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)"}}]}}