{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:37:53Z","timestamp":1759365473799,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032067531","type":"print"},{"value":"9783032067548","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"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-06754-8_9","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:22:39Z","timestamp":1759306959000},"page":"234-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending Regev\u2019s Quantum Algorithm to\u00a0Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Razvan","family":"Barbulescu","sequence":"first","affiliation":[]},{"given":"Mugurel","family":"Barcau","sequence":"additional","affiliation":[]},{"given":"Vicen\u0163iu","family":"Pa\u015fol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Adrian, D., et\u00a0al.: Imperfect forward secrecy: how Diffie-Hellman fails in practice. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security\u2013CCS\u201915, pp. 5\u201317 (2015)","DOI":"10.1145\/2810103.2813707"},{"key":"9_CR2","unstructured":"ANSSI. Avis relatif aux param\u00e8tres de courbes elliptiques d\u00e9finis par l\u2019Etat fran\u00e7ais. Journal officiel de la R\u00e9publique Fran\u00e7aise (2011). https:\/\/www.legifrance.gouv.fr\/download\/pdf?id=QfYWtPSAJVtAB_c6Je5tAv00OY2r1ad3LaVVmnStGvQ="},{"key":"9_CR3","unstructured":"Some hyperlinks to applications of ECC:. \u2013 Bitcoin: https:\/\/en.bitcoin.it\/wiki\/Secp256k1 \u2013 Etherium: https:\/\/fitsaleem.medium.com\/ethereums-elliptic-curve-digital-signature-algorithm-ecdsa-88e1659f4879 \u2013 OpenSSH: https:\/\/www.openssh.com\/specs.html \u2013 BLS signature: https:\/\/datatracker.ietf.org\/doc\/html\/draft-irtf-cfrg-bls-signature-04 \u2013 hardware implementation: https:\/\/research.birmingham.ac.uk\/en\/publications\/lightweight-coprocessor-for-koblitz-curves-283-bit-ecc-including-"},{"key":"9_CR4","unstructured":"Barbulescu, R., Bisson, G.: Regev\u2019s attack on hyperelliptic cryptosystems. Cryptology ePrint Archive, Paper 2024 (2004). https:\/\/eprint.iacr.org\/2024\/2004"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68164-9_26"},{"key":"9_CR6","unstructured":"Barbulescu, R., Barcau, M., Pasol, V.: A comprehensive analysis of Regev\u2019s quantum algorithm. Cryptology ePrint Archive, Paper 2024\/1758. https:\/\/eprint.iacr.org\/2024\/1758"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-27152-1_6","volume-title":"Security Standardisation Research","author":"DJ Bernstein","year":"2015","unstructured":"Bernstein, D.J.: How to manipulate curve standards: a white paper for the black hat http:\/\/bada55.cr.yp.to. In: Chen, L., Matsuo, S. (eds.) SSR 2015. LNCS, vol. 9497, pp. 109\u2013139. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27152-1_6"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"DJ Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 207\u2013228. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_14"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/3-540-44750-4_34","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"D Boneh","year":"1995","unstructured":"Boneh, D., Lipton, R.J.: Quantum cryptanalysis of hidden linear functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 424\u2013437. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_34"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-24654-1_2","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: On the selection of pairing-friendly groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 17\u201325. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24654-1_2"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"9_CR12","unstructured":"Brands, S.A.: An efficient off-line electronic cash system based on the representation problem. Technical report, Centrum voor Wiskunde en Informatica (CWI) (1993)"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF01232033","volume":"109","author":"A Brumer","year":"1992","unstructured":"Brumer, A.: The average rank of elliptic curves I. Invent. Math. 109(1), 445\u2013472 (1992)","journal-title":"Invent. Math."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Biasse, J.F., Song, F.: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 893\u2013902. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch64"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"DV Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math. 7(4), 385\u2013434 (1986)","journal-title":"Adv. Appl. Math."},{"key":"9_CR16","unstructured":"Certicom research. Standards for efficient cryptography sec 2: Recommended elliptic curve domain parameters (2010). http:\/\/www.secg.org\/sec2-v2.pdf"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-662-48797-6_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"C Costello","year":"2015","unstructured":"Costello, C., Longa, P.: Four$$\\mathbb{Q}$$: four-dimensional decompositions on a $$\\mathbb{Q}$$-curve over the mersenne prime. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 214\u2013235. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_10"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-45724-2_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"K Boer","year":"2020","unstructured":"Boer, K., Ducas, L., Fehr, S.: On the quantum complexity of the continuous hidden subgroup problem. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 341\u2013370. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_12"},{"key":"9_CR19","unstructured":"Dhanda, S.S., et al.: A fast and efficient 191-bit elliptic curve cryptographic processor using a hybrid Karatsuba multiplier for IoT applications. IEEE Access (2024)"},{"key":"9_CR20","unstructured":"Dujella, A.: History of elliptic curves rank records (2024). https:\/\/web.math.pmf.unizg.hr\/~duje\/tors\/rankhist.html"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Eker\u00e5, M., G\u00e4rtner, J.: Extending Regev\u2019s factoring algorithm to compute discrete logarithms. In: Post-Quantum Cryptography\u2013PQC 2024, vol. 14771 of Lecture notes in Computer Science, pp. 211\u2013242. Springer, Heidelberg (2024)","DOI":"10.1007\/978-3-031-62746-0_10"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Eker\u00e5, M., G\u00e4rtner, J.: A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography. IACR Commun. Cryptol. 2(1) (2025)","DOI":"10.62056\/ayzojb0kr"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Kitaev, A., Song, F.: A quantum algorithm for computing the unit group of an arbitrary degree number field. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 293\u2013302 (2014)","DOI":"10.1145\/2591796.2591860"},{"key":"9_CR24","unstructured":"Flori, J.P., Pl\u00fbt, J., Reinhard, J.R., Eker\u00e5, M.: Diversity and transparency for ECC. Cryptology ePrint Archive, Paper 2015\/659 (2015). https:\/\/eprint.iacr.org\/2015\/659"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45539-6_2","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"P Gaudry","year":"2000","unstructured":"Gaudry, P.: An algorithm for solving the discrete log problem on hyperelliptic curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 19\u201334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_2"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-10868-6_22","volume-title":"Cryptography and Coding","author":"S Galbraith","year":"2009","unstructured":"Galbraith, S., Ruprai, R.S.: An improvement to the gaudry-schost algorithm for multidimensional discrete logarithm problems. In: Parker, M.G. (ed.) IMACC 2009. LNCS, vol. 5921, pp. 368\u2013382. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10868-6_22"},{"issue":"1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01231536","volume":"118","author":"R Heath-Brown","year":"1994","unstructured":"Heath-Brown, R.: The size of Selmer groups for the congruent number problem. II. Inventiones Mathematicae 118(1), 331\u2013370 (1994)","journal-title":"Inventiones Mathematicae"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-20901-7_10","volume-title":"Coding and Cryptology","author":"G Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Algorithms for the shortest and closest lattice vector problems. In: Chee, Y.M., et al. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 159\u2013190. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_10"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74143-5_10","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"G Hanrot","year":"2007","unstructured":"Hanrot, G., Stehl\u00e9, D.: Improved analysis of Kannan\u2019s shortest lattice vector algorithm. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 170\u2013186. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_10"},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"563","DOI":"10.4007\/annals.2021.193.2.4","volume":"193","author":"D Harvey","year":"2021","unstructured":"Harvey, D., Van Der Hoeven, J.: Integer multiplication in time $$\\text{ O }(n\\log n)$$. Ann. Math. 193(2), 563\u2013617 (2021)","journal-title":"Ann. Math."},{"key":"9_CR31","unstructured":"IEEE-SA Standards Board. IEEE standard for pairing-based cryptographic techniques using pairings (2013). https:\/\/webpages.charlotte.edu\/yonwang\/13633-2013.pdf"},{"key":"9_CR32","unstructured":"Kitaev, A.: Quantum measurements and the abelian stabilizer problem. In: Proceedings of the Electronic Colloquium on Computational Complexity\u2013ECCC 1996, vol. TR96-03 of Reports series, p.\u00a01. University of Trier (1996)"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-38424-3_11","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"N Koblitz","year":"1991","unstructured":"Koblitz, N.: Constructing elliptic curve cryptosystems in characteristic 2. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 156\u2013167. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_11"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"N Koblitz","year":"1992","unstructured":"Koblitz, N.: CM-curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 279\u2013287. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_22"},{"issue":"1","key":"9_CR35","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s00145-024-09490-w","volume":"4","author":"D Koshelev","year":"2024","unstructured":"Koshelev, D.: Generation of \u201cindependent\" points on elliptic curves by means of Mordell-Weil lattices. Math. Cryptol. 4(1), 11\u201322 (2024)","journal-title":"Math. Cryptol."},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Lang, S.: Conjectured diophantine estimates on elliptic curves. In: Arithmetic and Geometry: Papers Dedicated to IR Shafarevich on the Occasion of His Sixtieth Birthday Volume I Arithmetic, pp. 155\u2013171 (1983)","DOI":"10.1007\/978-1-4757-9284-3_7"},{"issue":"1","key":"9_CR37","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"JC Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. ACM 32(1), 229\u2013246 (1985)","journal-title":"J. ACM"},{"issue":"177","key":"9_CR38","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Moody, D., Perlner, R., Regenscheid, A., Robinson, A., Cooper, D.: Transition to post-quantum cryptography standards. Technical report, National Institute of Standards and Technology (2024)","DOI":"10.6028\/NIST.IR.8547.ipd"},{"issue":"4","key":"9_CR40","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF00203817","volume":"6","author":"AJ Menezes","year":"1993","unstructured":"Menezes, A.J., Vanstone, S.A.: Elliptic curve cryptosystems and their implementation. J. Cryptol. 6(4), 209\u2013224 (1993). https:\/\/doi.org\/10.1007\/BF00203817","journal-title":"J. Cryptol."},{"key":"9_CR41","unstructured":"National Institute of Science and Technology, Computer security resource center. Special publication NIST 800-186: Recommendations for discrete logarithm-based cryptography: Elliptic curve domain parameters (2023). https:\/\/csrc.nist.gov\/pubs\/sp\/800\/186\/final"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. In: Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman, pp. 415\u2013430. ACM (2022)","DOI":"10.1145\/3549993.3550009"},{"key":"9_CR43","unstructured":"Pilatte, C.: Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms. arXiv preprint arXiv:2404.16450 (2024)"},{"issue":"2","key":"9_CR44","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0209022","volume":"9","author":"N Pippenger","year":"1980","unstructured":"Pippenger, N.: On the evaluation of powers and monomials. SIAM J. Comput. 9(2), 230\u2013250 (1980)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"9_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4171\/jems\/893","volume":"21","author":"J Park","year":"2019","unstructured":"Park, J., Poonen, B., Voight, J., Wood, M.M.: A heuristic for boundedness of ranks of elliptic curves. J. Eur. Math. Soc. 21(9), 1\u201341 (2019)","journal-title":"J. Eur. Math. Soc."},{"issue":"4","key":"9_CR46","first-page":"317","volume":"3","author":"J Proos","year":"2003","unstructured":"Proos, J., Zalka, C.: Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quant. Inf. Comput. 3(4), 317\u2013344 (2003)","journal-title":"Quant. Inf. Comput."},{"issue":"1","key":"9_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3708471","volume":"72","author":"O Regev","year":"2025","unstructured":"Regev, O.: An efficient quantum factoring algorithm. J. ACM 72(1), 1\u201313 (2025)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR48","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1090\/S0273-0979-02-00952-7","volume":"39","author":"K Rubin","year":"2002","unstructured":"Rubin, K., Silverberg, A.: Ranks of elliptic curves. Bull. Am. Math. Soc. 39(4), 455\u2013474 (2002)","journal-title":"Bull. Am. Math. Soc."},{"key":"9_CR49","doi-asserted-by":"publisher","unstructured":"Ragavan, S., Vaikuntanathan, V.: Space-efficient and noise-robust quantum factoring. In: Advances in Cryptology\u2013CRYPTO 2024, vol. 14925 of Lecture notes in Computer Science, pp. 107\u2013140. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68391-6_4","DOI":"10.1007\/978-3-031-68391-6_4"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science\u2013SFCS\u201994, pp. 124\u2013134. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"9_CR51","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves, volume 106 of Graduate Texts in Mathematics. Springer, Heidelberg (2009)","DOI":"10.1007\/978-0-387-09494-6"},{"key":"9_CR52","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1112\/S1461157000000668","volume":"5","author":"D Simon","year":"2002","unstructured":"Simon, D.: Computing the rank of elliptic curves over number fields. LMS J. Comput. Math. 5, 7\u201317 (2002)","journal-title":"LMS J. Comput. Math."},{"issue":"3","key":"9_CR53","doi-asserted-by":"publisher","first-page":"245","DOI":"10.4064\/aa98-3-4","volume":"98","author":"M Stoll","year":"2001","unstructured":"Stoll, M.: Implementing 2-descent for Jacobians of hyperelliptic curves. Acta Arith. 98(3), 245\u2013277 (2001)","journal-title":"Acta Arith."},{"key":"9_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-540-24847-7_31","volume-title":"Algorithmic Number Theory","author":"D Stehl\u00e9","year":"2004","unstructured":"Stehl\u00e9, D., Zimmermann, P.: A binary recursive GCD algorithm. In: Buell, D. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 411\u2013425. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24847-7_31"},{"key":"9_CR55","doi-asserted-by":"crossref","unstructured":"Tao, T., Vu, V.H.: Additive Combinatorics, vol. 105. Cambridge University Press, Cambridge (2006)","DOI":"10.1017\/CBO9780511755149"},{"key":"9_CR56","doi-asserted-by":"crossref","unstructured":"Ulmer, D.: Elliptic curves with large rank over function fields. Ann. Math. 295\u2013315 (2002)","DOI":"10.2307\/3062158"},{"key":"9_CR57","doi-asserted-by":"crossref","unstructured":"Wang, P.S.: A p-adic algorithm for univariate partial fractions. In: Proceedings of the Fourth ACM Symposium on Symbolic and Algebraic Computation, pp. 212\u2013217 (1981)","DOI":"10.1145\/800206.806398"},{"key":"9_CR58","first-page":"63","volume":"2","author":"M Watkins","year":"2014","unstructured":"Watkins, M., Donnelly, S., Elkies, N.D., Fisher, T., Granville, A., Rogers, N.F.: Ranks of quadratic twists of elliptic curves. Publications mathematiques de Besancon Algebre et theorie des nombres 2, 63\u201398 (2014)","journal-title":"Publications mathematiques de Besancon Algebre et theorie des nombres"},{"key":"9_CR59","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF01214273","volume":"147","author":"GH Zimmer","year":"1976","unstructured":"Zimmer, G.H.: On the difference of the Weil height and the N\u00e9ron-Tate height. Math. Z. 147, 35\u201351 (1976)","journal-title":"Math. Z."},{"key":"9_CR60","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/s10623-018-0492-3","volume":"87","author":"Y Zhu","year":"2019","unstructured":"Zhu, Y., Zhuang, J., Yi, H., Lv, C., Lin, D.: A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity. Des. Codes Crypt. 87, 971\u2013986 (2019)","journal-title":"Des. Codes Crypt."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06754-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:22:51Z","timestamp":1759306971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06754-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,2]]},"ISBN":["9783032067531","9783032067548"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06754-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,2]]},"assertion":[{"value":"2 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This work was supported by the project \u201cGroup schemes, root systems, and related representations\u201d founded by the European Union - NextGenerationEU through Romania\u2019s National Recovery and Resilience Plan (PNRR) call no. PNRR-III-C9-2023-I8, Project CF159\/31.07.2023, and coordinated by the Ministry of Research, Innovation and Digitalization (MCID) of Romania. The first author was supported by Agence Nationale de la Recherche under grant ANR-22-PNCQ-0002.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Medell\u00edn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciencias.medellin.unal.edu.co\/eventos\/latincrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}