{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:28:47Z","timestamp":1778128127000,"version":"3.51.4"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587153","type":"print"},{"value":"9783031587160","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-58716-0_3","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T03:01:57Z","timestamp":1714273317000},"page":"63-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Apr\u00e8sSQI: Extra Fast Verification for\u00a0SQIsign Using Extension-Field Signing"],"prefix":"10.1007","author":[{"given":"Maria","family":"Corte-Real Santos","sequence":"first","affiliation":[]},{"given":"Jonathan Komada","family":"Eriksen","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"Krijn","family":"Reijnders","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s13389-022-00293-y","volume":"13","author":"G Adj","year":"2023","unstructured":"Adj, G., Chi-Dom\u00ednguez, J.-J., Rodr\u00edguez-Henr\u00edquez, F.: Karatsuba-based square-root V\u00e9lu\u2019s formulas applied to two isogeny-based protocols. J. Cryptogr. Eng. 13(1), 89\u2013106 (2023). https:\/\/doi.org\/10.1007\/s13389-022-00293-y","journal-title":"J. Cryptogr. Eng."},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Auer, R., Top, J.: Legendre elliptic curves over finite fields. J. Number Theor. 95(2), 303\u2013312 (2002). ISSN 0022-314X. https:\/\/doi.org\/10.1006\/jnth.2001.2760. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022314X0192760X","DOI":"10.1006\/jnth.2001.2760"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s13389-021-00260-z","volume":"11","author":"J-C Bajard","year":"2021","unstructured":"Bajard, J.-C., Duquesne, S.: Montgomery-friendly primes and applications to cryptography. J. Cryptogr. Eng. 11(4), 399\u2013415 (2021). https:\/\/doi.org\/10.1007\/s13389-021-00260-z","journal-title":"J. Cryptogr. Eng."},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Banegas, G., Gilchrist, V., Le D\u00e9v\u00e9hat, A., Smith, B.: Fast and Frobenius: rational isogeny evaluation over finite fields. In: Aly, A., Tibouchi, M. (eds.) Progress in Cryptology, LATINCRYPT 2023. LATINCRYPT 2023. LNCS, vol. 14168, pp. 129\u2013148. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44469-2_7","DOI":"10.1007\/978-3-031-44469-2_7"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., De Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. In: Open Book Series, vol. 4, no. 1, pp. 39\u201355 (2020)","DOI":"10.2140\/obs.2020.4.39"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-13039-2_25","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2014","author":"J-F Biasse","year":"2014","unstructured":"Biasse, J.-F., Jao, D., Sankar, A.: A quantum algorithm for computing isogenies between supersingular elliptic curves. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 428\u2013442. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13039-2_25"},{"key":"3_CR7","unstructured":"Bruno, G., et al.: Cryptographic Smooth Neighbors. IACR Cryptol. ePrint Arch., p. 1439 (2022). https:\/\/eprint.iacr.org\/2022\/1439"},{"key":"3_CR8","unstructured":"Chavez-Saab, J., et al.: SQIsign: algorithm specifications and supporting documentation (2023). National Institute of Standards and Technology. https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/sqisign-spec-web.pdf"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.3934\/amc.2020116","volume":"16","author":"J-J Chi-Dom\u00ednguez","year":"2022","unstructured":"Chi-Dom\u00ednguez, J.-J., Rodr\u00edguez-Henr\u00edquez, F.: Optimal strategies for CSIDH. Adv. Math. Commun. 16(2), 383\u2013411 (2022)","journal-title":"Adv. Math. Commun."},{"key":"3_CR10","unstructured":"Santos, M.C.-R., Eriksen, J.K., Meyer, M., Reijnders, K.: Apr\u00e9sSQI: extra fast verification for SQIsign using extension-field signing. Cryptology ePrint Archive, Paper 2023\/1559 (2023). https:\/\/eprint.iacr.org\/2023\/1559"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-030-64834-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"C Costello","year":"2020","unstructured":"Costello, C.: B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part II. LNCS, vol. 12492, pp. 440\u2013463. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_15"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-030-03332-3_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"C Costello","year":"2018","unstructured":"Costello, C.: Computing supersingular isogenies on Kummer surfaces. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part III. LNCS, vol. 11274, pp. 428\u2013456. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_16"},{"key":"3_CR13","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, Part II. LNCS, vol. 10625, pp. 303\u2013329. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_11"},{"key":"3_CR14","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, Part I. LNCS, vol. 10210, pp. 679\u2013706. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_24"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-030-77870-5_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Costello","year":"2021","unstructured":"Costello, C., Meyer, M., Naehrig, M.: Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 272\u2013301. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_10"},{"key":"3_CR16","unstructured":"Dartois, P., Leroux, A., Robert, D., Wesolowski, B.: SQISignHD: new dimensions in cryptography. IACR Cryptol. ePrint Arch., p. 436 (2023). https:\/\/eprint.iacr.org\/2023\/436"},{"issue":"3","key":"3_CR17","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., Jao, D., Pl\u00fbt, J.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. J. Math. Cryptol. 8(3), 209\u2013247 (2014). https:\/\/doi.org\/10.1515\/jmc-2012-0015","journal-title":"J. Math. Cryptol."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-64837-4_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"L De Feo","year":"2020","unstructured":"De Feo, L., Kohel, D., Leroux, A., Petit, C., Wesolowski, B.: SQISign: compact post-quantum signatures from quaternions and isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part I. LNCS, vol. 12491, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_3"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"De Feo, L., Leroux, A., Longa, P., Wesolowski, B.: New algorithms for the deuring correspondence. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology, EUROCRYPT 2023. LNCS, vol. 14008, pp. 659\u2013690. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_23","DOI":"10.1007\/978-3-031-30589-4_23"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10623-014-0010-1","volume":"78","author":"C Delfs","year":"2016","unstructured":"Delfs, C., Galbraith, S.D.: Computing isogenies between supersingular elliptic curves over $$\\mathbb{F} _p$$. Des. Codes Crypt. 78, 425\u2013440 (2016)","journal-title":"Des. Codes Crypt."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Eriksen, J.K., Panny, L., Sot\u00e1kov\u00e1, J., Veroni, M.: Deuring for the people: supersingular elliptic curves with prescribed endomorphism ring in general characteristic. IACR Cryptol. ePrint Arch., p. 106 (2023). https:\/\/eprint.iacr.org\/2023\/106","DOI":"10.1090\/conm\/796\/16008"},{"key":"3_CR22","unstructured":"Jao, D., R., et al.: SIKE. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s102070100002","volume":"1","author":"D Johnson","year":"2001","unstructured":"Johnson, D., Menezes, A., Vanstone, S.A.: The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Sec. 1(1), 36\u201363 (2001). https:\/\/doi.org\/10.1007\/s102070100002","journal-title":"Int. J. Inf. Sec."},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Josefsson, S., Liusvaara, I.: Edwards-curve digital signature algorithm (EdDSA). RFC: 8032, pp. 1\u201360 (2017). https:\/\/doi.org\/10.17487\/RFC8032","DOI":"10.17487\/RFC8032"},{"issue":"A","key":"3_CR25","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1112\/S1461157014000151","volume":"17","author":"D Kohel","year":"2014","unstructured":"Kohel, D., Lauter, K., Petit, C., Tignol, J.-P.: On the quaternion-isogeny path problem. LMS J. Comput. Math. 17(A), 418\u2013432 (2014)","journal-title":"LMS J. Comput. Math."},{"key":"3_CR26","unstructured":"Lin, K., Wang, W., Xu, Z., Zhao, C.-A.: A faster software implementation of SQISign. Cryptology ePrint Archive, Paper 2023\/753 (2023). https:\/\/eprint.iacr.org\/2023\/753"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-030-05378-9_8","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2018","author":"M Meyer","year":"2018","unstructured":"Meyer, M., Reith, S.: A faster way to the CSIDH. In: Chakraborty, D., Iwata, T. (eds.) INDOCRYPT 2018. LNCS, vol. 11356, pp. 137\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05378-9_8"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Page, A., Wesolowski, B.: The supersingular endomorphism ring and one endomorphism problems are equivalent. CoRR abs\/2309.10432. arXiv arXiv:2309.10432 (2023). https:\/\/doi.org\/10.48550\/arXiv.2309.10432","DOI":"10.48550\/arXiv.2309.10432"},{"issue":"2","key":"3_CR29","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":"3_CR30","doi-asserted-by":"crossref","unstructured":"Shoup, V.: Efficient computation of minimal polynomials in algebraic extensions of finite fields. In: Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, pp. 53\u201358 (1999)","DOI":"10.1145\/309831.309859"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves, vol. 106. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-1-4757-1920-8","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"3_CR32","unstructured":"National\u00a0Institute of\u00a0Standards and Technology (NIST): Call for Additional Digital Signature Schemes for the Post-Quantum Cryptography Standardization Process (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf"},{"key":"3_CR33","unstructured":"Tsukazaki, K.: Explicit isogenies of elliptic curves. Ph.D. thesis, University of Warwick (2013)"},{"key":"3_CR34","first-page":"238","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. Comptes-Rendus de l\u2019Acad\u00e9mie des Sciences 273, 238\u2013241 (1971)","journal-title":"Comptes-Rendus de l\u2019Acad\u00e9mie des Sciences"},{"key":"3_CR35","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56694-4","volume-title":"Quaternion Algebras","author":"J Voight","year":"2021","unstructured":"Voight, J.: Quaternion Algebras. GTM, vol. 288. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-56694-4"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: The supersingular isogeny path and endomorphism ring problems are equivalent. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1100\u20131111. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00109"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58716-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:02:33Z","timestamp":1777334553000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58716-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587153","9783031587160"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58716-0_3","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 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}