{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T06:11:59Z","timestamp":1775801519354,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":43,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608904","type":"print"},{"value":"9789819608911","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0891-1_11","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:37:03Z","timestamp":1733956623000},"page":"339-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["SQIsign2D\u2013West"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3270-1069","authenticated-orcid":false,"given":"Andrea","family":"Basso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2808-9867","authenticated-orcid":false,"given":"Pierrick","family":"Dartois","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9321-0773","authenticated-orcid":false,"given":"Luca De","family":"Feo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3737-0075","authenticated-orcid":false,"given":"Antonin","family":"Leroux","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4495-5102","authenticated-orcid":false,"given":"Luciano","family":"Maino","sequence":"additional","affiliation":[]},{"given":"Giacomo","family":"Pope","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4378-4274","authenticated-orcid":false,"given":"Damien","family":"Robert","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1249-6077","authenticated-orcid":false,"given":"Benjamin","family":"Wesolowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Bach, E.: How to generate factored random numbers. SIAM Journal on Computing 17(2), 179\u2013193 (1988). https:\/\/doi.org\/10.1137\/0217012","DOI":"10.1137\/0217012"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Backendal, M., Bellare, M., Sorrell, J., Sun, J.: The Fiat-Shamir zoo: Relating the security of different signature variants. In: Gruschka, N. (ed.) Secure IT Systems - 23rd Nordic Conference, NordSec 2018, Oslo, Norway, November 28-30, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11252, pp. 154\u2013170. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-03638-6_10","DOI":"10.1007\/978-3-030-03638-6_10"},{"key":"11_CR3","unstructured":"Basso, A., Dartois, P., De Feo, L., Leroux, A., Maino, L., Pope, G., Robert, D., Wesolowski, B.: SQIsign2D-west: The fast, the small, and the safer. Cryptology ePrint Archive, Report 2024\/760 (2024), https:\/\/eprint.iacr.org\/2024\/760"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Basso, A., Maino, L., Pope, G.: FESTA: Fast encryption from supersingular torsion attacks. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0VII. LNCS, vol. 14444, pp. 98\u2013126. Springer, Singapore (Dec 2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_4","DOI":"10.1007\/978-981-99-8739-9_4"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., De\u00a0Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. Open Book Series 4(1), 39\u201355 (2020). https:\/\/doi.org\/10.2140\/obs.2020.4.39","DOI":"10.2140\/obs.2020.4.39"},{"key":"11_CR6","doi-asserted-by":"publisher","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\u00a02014. LNCS, vol.\u00a08885, pp. 428\u2013442. Springer, Cham (Dec 2014). https:\/\/doi.org\/10.1007\/978-3-319-13039-2_25","DOI":"10.1007\/978-3-319-13039-2_25"},{"key":"11_CR7","unstructured":"Castryck, W., Chen, M., Invernizzi, R., Lorenzon, G., Vercauteren, F.: Breaking and repairing SQIsign2D-East. Cryptology ePrint Archive, Paper 2024\/1453 (2024), https:\/\/eprint.iacr.org\/2024\/1453"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 423\u2013447. Springer, Cham (Apr 2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_15","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"11_CR9","unstructured":"Chavez-Saab, J., Santos, M.C., De Feo, L., Eriksen, J.K., Hess, B., Kohel, D., Leroux, A., Longa, P., Meyer, M., Panny, L., Patranabis, S., Petit, C., Rodr\u00edguez Henr\u00edquez, F., Schaeffler, S., Wesolowski, B.: SQIsign. Tech. rep., National Institute of Standards and Technology (2023), available at https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Costello, C., Hisil, H.: A simple and compact algorithm for SIDH with arbitrary degree isogenies. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT\u00a02017, Part\u00a0II. LNCS, vol. 10625, pp. 303\u2013329. Springer, Cham (Dec 2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_11","DOI":"10.1007\/978-3-319-70697-9_11"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Dartois, P., Leroux, A., Robert, D., Wesolowski, B.: SQIsignHD: New dimensions in cryptography. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0I. LNCS, vol. 14651, pp. 3\u201332. Springer, Cham (May 2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_1","DOI":"10.1007\/978-3-031-58716-0_1"},{"key":"11_CR12","unstructured":"Dartois, P., Maino, L., Pope, G., Robert, D.: An algorithmic approach to $$(2,2)$$-isogenies in the theta model and applications to isogeny-based cryptography. Cryptology ePrint Archive, Report 2023\/1747 (2023), https:\/\/eprint.iacr.org\/2023\/1747"},{"key":"11_CR13","unstructured":"De\u00a0Feo, L.: Mathematics of isogeny based cryptography (2017), https:\/\/arxiv.org\/abs\/1711.04062"},{"key":"11_CR14","doi-asserted-by":"publisher","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\u00a02020, Part\u00a0I. LNCS, vol. 12491, pp. 64\u201393. Springer, Cham (Dec 2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_3","DOI":"10.1007\/978-3-030-64837-4_3"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"De Feo, L., Leroux, A., Longa, P., Wesolowski, B.: New algorithms for the deuring correspondence - towards practical and secure SQISign signatures. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 659\u2013690. Springer, Cham (Apr 2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_23","DOI":"10.1007\/978-3-031-30589-4_23"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Delfs, C., Galbraith, S.D.: Computing isogenies between supersingular elliptic curves over $$\\mathbb{F}_p$$. DCC 78(2), 425\u2013440 (2016). https:\/\/doi.org\/10.1007\/s10623-014-0010-1","DOI":"10.1007\/s10623-014-0010-1"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Deuring, M.: Die Typen der Multiplikatorenringe elliptischer Funktionenk\u00f6rper. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg 14, 197\u2013272 (1941), https:\/\/doi.org\/10.1007\/BF02940746","DOI":"10.1007\/BF02940746"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Dirichlet, P.G.L.: Beweis des Satzes, dass jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enth\u00e4lt. Abhandlungen der K\u00f6niglichen Preu\u00dfischen Akademie der Wissenschaften zu Berlin 48, 45\u201371 (1837). https:\/\/doi.org\/10.1017\/CBO9781139237321.012","DOI":"10.1017\/CBO9781139237321.012"},{"key":"11_CR19","unstructured":"Duparc, M., Fouotsa, T.B., Vaudenay, S.: SILBE: an updatable public key encryption scheme from lollipop attacks. Cryptology ePrint Archive, Report 2024\/400 (2024), https:\/\/eprint.iacr.org\/2024\/400"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Erbsen, A., Philipoom, J., Gross, J., Sloan, R., Chlipala, A.: Simple high-level code for cryptographic arithmetic - with proofs, without compromises. In: 2019 IEEE Symposium on Security and Privacy. pp. 1202\u20131219. IEEE Computer Society Press (May 2019). https:\/\/doi.org\/10.1109\/SP.2019.00005","DOI":"10.1109\/SP.2019.00005"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO\u201986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Berlin, Heidelberg (Aug 1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: 28th ACM STOC. pp. 212\u2013219. ACM Press (May 1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers. Oxford, sixth edn. (1975). https:\/\/doi.org\/10.1093\/oso\/9780199219858.001.0001","DOI":"10.1093\/oso\/9780199219858.001.0001"},{"key":"11_CR24","unstructured":"Jao, D., Azarderakhsh, R., Campagna, M., Costello, C., De Feo, L., Hess, B., Jalali, A., Koziel, B., LaMacchia, B., Longa, P., Naehrig, M., Renes, J., Soukharev, V., Urbanik, D., Pereira, G., Karabina, K., Hutchinson, A.: SIKE. Tech. rep., National Institute of Standards and Technology (2022), available at https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B.Y. (ed.) Post-Quantum Cryptography - 4th International Workshop, PQCrypto 2011. pp. 19\u201334. Springer, Berlin, Heidelberg (Nov\u00a0\/\u00a0Dec 2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2","DOI":"10.1007\/978-3-642-25405-5_2"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Kani, E.: The number of curves of genus two with elliptic differentials. Journal f\u00fcr die reine und angewandte Mathematik 485, 93\u2013122 (1997). https:\/\/doi.org\/10.1515\/crll.1997.485.93","DOI":"10.1515\/crll.1997.485.93"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Kirschmer, M., Voight, J.: Algorithmic enumeration of ideal classes for quaternion orders. SIAM Journal on Computing 39(5), 1714\u20131747 (2010). https:\/\/doi.org\/10.1137\/080734467","DOI":"10.1137\/080734467"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Kohel, D., Lauter, K., Petit, C., Tignol, J.P.: On the quaternion-isogeny path problem. LMS Journal of Computation and Mathematics 17(A), 418\u2013432 (2014). https:\/\/doi.org\/10.1112\/S1461157014000151","DOI":"10.1112\/S1461157014000151"},{"key":"11_CR29","unstructured":"Leroux, A.: Quaternion algebras and isogeny-based cryptography. Ph.D. thesis, \u00c9cole Polytechnique, France (2022), http:\/\/www.lix.polytechnique.fr\/Labo\/Antonin.LEROUX\/manuscrit_these.pdf"},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Maino, L., Martindale, C., Panny, L., Pope, G., Wesolowski, B.: A direct key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 448\u2013471. Springer, Cham (Apr 2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_16","DOI":"10.1007\/978-3-031-30589-4_16"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Nakagawa, K., Onuki, H.: QFESTA: Efficient algorithms and parameters for FESTA using quaternion algebras. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0V. LNCS, vol. 14924, pp. 75\u2013106. Springer, Cham (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_4","DOI":"10.1007\/978-3-031-68388-6_4"},{"key":"11_CR32","unstructured":"Nakagawa, K., Onuki, H.: SQIsign2D-east: A new signature scheme using 2-dimensional isogenies. Cryptology ePrint Archive, Report 2024\/771 (2024), https:\/\/eprint.iacr.org\/2024\/771"},{"key":"11_CR33","unstructured":"Onuki, H., Nakagawa, K.: Ideal-to-isogeny algorithm using 2-dimensional isogenies and its application to SQIsign. Cryptology ePrint Archive, Report 2024\/778 (2024), https:\/\/eprint.iacr.org\/2024\/778"},{"key":"11_CR34","unstructured":"Page, A., Robert, D.: Introducing clapoti(s): Evaluating the isogeny class group action in polynomial time. Cryptology ePrint Archive, Report 2023\/1766 (2023), https:\/\/eprint.iacr.org\/2023\/1766"},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Page, A., Wesolowski, B.: The supersingular endomorphism ring and one endomorphism problems are equivalent. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0VI. LNCS, vol. 14656, pp. 388\u2013417. Springer, Cham (May 2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_14","DOI":"10.1007\/978-3-031-58751-1_14"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT\u201996. LNCS, vol.\u00a01070, pp. 387\u2013398. Springer, Berlin, Heidelberg (May 1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_33","DOI":"10.1007\/3-540-68339-9_33"},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"Renes, J.: Computing isogenies between Montgomery curves using the action of (0, 0). In: Lange, T., Steinwandt, R. (eds.) Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018. pp. 229\u2013247. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_11","DOI":"10.1007\/978-3-319-79063-3_11"},{"key":"11_CR38","unstructured":"Robert, D.: Evaluating isogenies in polylogarithmic time. Cryptology ePrint Archive, Report 2022\/1068 (2022), https:\/\/eprint.iacr.org\/2022\/1068"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 472\u2013503. Springer, Cham (Apr 2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_17","DOI":"10.1007\/978-3-031-30589-4_17"},{"key":"11_CR40","unstructured":"Robert, D.: Fast pairings via biextensions and cubical arithmetic. Cryptology ePrint Archive, Report 2024\/517 (2024), https:\/\/eprint.iacr.org\/2024\/517"},{"key":"11_CR41","doi-asserted-by":"publisher","unstructured":"Santos, M.C.R., Eriksen, J.K., Meyer, M., Reijnders, K.: Apr\u00e8sSQI: Extra fast verification for SQIsign using extension-field signing. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0I. LNCS, vol. 14651, pp. 63\u201393. Springer, Cham (May 2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_3","DOI":"10.1007\/978-3-031-58716-0_3"},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves, Graduate texts in mathematics, vol.\u00a0106. Springer (1986). https:\/\/doi.org\/10.1007\/978-0-387-09494-6","DOI":"10.1007\/978-0-387-09494-6"},{"key":"11_CR43","doi-asserted-by":"publisher","unstructured":"Zanon, G.H.M., Simplicio, M.A., Pereira, G.C.C.F., Doliskani, J., Barreto, P.S.L.M.: Faster key compression for isogeny-based cryptosystems. IEEE Transactions on Computers 68(5), 688\u2013701 (2019). https:\/\/doi.org\/10.1109\/TC.2018.2878829","DOI":"10.1109\/TC.2018.2878829"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0891-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:43:26Z","timestamp":1733957006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0891-1_11"}},"subtitle":["The Fast, the Small, and the Safer"],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819608904","9789819608911"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0891-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}