{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T15:51:11Z","timestamp":1781797871301,"version":"3.54.5"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272491"],"award-info":[{"award-number":["62272491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272491"],"award-info":[{"award-number":["62272491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1007\/s00224-026-10284-9","type":"journal-article","created":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T14:52:05Z","timestamp":1781794325000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating Stage 2 in ECM Using Elliptic Divisibility Sequences"],"prefix":"10.1007","volume":"70","author":[{"given":"Ziwen","family":"Liao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,18]]},"reference":[{"key":"10284_CR1","doi-asserted-by":"crossref","unstructured":"Lenstra, H.W., Jr.: Factoring integers with elliptic curves. Annals of Mathematics, 649\u2013673 (1987)","DOI":"10.2307\/1971363"},{"key":"10284_CR2","doi-asserted-by":"crossref","unstructured":"Pollard, J.M.: Theorems on factorization and primality testing. In: Mathematical proceedings of the Cambridge philosophical society, volume\u00a076, Cambridge University Press, pp. 521\u2013528 (1974)","DOI":"10.1017\/S0305004100049252"},{"key":"10284_CR3","doi-asserted-by":"crossref","unstructured":"Zimmermann, P.,\u00a0Dodson, B.: 20 years of ECM. In: International Algorithmic Number Theory Symposium, Springer, pp. 525\u2013542 (2006)","DOI":"10.1007\/11792086_37"},{"key":"10284_CR4","unstructured":"Zimmermann, P., et\u00a0al.: GMP-ECM:elliptic curve method for integer factorization (2010). https:\/\/gforge.inria.fr\/projects\/ecm\/"},{"key":"10284_CR5","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1090\/S0025-5718-2012-02633-0","volume":"82","author":"DJ Bernstein","year":"2013","unstructured":"Bernstein, D.J., Birkner, P., Lange, T., Peters, C.: Ecm using edwards curves. Math. Comput. 82, 1139\u20131179 (2013)","journal-title":"Math. Comput."},{"key":"10284_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Birkner, P., Lange, T., Peters, C.: EECM-MPFQ: Ecm using edwards curves (2012). http:\/\/eecm.cr.yp.to\/index.html","DOI":"10.1090\/S0025-5718-2012-02633-0"},{"key":"10284_CR7","doi-asserted-by":"crossref","unstructured":"Hisil, H., Wong, K.K.-H., Carter, G., Dawson, E.: Twisted edwards curves revisited. In: International conference on the theory and application of cryptology and information security, Springer, pp. 326\u2013343 (2008)","DOI":"10.1007\/978-3-540-89255-7_20"},{"key":"10284_CR8","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Kleinjung, T.: Ecm at work. In: International Conference on the Theory and Application of Cryptology and Information Security, Springer, pp. 467\u2013484 (2012)","DOI":"10.1007\/978-3-642-34961-4_29"},{"key":"10284_CR9","doi-asserted-by":"crossref","unstructured":"Bouvier, C., Imbert, L.: Faster cofactorization with ecm using mixed representations. In: Public-Key Cryptography\u2013PKC 2020: 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4\u20137, 2020, Proceedings, Part II 23, Springer, pp. 483\u2013504 (2020)","DOI":"10.1007\/978-3-030-45388-6_17"},{"key":"10284_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0091534","volume-title":"The development of the number field sieve","author":"AK Lenstra","year":"1993","unstructured":"Lenstra, A.K., Lenstra, H.W.: The development of the number field sieve, vol. 1554. Springer Science & Business Media, Berlin (1993)"},{"key":"10284_CR11","unstructured":"The CADO-NFS Development Team.: CADO-NFS, an implementation of the number field sieve algorithm (2017). http:\/\/cado-nfs.gforge.inria.fr\/, release 2.3.0"},{"key":"10284_CR12","doi-asserted-by":"crossref","unstructured":"Pomerance, C.: The quadratic sieve factoring algorithm. In: Workshop on the Theory and Application of of Cryptographic Techniques, Springer, pp. 169\u2013182 (1984)","DOI":"10.1007\/3-540-39757-4_17"},{"key":"10284_CR13","doi-asserted-by":"crossref","unstructured":"Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thom\u00e9, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., et\u00a0al.: Factorization of a 768-bit rsa modulus. In: Advances in Cryptology\u2013CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings 30, Springer, pp. 333\u2013350 (2010)","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"10284_CR14","unstructured":"Bernstein, D.J., Chen, T.-R., Cheng, C.-M., Lange, T., Yang, B.-Y.: Ecm on graphics cards. In: Advances in Cryptology-EUROCRYPT 2009: 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26-30, 2009. Proceedings 28, Springer, pp. 483\u2013501 (2009)"},{"key":"10284_CR15","unstructured":"Bernstein, D.J., Chen, H.-C., Chen, M.-S., Cheng, C.-M., Hsiao, C.-H., Lange, T., Lin, Z.-C., Yang, B.-Y.: The billion-mulmod-per-second pc, in: Workshop record of SHARCS, vol.\u00a09, pp. 131\u2013144 (2009)"},{"key":"10284_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.2307\/2371930","volume":"70","author":"M Ward","year":"1948","unstructured":"Ward, M.: Memoir on elliptic divisibility sequences. Am. J. Math. 70, 31\u201374 (1948)","journal-title":"Am. J. Math."},{"key":"10284_CR17","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1215\/S0012-7094-48-01582-8","volume":"15","author":"M Ward","year":"1948","unstructured":"Ward, M.: The law of repetition of primes in an elliptic divisibility sequence. Duke Math. J. 15, 941\u2013946 (1948)","journal-title":"Duke Math. J."},{"key":"10284_CR18","unstructured":"Swart, C.S.: Elliptic curves and related sequences. Ph.D. thesis, University of London (2003)"},{"key":"10284_CR19","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00229-004-0468-7","volume":"114","author":"JH Silverman","year":"2004","unstructured":"Silverman, J.H.: Common divisors of elliptic divisibility sequences over function fields. Manuscripta Math. 114, 431\u2013446 (2004)","journal-title":"Manuscripta Math."},{"key":"10284_CR20","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00208-004-0608-0","volume":"332","author":"JH Silverman","year":"2005","unstructured":"Silverman, J.H.: p-adic properties of division polynomials and elliptic divisibility sequences. Math. Ann. 332, 443\u2013471 (2005)","journal-title":"Math. Ann."},{"key":"10284_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.jnt.2005.08.002","volume":"118","author":"G Everest","year":"2006","unstructured":"Everest, G., Mclaren, G., Ward, T.: Primitive divisors of elliptic divisibility sequences. J. Number Theory 118, 71\u201389 (2006)","journal-title":"J. Number Theory"},{"key":"10284_CR22","unstructured":"Shipsey, R., Swart, C.: Elliptic divisibility sequences and the elliptic curve discrete logarithm problem (2008). https:\/\/eprint.iacr.org\/2008\/444"},{"key":"10284_CR23","doi-asserted-by":"crossref","unstructured":"Lauter, K.E., Stange, K.E.: The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences. In: International Workshop on Selected Areas in Cryptography, Springer, pp. 309\u2013327 (2008)","DOI":"10.1007\/978-3-642-04159-4_20"},{"key":"10284_CR24","volume-title":"An FFT extension of the elliptic curve method of factorization","author":"PL Montgomery","year":"1992","unstructured":"Montgomery, P.L.: An FFT extension of the elliptic curve method of factorization. University of California, Los Angeles, Los Angeles (1992)"},{"key":"10284_CR25","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Kohel, D., Lange, T.: Twisted hessian curves. In: International Conference on Cryptology and Information Security in Latin America, Springer, pp. 269\u2013294 (2015)","DOI":"10.1007\/978-3-319-22174-8_15"},{"key":"10284_CR26","unstructured":"Shipsey, R.: Elliptic divisibility sequences. Ph.D. thesis, Goldsmith\u2019s College University of London (2000)"},{"key":"10284_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The arithmetic of elliptic curves","author":"JH Silverman","year":"2009","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves, vol. 106. Springer, New York (2009)"},{"key":"10284_CR28","doi-asserted-by":"publisher","DOI":"10.1201\/9781420071474","volume-title":"Elliptic curves: number theory and cryptography","author":"LC Washington","year":"2008","unstructured":"Washington, L.C.: Elliptic curves: number theory and cryptography. CRC Press, Boca Raton, FL (2008)"},{"key":"10284_CR29","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted edwards curves. In: Progress in Cryptology\u2013AFRICACRYPT 2008: First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008. Proceedings 1, Springer, pp. 389\u2013405 (2008)","DOI":"10.1007\/978-3-540-68164-9_26"},{"key":"10284_CR30","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Birkner, P., Lange, T.: Starfish on strike. In: Progress in Cryptology\u2013LATINCRYPT 2010: First International Conference on Cryptology and Information Security in Latin America, Puebla, Mexico, August 8-11, 2010, proceedings 1, Springer, pp. 61\u201380 (2010)","DOI":"10.1007\/978-3-642-14712-8_4"},{"key":"10284_CR31","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00200-011-0153-5","volume":"22","author":"R Moloney","year":"2011","unstructured":"Moloney, R., McGuire, G.: Two kinds of division polynomials for twisted edwards curves. Appl. Algebra Eng. Commun. Comput. 22, 321\u2013345 (2011)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"10284_CR32","unstructured":"Bernstein, D.J.: Scaled remainder trees (2004). http:\/\/cr.yp.to\/papers.html#scaledmod.IDe2b8da026cf72d01d97e20cf2874f278. Citations in this document 18"},{"key":"10284_CR33","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1017\/9781139049801.011","volume":"44","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J.: Fast multiplication and its applications. Algorith. Number Theory 44, 325\u2013384 (2008)","journal-title":"Algorith. Number Theory"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10284-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-026-10284-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-026-10284-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T14:52:20Z","timestamp":1781794340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-026-10284-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,18]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["10284"],"URL":"https:\/\/doi.org\/10.1007\/s00224-026-10284-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,18]]},"assertion":[{"value":"22 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"40"}}