{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T08:12:04Z","timestamp":1785831124194,"version":"3.56.0"},"publisher-location":"Cham","reference-count":42,"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_1","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T03:01:57Z","timestamp":1714273317000},"page":"3-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":60,"title":["SQIsignHD: New Dimensions in\u00a0Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2808-9867","authenticated-orcid":false,"given":"Pierrick","family":"Dartois","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3737-0075","authenticated-orcid":false,"given":"Antonin","family":"Leroux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4378-4274","authenticated-orcid":false,"given":"Damien","family":"Robert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1249-6077","authenticated-orcid":false,"given":"Benjamin","family":"Wesolowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"1_CR1","unstructured":"Ahrens, K.: Sieving for large twin smooth integers using single solutions to Prouhet-Tarry-Escott. Cryptology ePrint Archive, Paper 2023\/219. (2023). https:\/\/eprint.iacr.org\/2023\/219"},{"key":"1_CR2","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, Xi\u2019an, China, pp. 1\u201310. ACM (2016)","DOI":"10.1145\/2898420.2898421"},{"key":"1_CR3","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, Proceedings of the Fourteenth Algorithmic Number Theory Symposium - ANTS XIV 4.1, pp. 39\u201355 (2020)","DOI":"10.2140\/obs.2020.4.39"},{"key":"1_CR4","unstructured":"Bruno, G., et al.: Cryptographic smooth neighbors. Cryptology ePrint Archive, Paper 2022\/1439 (2022). https:\/\/eprint.iacr.org\/2022\/1439"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: Advances in Cryptology - EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, 23\u201327 April 2023, Proceedings, Part V, Lyon, Springer, France, pp. 423\u2013447 (2023). ISBN: 978-3-031-30588-7. https:\/\/doi.org\/10.1007\/978-3-031-30589-4_15","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"1_CR6","first-page":"33","volume":"46","author":"G Cornacchia","year":"1908","unstructured":"Cornacchia, G.: Su di un metodo per la risoluzione in numeri interi dell\u2019equazione $$\\sum _{h=0}^n C_h x^{n-h}y^h=P$$. Giornale di matematiche di Battaglini 46, 33\u201390 (1908)","journal-title":"Giornale di matematiche di Battaglini"},{"key":"1_CR7","doi-asserted-by":"publisher","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. (ed.) Advances in Cryptology - EUROCRYPT 2021. Springer, Cham, pp. 272\u2013301 (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_10, ISBN: 978-3-030-77870-5","DOI":"10.1007\/978-3-030-77870-5_10"},{"key":"1_CR8","unstructured":"Couveignes, J.-M.: Hard Homogeneous Spaces. Cryptology ePrint Archive, Report 2006\/291 (2006). https:\/\/eprint.iacr.org\/2006\/291"},{"key":"1_CR9","unstructured":"Dartois, P., Leroux, A., Robert, D., Wesolowski, B.: SQIsignHD: new dimensions in cryptography. Cryptology ePrint Archive, Paper 2023\/436 (2023). https:\/\/eprint.iacr.org\/2023\/436"},{"key":"1_CR10","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. LNCS, vol. 12491, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_3"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Delfs, C., Galbraith, S.D.: Computing isogenies between supersingular elliptic curves over $$\\mathbb{F}_p$$. Des. Codes Cryptography 78(2), 425\u2013440 (2016). https:\/\/doi.org\/10.1007\/s10623-014-0010-1","DOI":"10.1007\/s10623-014-0010-1"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-78372-7_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"K Eisentr\u00e4ger","year":"2018","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Lauter, K., Morrison, T., Petit, C.: Supersingular isogeny graphs and endomorphism rings: reductions and solutions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 329\u2013368. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_11"},{"key":"1_CR13","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":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s00145-019-09316-0","volume":"33","author":"Steven D. Galbraith","year":"2019","unstructured":"Galbraith, Steven D.., Petit, Christophe, Silva, Javier: Identification protocols and signature schemes based on supersingular isogeny problems. J. Cryptology 33(1), 130\u2013175 (2019). https:\/\/doi.org\/10.1007\/s00145-019-09316-0","journal-title":"J. Cryptology"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC 1996. Philadelphia, Pennsylvania, Association for Computing Machinery, USA, pp. 212\u2013219 (1996). ISBN: 0897917855. https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols: Techniques and Constructions. 1st. Springer, Berlin (2010). ISBN: 3642143024","DOI":"10.1007\/978-3-642-14303-8"},{"key":"1_CR18","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":"1_CR19","doi-asserted-by":"publisher","unstructured":"Kani, E.: The number of curves of genus two with elliptic differentials. J. 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":"1_CR20","doi-asserted-by":"publisher","unstructured":"Kohel, D., Lauter, K., Petit, C., Tignol, J.-P.: On the quaternion - isogeny path problem. LMS J. Comput. Math. 17 (2014). https:\/\/doi.org\/10.1112\/S1461157014000151","DOI":"10.1112\/S1461157014000151"},{"key":"1_CR21","unstructured":"de Lagrange, J. L.: D\u00e9monstration d\u2019un th\u00e9oreme d\u2019arithm\u00e9tique. In: Nouveau M\u00e9moire de l\u2019Acad\u00e9mie Royale des Sciences de Berlin, pp. 123\u2013133 (1770)"},{"key":"1_CR22","unstructured":"Leroux, A.: Quaternion algebras and isogeny-based cryptography (2022). http:\/\/www.lix.polytechnique.fr\/Labo\/Antonin.LEROUX\/manuscrit_these.pdf"},{"key":"1_CR23","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"},{"issue":"5","key":"1_CR24","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1112\/S0010437X12000243","volume":"148","author":"D Lubicz","year":"2012","unstructured":"Lubicz, D., Robert, D.: Computing isogenies between abelian varieties. Compos. Math. 148(5), 1483\u20131515 (2012). https:\/\/doi.org\/10.1112\/S0010437X12000243","journal-title":"Compos. Math."},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Lubicz, D., Robert, D.: Computing separable isogenies in quasi-optimal time. LMS J. Comput. Math. 18(1), 98\u2013216 (2015). https:\/\/doi.org\/10.1112\/S146115701400045X","DOI":"10.1112\/S146115701400045X"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Lubicz, D., Robert, D.: Fast change of level and applications to isogenies. 9, 7 (2023). https:\/\/doi.org\/10.1007\/s40993-022-00407-9","DOI":"10.1007\/s40993-022-00407-9"},{"key":"1_CR27","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.) Advances in Cryptology - EUROCRYPT 2023. LNCS, vol. 14008, pp. 448\u2013471. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_16","DOI":"10.1007\/978-3-031-30589-4_16"},{"key":"1_CR28","unstructured":"PARI\/GP version 2.13.4. http:\/\/pari.math.u-bordeaux.fr\/. The PARI Group. Univ. Bordeaux (2022)"},{"issue":"1","key":"1_CR29","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"SC Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theor. 24(1), 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1_CR30","unstructured":"Pollack, P., Trevi\u00f1o, E.: Finding the four squares in lagrange\u2019s theorem. Integers 18A, A15 (2018)"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Rabin, J.O., Shallit, M.O.: Randomized algorithms in number theory. Commun. Pure Appl. Math. 39(S1), S239\u2013S256 (1986). https:\/\/doi.org\/10.1002\/cpa.3160390713","DOI":"10.1002\/cpa.3160390713"},{"key":"1_CR32","unstructured":"Robert, D.: Evaluating isogenies in polylogarithmic time. Cryptology ePrint Archive, Paper 2022\/1068 (2022). https:\/\/eprint.iacr.org\/2022\/1068"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023. EUROCRYPT 2023, LNCS, vol. 14008, pp. 472\u2013503. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_17","DOI":"10.1007\/978-3-031-30589-4_17"},{"key":"1_CR34","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-key cryptosystem based on isogenies. Cryptology ePrint Archive, Report 2006\/145 (2006). https:\/\/eprint.iacr.org\/2006\/145"},{"key":"1_CR35","unstructured":"Rouse, J., Thompson, K.: Quaternary quadratic forms with prime discriminant (2022). arXiv: 2206.00412 [math.NT]"},{"key":"1_CR36","unstructured":"The Sage Developers. SageMath, the Sage Mathematics Software System (Version 10.0) (2023). https:\/\/www.sagemath.org"},{"key":"1_CR37","unstructured":"The SQIsign team. SQIsign (2023). https:\/\/www.sqisign.org"},{"key":"1_CR38","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. In: Comptes-rendus de l\u2019Acad\u00e9mie des Sciences, vol. 273, pp. 238\u2013241, July 1971. https:\/\/gallica.bnf.fr"},{"key":"1_CR39","unstructured":"Venturi, D., Villani, A.: Zero-knowledge proofs and applications, May 2015. http:\/\/danieleventuri.altervista.org\/files\/zeroknowledge. pdf"},{"key":"1_CR40","unstructured":"Voight, J.: Quaternion algebras. v.0.9.23, August 2020. https:\/\/math.dartmouth.edu\/~jvoight\/quat.html"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: The supersingular isogeny path and endomorphism ring problems are equivalent. In: FOCS 2021 - 62nd Annual IEEE Symposium on Foundations of Computer Science. Denver, Colorado, United States, February 2022. https:\/\/hal.archives-ouvertes.fr\/hal-03340899","DOI":"10.1109\/FOCS52979.2021.00109"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-79063-3_12","volume-title":"Post-Quantum Cryptography","author":"GHM Zanon","year":"2018","unstructured":"Zanon, G.H.M., Simplicio, M.A., Pereira, G.C.C.F., Doliskani, J., Barreto, P.S.L.M.: Faster isogeny-based compressed key agreement. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 248\u2013268. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_12"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:04:20Z","timestamp":1777334660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58716-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587153","9783031587160"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58716-0_1","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"}]}}