{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:24:19Z","timestamp":1767338659307,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752446"},{"type":"electronic","value":"9783030752453"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75245-3_2","type":"book-chapter","created":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T15:04:51Z","timestamp":1619795091000},"page":"27-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Alternative Approach for SIDH Arithmetic"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Bouvier","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Imbert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Alagic, G., et al.: Status report on the second round of the NIST post-quantum cryptography standardization process. Technical report NISTIR 8309, National Institute of Standards and Technology, U.S. Department of Commerce, July 2020. https:\/\/doi.org\/10.6028\/NIST.IR.8309","DOI":"10.6028\/NIST.IR.8309"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Bajard, J.-C., Imbert, L., Plantard, T.: Arithmetic operations in the polynomial modular number system. In: Proceedings of the 17th IEEE Symposium on Computer Arithmetic, ARITH17, pp. 206\u2013213. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/ARITH.2005.11","DOI":"10.1109\/ARITH.2005.11"},{"key":"2_CR3","unstructured":"Bajard, J.-C., Marrez, J., Plantard, T., V\u00e9ron, P.: On polynomial modular number systems over $$\\mathbb{Z}\/p\\mathbb{Z}$$ (2020). https:\/\/hal.sorbonne-universite.fr\/hal-02883341"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Bos, J.W., Friedberger, S.: Faster modular arithmetic for isogeny-based crypto on embedded devices. J. Cryptogr. Eng. 10(2), 97\u2013109 (2020). https:\/\/doi.org\/10.1007\/s13389-019-00214-6","DOI":"10.1007\/s13389-019-00214-6"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/23742917.2016.1226650","volume":"1","author":"W Buchanan","year":"2017","unstructured":"Buchanan, W., Woodward, A.: Will quantum computers be the end of public key encryption? J. Cyber Secur. Technol. 1(1), 1\u201322 (2017). https:\/\/doi.org\/10.1080\/23742917.2016.1226650","journal-title":"J. Cyber Secur. Technol."},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-38471-5_2","volume-title":"Selected Areas in Cryptography \u2013 SAC 2019","author":"C Costello","year":"2020","unstructured":"Costello, C.: Supersingular isogeny key exchange for beginners. In: Paterson, K.G., Stebila, D. (eds.) SAC 2019. LNCS, vol. 11959, pp. 21\u201350. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38471-5_2"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-662-53018-4_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Costello","year":"2016","unstructured":"Costello, C., Longa, P., Naehrig, M.: Efficient algorithms for supersingular isogeny Diffie-Hellman. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 572\u2013601. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_21"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Faz-Hern\u00e1ndez, A., L\u00f3pez-Hern\u00e1ndez, J.C., Ochoa-Jim\u00e9nez, E., Rodr\u00edguez-Henr\u00edquez, F.: A faster software implementation of the supersingular isogeny diffie-hellman key exchange protocol. IEEE Trans. Comput. 67(11), 1622\u20131636 (2018). https:\/\/doi.org\/10.1109\/TC.2017.2771535","DOI":"10.1109\/TC.2017.2771535"},{"key":"2_CR9","unstructured":"De Feo, L.: Mathematics of isogeny based cryptography (2017)"},{"key":"2_CR10","unstructured":"Galbraith, S.D., Vercauteren, F.: Computational problems in supersingular elliptic curve isogenies. Cryptology ePrint Archive, Report 2017\/774 (2017). https:\/\/eprint.iacr.org\/2017\/774"},{"key":"2_CR11","unstructured":"Jao, D., et al.: SIKE - supersingular isogeny key encapsulation. Submission to the NIST Post-Quantum Standardization project (2017), sike.org"},{"key":"2_CR12","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":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-55227-9_14","volume-title":"Arithmetic of Finite Fields","author":"A Karmakar","year":"2016","unstructured":"Karmakar, A., Roy, S.S., Vercauteren, F., Verbauwhede, I.: Efficient finite field multiplication for isogeny based post quantum cryptography. In: Duquesne, S., Petkova-Nikova, S. (eds.) WAIFI 2016. LNCS, vol. 10064, pp. 193\u2013207. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-55227-9_14"},{"key":"2_CR14","unstructured":"Longa, P., et al.: PQCrypto-SIDH (2020). https:\/\/github.com\/microsoft\/PQCrypto-SIDH"},{"issue":"170","key":"2_CR15","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":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-70500-0_34","volume-title":"Information Security and Privacy","author":"C Negre","year":"2008","unstructured":"Negre, C., Plantard, T.: Efficient modular arithmetic in adapted modular number system using Lagrange representation. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol. 5107, pp. 463\u2013477. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70500-0_34"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994). https:\/\/doi.org\/10.1109\/sfcs.1994.365700","DOI":"10.1109\/sfcs.1994.365700"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Smith, B.: Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies. In: Budaghyan, L., Rodr\u00edguez-Henr\u00edquez, F. (eds.) WAIFI 2018. LNCS, vol. 11321, pp. 3\u201340. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05153-2_1","DOI":"10.1007\/978-3-030-05153-2_1"},{"key":"2_CR19","unstructured":"Tian, J., Wang, P., Liu, Z., Lin, J., Wang, Z., Gro\u00dfschadl, J.: Faster Software Implementation of the SIKE Protocol Based on A New Data Representation. Cryptology ePrint Archive, Report 2020\/660 (2020). https:\/\/eprint.iacr.org\/2020\/660"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75245-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T00:05:23Z","timestamp":1714435523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75245-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752446","9783030752453"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75245-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","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":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2021","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":"pkc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.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":"Web-Submission-and-Review","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"156","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":"52","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":"33% - 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,5","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":"15","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}