{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T09:49:21Z","timestamp":1761817761208,"version":"build-2065373602"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:00Z","timestamp":1758585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:00Z","timestamp":1758585600000},"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","doi-asserted-by":"crossref","award":["12401696"],"award-info":[{"award-number":["12401696"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation of China","doi-asserted-by":"crossref","award":["2022JJ40154"],"award-info":[{"award-number":["2022JJ40154"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272491","62202475"],"award-info":[{"award-number":["62272491","62202475"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangdong Provincial Key Laboratory of Information Security Technology","award":["2023B1212060026"],"award-info":[{"award-number":["2023B1212060026"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-04916-1","type":"journal-article","created":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T05:33:41Z","timestamp":1758605621000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved quantum circuits for elliptic curve discrete logarithm problems on Ed25519"],"prefix":"10.1007","volume":"24","author":[{"given":"Yan","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijian","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longjiang","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,23]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Shor, P.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. FOCS 1994, IEEE, pp. 124-134, (1994) https:\/\/doi.org\/10.1109\/SFCS.1994.365700.","key":"4916_CR1","DOI":"10.1109\/SFCS.1994.365700."},{"doi-asserted-by":"crossref","unstructured":"Zalka, C., Proos, J.: Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf. Comput. 3(4): 317-344, (2003) http:\/\/portal.acm.org\/citation.cfm?id=2011531","key":"4916_CR2","DOI":"10.26421\/QIC3.4-3"},{"doi-asserted-by":"publisher","unstructured":"Roetteler, M., Naehrig, M., Svore, K. M., Lauter, K.: Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms. ASIACRYPT 2017, Springer LNCS 10625, 241-270, (2017) https:\/\/doi.org\/10.1007\/978-3-319-70697-9_9","key":"4916_CR3","DOI":"10.1007\/978-3-319-70697-9_9"},{"doi-asserted-by":"publisher","unstructured":"H\u00e4ner, T., Jaques, S., Naehrig, M., Roettelerm, M., Soeken, M.: Improved quantum circuits for elliptic curve discrete logarithms. PQC 2020. Springer LNCS 12100 425\u2013444 (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_23","key":"4916_CR4","DOI":"10.1007\/978-3-030-44223-1_23"},{"issue":"2","key":"4916_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s13389-012-0027-1","volume":"2","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.: High speed high-security signatures. J. Cryptogr. Eng. 2(2), 77\u201389 (2012). https:\/\/doi.org\/10.1007\/s13389-012-0027-1","journal-title":"J. Cryptogr. Eng."},{"issue":"7","key":"4916_CR6","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1109\/TVLSI.2021.3077885","volume":"29","author":"M Bisheh-Niasar","year":"2021","unstructured":"Bisheh-Niasar, M., Azarderakhsh, R., Mozaffari-Kermani, M.: Cryptographic Accelerators for Digital Signature Based on Ed25519. IEEE Trans. Very Large Scale Integr. Syst. 29(7), 1297\u20131305 (2021). https:\/\/doi.org\/10.1109\/TVLSI.2021.3077885","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"doi-asserted-by":"crossref","unstructured":"Luo, Y., M.: Difference between ECDSA with ED25519 and Their Future. J. Discret. Math. Sci. Cryptogr. 39, 1122\u20131126 (2023). https:\/\/doi.org\/10.54097\/hset.v39i.6717","key":"4916_CR7","DOI":"10.54097\/hset.v39i.6717"},{"unstructured":"Hopwood, D., Bowe, S., Hornby, T., Wilcox. N.: ZCash Protocol Specification Version 2020. https:\/\/github.com\/zcash\/zips\/blob\/master\/protocol\/protocol.pdf","key":"4916_CR8"},{"unstructured":"Things That Use Ed25519, (2020) https:\/\/ianix.com\/pub\/ed25519-deployment.mtl","key":"4916_CR9"},{"doi-asserted-by":"publisher","unstructured":"Pereida Garc\u00eda, C., Sovio, S.: Size, Speed, and Security: An Ed25519 Case Study. Secure IT Systems. NordSec 2021. Springer LNCS 13115, pp. 16-30, (2021). https:\/\/doi.org\/10.1007\/978-3-030-91625-1_2","key":"4916_CR10","DOI":"10.1007\/978-3-030-91625-1_2"},{"unstructured":"National Institute of Standards and Technology. Request for Comments on FIPS 186-5 and SP 800-186, (2020). https:\/\/www.federalregister.gov\/documents\/2019\/10\/31\/2019-23742\/request-for-comments-on-fips-186-5-and-sp-800-186","key":"4916_CR11"},{"unstructured":"Rescorla, E.: RFC 8446: The Transport Layer Security (TLS) Protocol Version 1.3, 2020. https:\/\/tools.ietf.org\/html\/rfc8446","key":"4916_CR12"},{"doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. AFRICACRYPT 2008. Springer LNCS 5023, pp. 389-405, (2008).https:\/\/doi.org\/10.1007\/978-3-540-68164-9_26","key":"4916_CR13","DOI":"10.1007\/978-3-540-68164-9_26"},{"key":"4916_CR14","doi-asserted-by":"publisher","first-page":"74","DOI":"10.22331\/q-2018-06-18-74","volume":"2","author":"C Gidney","year":"2018","unstructured":"Gidney, C.: Halving the cost of quantum addition. Quantum 2, 74 (2018)","journal-title":"Quantum"},{"unstructured":"Draper, T. G., Kustin, S. A., Rains, E. M., Svore, K. M.: A logarithm-depth quantum carry-lookahead adder, arXiv: quant-ph\/040612, (2004)","key":"4916_CR15"},{"issue":"9 & 10","key":"4916_CR16","first-page":"872","volume":"10","author":"Y Takahashi","year":"2010","unstructured":"Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits and unbounded fan-out. Quantum Inf. Comput. 10(9 & 10), 872\u2013890 (2010)","journal-title":"Quantum Inf. Comput."},{"unstructured":"Luongo, A., Miti, AM.: Narasimhachar V, et al. Measurement-based uncomputation of quantum circuits for modular arithmetic. arXiv:quant-ph\/2407.20167, (2024)","key":"4916_CR17"},{"doi-asserted-by":"publisher","unstructured":"Montgomery, P., L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985). https:\/\/doi.org\/10.1090\/S0025-5718-1985-0777282-X","key":"4916_CR18","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"issue":"5","key":"4916_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.108.052405","volume":"108","author":"M Ramezani","year":"2023","unstructured":"Ramezani, M., Nikaeen, M., FarmanSeyed, F., et al.: Quantum multiplication algorithm based on the convolution theorem. Phys. Rev. A 108(5), 052405 (2023). https:\/\/doi.org\/10.1103\/physreva.108.052405","journal-title":"Phys. Rev. A"},{"unstructured":"Bos, J. W., Kleinjung T., Page D.: Efficient modular multiplication. https:\/\/eprint.iacr.org\/2021\/1151","key":"4916_CR20"},{"key":"4916_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4230\/LIPIcs.TQC.2017.7","volume":"73","author":"A Parent","year":"2017","unstructured":"Parent, A., Roetteler, M., Mosca, M.: Improved reversible and quantum circuits for Karatsuba-based integer multiplication. On the Theory of Quantum Computation, Communication and Cryptography 73, 1\u201315 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2017.7","journal-title":"On the Theory of Quantum Computation, Communication and Cryptography"},{"doi-asserted-by":"publisher","unstructured":"Hales, T., Raya, R.: Formal Proof of the Group Law for Edwards Elliptic Curves. IJCAR 2020. Springer LCNS 12167, pp. 254-269, (2008). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_15","key":"4916_CR22","DOI":"10.1007\/978-3-030-51054-1_15"},{"key":"4916_CR23","doi-asserted-by":"publisher","first-page":"1929","DOI":"10.1090\/mcom\/3036","volume":"85","author":"D Moody","year":"2015","unstructured":"Moody, D., Shumow, D.: Analogues of Velu\u2019s formulas for isogenies on alternate models of \u00b4elliptic curves. Math. Comput. 85, 1929\u20131951 (2015). https:\/\/doi.org\/10.1090\/mcom\/3036","journal-title":"Math. Comput."},{"unstructured":"Solinas, JA.: Generalized Mersenne numbers. Technical Report CORR 99-39, Centre for Applied Cryptographic Research, (1999)","key":"4916_CR24"},{"key":"4916_CR25","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s11128-023-04017-x","volume":"22","author":"C Chen","year":"2023","unstructured":"Chen, C., Guan, P., Huang, Y., Fangguo, Z.: Quantum circuits for hyperelliptic curve discrete logarithms over the Mersenne prime fields. Quantum Inf. Process. 22, 274 (2023). https:\/\/doi.org\/10.1007\/s11128-023-04017-x","journal-title":"Quantum Inf. Process."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04916-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04916-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04916-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T09:47:30Z","timestamp":1761817650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04916-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,23]]},"references-count":25,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["4916"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04916-1","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,9,23]]},"assertion":[{"value":"18 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"311"}}