{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:13:28Z","timestamp":1778087608406,"version":"3.51.4"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253262","type":"print"},{"value":"9783032253279","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-25327-9_19","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:35:08Z","timestamp":1778085308000},"page":"541-572","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Better Bounds for\u00a0Finding Fixed-Degree Isogenies via\u00a0Coppersmith\u2019s Method"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0674-6460","authenticated-orcid":false,"given":"Marius A.","family":"Aardal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2457-0783","authenticated-orcid":false,"given":"Diego F.","family":"Aranha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7085-377X","authenticated-orcid":false,"given":"Yansong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2791-426X","authenticated-orcid":false,"given":"Yiming","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5591-0234","authenticated-orcid":false,"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"19_CR1","unstructured":"Aardal, M.A., et al.: SQIsign. Technical report, National Institute of Standards and Technology (2025). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-2-additional-signatures"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in $$L_2$$ is NP-hard for randomized reductions. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"key":"19_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2024.109627","volume":"444","author":"E Bajo","year":"2024","unstructured":"Bajo, E., et al.: Weighted ehrhart theory: extending stanley\u2019s nonnegativity theorem. Adv. Math. 444, 109627 (2024)","journal-title":"Adv. Math."},{"issue":"273","key":"19_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-2010-02378-6","volume":"80","author":"V Baldoni","year":"2011","unstructured":"Baldoni, V., Berline, N., De Loera, J., K\u00f6ppe, M., Vergne, M.: How to integrate a polynomial over a simplex. Math. Comput. 80(273), 297\u2013325 (2011)","journal-title":"Math. Comput."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"1934","DOI":"10.1007\/BF02112432","volume":"70","author":"AI Barvinok","year":"1994","unstructured":"Barvinok, A.I.: Computation of exponential integrals. J. Math. Sci. 70, 1934\u20131943 (1994)","journal-title":"J. Math. Sci."},{"key":"19_CR6","first-page":"3","volume":"4","author":"AI Barvinok","year":"1992","unstructured":"Barvinok, A.I.: Partition functions in optimization and computational problems. Algebra i Analiz 4, 3\u201353 (1992)","journal-title":"Algebra i Analiz"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Basso, A., et al.: Exploring SIDH-based signature parameters. In: International Conference on Applied Cryptography and Network Security, pp. 432\u2013456. Springer (2024)","DOI":"10.1007\/978-3-031-54770-6_17"},{"key":"19_CR8","unstructured":"Basso, A., et al.: Supersingular curves you can trust. IACR Cryptol. ePrint Arch. 1469 (2022)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Bauer, A., Joux, A.: Toward a rigorous variation of coppersmith\u2019s algorithm on three variables. In: Advances in Cryptology-EUROCRYPT 2007: 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, 20\u201324 May 2007. Proceedings 26, pp. 361\u2013378. Springer (2007)","DOI":"10.1007\/978-3-540-72540-4_21"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Ben\u010dina, B., Kutas, P., Merz, S.P., Petit, C., Stopar, M., Weitk\u00e4mper, C.: Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves. In: Annual International Cryptology Conference, pp. 183\u2013217. Springer (2024)","DOI":"10.1007\/978-3-031-68388-6_8"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Brion, M., Vergne, M.: Lattice points in simple polytopes. J. Am. Math. Soc. 371\u2013392 (1997)","DOI":"10.1090\/S0894-0347-97-00229-4"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 178\u2013189. Springer (1996)","DOI":"10.1007\/3-540-68339-9_16"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 155\u2013165. Springer (1996)","DOI":"10.1007\/3-540-68339-9_14"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol."},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-24676-3_29","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"J-S Coron","year":"2004","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer polynomial equations revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 492\u2013505. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_29"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-74143-5_21","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"J-S Coron","year":"2007","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer polynomial equations: a direct approach. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 379\u2013394. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_21"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00591-005-0094-9","volume":"52","author":"JA De Loera","year":"2005","unstructured":"De Loera, J.A.: The many aspects of counting lattice points in polytopes. Math. Semesterber. 52(2), 175\u2013195 (2005)","journal-title":"Math. Semesterber."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Deuring, M.: Die typen der multiplikatorenringe elliptischer funktionenk\u00f6rper. In: Abhandlungen aus dem mathematischen Seminar der Universit\u00e4t Hamburg, vol.\u00a014, pp. 197\u2013272. Springer, Heidelberg (1941)","DOI":"10.1007\/BF02940746"},{"key":"19_CR19","first-page":"616","volume":"254","author":"E Ehrhart","year":"1962","unstructured":"Ehrhart, E.: Sur les poly\u00e8dres rationnels homoth\u00e9tiques \u00e0 n dimensions. CR Acad. Sci. Paris 254, 616 (1962)","journal-title":"CR Acad. Sci. Paris"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Eriksen, J.K., Leroux, A.: Computing orientations from the endomorphism ring of supersingular curves and applications. IACR Communications in Cryptology (2024)","DOI":"10.62056\/ae0fhbmo"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Feng, Y., Luo, H., Chen, Q., Nitaj, A., Pan, Y.: Computing asymptotic bounds for small roots in coppersmith\u2019s method via sumset theory. In: Annual International Cryptology Conference, pp. 3\u201332. Springer (2025)","DOI":"10.1007\/978-3-032-01855-7_1"},{"key":"19_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114549","volume":"999","author":"Y Feng","year":"2024","unstructured":"Feng, Y., Nitaj, A., Pan, Y.: Partial prime factor exposure attacks on some RSA variants. Theoret. Comput. Sci. 999, 114549 (2024)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR23","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":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-53887-6_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"SD Galbraith","year":"2016","unstructured":"Galbraith, S.D., Petit, C., Shani, B., Ti, Y.B.: On the security of supersingular isogeny cryptosystems. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 63\u201391. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_3"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-70694-8_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"SD Galbraith","year":"2017","unstructured":"Galbraith, S.D., Petit, C., Silva, J.: Identification protocols and signature schemes based on supersingular isogeny problems. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 3\u201333. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_1"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Heninger, N., Ryan, K.: The hidden number problem with small unknown multipliers: cryptanalyzing mega in six queries and other applications. In: IACR International Conference on Public-Key Cryptography, pp. 147\u2013176. Springer (2023)","DOI":"10.1007\/978-3-031-31368-4_6"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Crytography and Coding","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: Darnell, M. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 131\u2013142. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0024458"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11935230_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"E Jochemsz","year":"2006","unstructured":"Jochemsz, E., May, A.: A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 267\u2013282. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_18"},{"issue":"4","key":"19_CR29","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/BF01075048","volume":"26","author":"AG Khovanskii","year":"1992","unstructured":"Khovanskii, A.G.: Newton polyhedron, Hilbert polynomial, and sums of finite sets. Funct. Anal. Appl. 26(4), 276\u2013281 (1992)","journal-title":"Funct. Anal. Appl."},{"issue":"5","key":"19_CR30","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1137\/080734467","volume":"39","author":"M Kirschmer","year":"2010","unstructured":"Kirschmer, M., Voight, J.: Algorithmic enumeration of ideal classes for quaternion orders. SIAM J. Comput. 39(5), 1714\u20131747 (2010)","journal-title":"SIAM J. Comput."},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Kohel, D., Lauter, K.E., Petit, C., Tignol, J.: On the quaternion -isogeny path problem. LMS J. Comput. Math. 17(Theory), 418\u2013432 (2014)","DOI":"10.1112\/S1461157014000151"},{"key":"19_CR32","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"May, A.: Cryptanalysis of unbalanced RSA with small CRT-exponent. In: Annual International Cryptology Conference, pp. 242\u2013256. Springer (2002)","DOI":"10.1007\/3-540-45708-9_16"},{"key":"19_CR34","unstructured":"May, A.: New RSA vulnerabilities using lattice reduction methods. Ph.D. thesis, Citeseer (2003)"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"May, A., Nowakowski, J., Sarkar, S.: Partial key exposure attack on short secret exponent CRT-RSA. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 99\u2013129. Springer (2021)","DOI":"10.1007\/978-3-030-92062-3_4"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"May, A., Ritzenhofen, M.: Implicit factoring: on polynomial time factoring given only an implicit hint. In: International Workshop on Public Key Cryptography, pp. 1\u201314. Springer (2009)","DOI":"10.1007\/978-3-642-00468-1_1"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Meers, J., Nowakowski, J.: Solving the hidden number problem for CSIDH and CSURF via automated coppersmith. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 39\u201371. Springer (2023)","DOI":"10.1007\/978-981-99-8730-6_2"},{"key":"19_CR38","unstructured":"Merdy, A.H.L., Wesolowski, B.: Unconditional foundations for supersingular isogeny-based cryptography. CoRR abs\/2502.17010 (2025)"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Nakagawa, K., Onuki, H.: QFESTA: efficient algorithms and parameters for FESTA using quaternion algebras. In: CRYPTO (5). Lecture Notes in Computer Science, vol. 14924, pp. 75\u2013106. Springer (2024)","DOI":"10.1007\/978-3-031-68388-6_4"},{"key":"19_CR40","unstructured":"Page, A., Robert, D.: Introducing clapoti(s): evaluating the isogeny class group action in polynomial time. IACR Cryptol. ePrint Arch. 1766 (2023)"},{"key":"19_CR41","doi-asserted-by":"crossref","unstructured":"Page, A., Wesolowski, B.: The supersingular endomorphism ring and one endomorphism problems are equivalent. In: EUROCRYPT (6). Lecture Notes in Computer Science, vol. 14656, pp. 388\u2013417. Springer (2024)","DOI":"10.1007\/978-3-031-58751-1_14"},{"key":"19_CR42","unstructured":"Robert, D.: Evaluating isogenies in polylogarithmic time. IACR Cryptol. ePrint Arch. 1068 (2022)"},{"key":"19_CR43","doi-asserted-by":"crossref","unstructured":"Ryan, K.: Solving multivariate coppersmith problems with known moduli. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-3-031-91095-1_13"},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Ryan, K., Heninger, N.: Fast practical lattice reduction through iterated compression. In: Annual International Cryptology Conference, pp. 3\u201336. Springer (2023)","DOI":"10.1007\/978-3-031-38548-3_1"},{"key":"19_CR45","doi-asserted-by":"crossref","unstructured":"Sarkar, S.: Enhanced bound for the commutative isogeny hidden number problem in CSURF. In: International Conference on Cryptology in India, pp. 201\u2013211. Springer (2024)","DOI":"10.1007\/978-3-031-80311-6_10"},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: The supersingular isogeny path and endomorphism ring problems are equivalent. In: FOCS, pp. 1100\u20131111. IEEE (2021)","DOI":"10.1109\/FOCS52979.2021.00109"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25327-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:35:18Z","timestamp":1778085318000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25327-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253262","9783032253279"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25327-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 May 2026","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}