{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T10:03:47Z","timestamp":1765965827116,"version":"3.48.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T00:00:00Z","timestamp":1765929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T00:00:00Z","timestamp":1765929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12401696"],"award-info":[{"award-number":["12401696"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62204275"],"award-info":[{"award-number":["62204275"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272491"],"award-info":[{"award-number":["62272491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    It is well-established that Shor\u2019s algorithm can solve the discrete logarithm problem (DLP) in polynomial time. The hyperelliptic curve DLP (HCDLP) of genus 2 has found widespread industrial applications and remains an active research domain. In this work, we develop a quantum algorithm for solving HCDLP over binary fields\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathbb {F}_{2^n}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>F<\/mml:mi>\n                            <mml:msup>\n                              <mml:mn>2<\/mml:mn>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msup>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    by adapting Shor\u2019s algorithmic framework. The core innovation lies in our divisor addition implementation, which combines the geometric interpretation of divisor operations with symmetric polynomial techniques. Using representative parameters (\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$n = 163, 283, 571$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>n<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>163<\/mml:mn>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mn>283<\/mml:mn>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mn>571<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    ), we quantify the required quantum resources from the perspective of minimal qubit count, minimal T-gate usage, and minimal quantum depth. Furthermore, we compare the quantum resources required for solving HCDLP over binary fields with those for solving HCDLP over general prime fields and demonstrate the vulnerability of HCDLP-based cryptosystems to quantum attacks. Our analysis reveals that: (1) solving HCDLP over binary fields requires fewer quantum gates and less quantum depth compared to solving it over general prime fields; (2) the maximum achievable quantum depth for HCDLP attacks falls below NIST\u2019s minimum security threshold of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2^{40}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mn>40<\/mml:mn>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    for comparable protection levels, and (3) the quantum computational cost is orders of magnitude lower than the\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2^{157}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mn>157<\/mml:mn>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    resources needed for AES-128 attacks.\n                  <\/jats:p>","DOI":"10.1186\/s42400-025-00515-w","type":"journal-article","created":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T09:58:06Z","timestamp":1765965486000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum algorithm for solving binary hyperelliptic curve discrete logarithm problem"],"prefix":"10.1186","volume":"8","author":[{"given":"Yan","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijian","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,17]]},"reference":[{"key":"515_CR1","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 1994","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"4","key":"515_CR2","first-page":"317","volume":"3","author":"J Proos","year":"2003","unstructured":"Proos J, Zalka C (2003) Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf Comput 3(4):317\u2013344","journal-title":"Quantum Inf Comput"},{"key":"515_CR3","doi-asserted-by":"crossref","unstructured":"Roetteler M, Naehrig M, Krysta MS, Lauter K (2017) Quantum resource estimates for computing elliptic curve discrete logarithms. In: Takagi T, Peyrin T. (eds) Advances in Cryptology\u2013ASIACRYPT 2017, 241\u2013271, (2017)","DOI":"10.1007\/978-3-319-70697-9_9"},{"key":"515_CR4","doi-asserted-by":"crossref","unstructured":"H\u00e4ner T, Jaques S, Naehrig M, Roetteler M, Soeken M (2020) Improved quantum circuits for elliptic curve discrete logarithms. In: Ding J, Tillich JP. (eds) Post-Quantum Cryptography 2020, 425\u2013444","DOI":"10.1007\/978-3-030-44223-1_23"},{"key":"515_CR5","first-page":"451","volume":"2021","author":"G Banegas","year":"2021","unstructured":"Banegas G, Bernstein D, Hoof IV, Lange T (2021) Concrete quantum cryptanalysis of binary elliptic curves. IACR Trans Cryptogr Hardw Embedded Syst 2021:451\u2013472","journal-title":"IACR Trans Cryptogr Hardw Embedded Syst"},{"key":"515_CR6","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s11128-024-04323-y","volume":"23","author":"R Taguchi","year":"2024","unstructured":"Taguchi R, Takayasu A (2024) Concrete quantum cryptanalysis of binary elliptic curves via addition chain. Quantum Inf Process 23:122. https:\/\/doi.org\/10.1007\/s11128-024-04323-y","journal-title":"Quantum Inf Process"},{"key":"515_CR7","doi-asserted-by":"crossref","unstructured":"Salam T, Hossen S (2021) HECC (Hyperelliptic Curve Cryptography) In: Ahmad KAB, Ahmad K, Dulhare UN (eds) Functional Encryption, 2021, 59\u201378","DOI":"10.1007\/978-3-030-60890-3_4"},{"key":"515_CR8","doi-asserted-by":"crossref","unstructured":"Bos JW, Costello C, Miele A (2014) Elliptic and hyperelliptic curves: a practical security analysis. In: Krawczyk H (eds) Public-Key Cryptography \u2013PKC 2014, 203\u2013220","DOI":"10.1007\/978-3-642-54631-0_12"},{"key":"515_CR9","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/s11128-019-2562-5","volume":"19","author":"Y Huang","year":"2020","unstructured":"Huang Y, Su ZF, Zhang FG, Cheng R, Ding Y (2020) Quantum algorithm for solving hyperelliptic curve discrete logarithms problem. Quantum Inf Process 19:62. https:\/\/doi.org\/10.1007\/s11128-019-2562-5","journal-title":"Quantum Inf Process"},{"key":"515_CR10","doi-asserted-by":"publisher","first-page":"2550021","DOI":"10.1142\/S0219749925500212","volume":"23","author":"Y Huang","year":"2025","unstructured":"Huang Y, Zhang FG, Su ZF, Zhou ZJ (2025) Quantum algorithm for solving discrete logarithm problem on jacobians of genus 3 hyperelliptic curves. Int J Quantum Inf 23:2550021\u2013134","journal-title":"Int J Quantum Inf"},{"key":"515_CR11","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 PD, Huang Y, Zhang FG (2023) Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime field. Quantum Inf Process 22:274. https:\/\/doi.org\/10.1007\/s11128-023-04017-x","journal-title":"Quantum Inf Process"},{"key":"515_CR12","unstructured":"Hoof IV (2019) Space-efficient quantum multiplication of polynomials for binary finite fields with sub-quadratic Toffoli gate count. arXiv:1910.02849"},{"key":"515_CR13","doi-asserted-by":"crossref","unstructured":"Jang K, Kim W, Lim S, Kang Y, Yang Y, Seo H (2023) Optimized implementation of quantum binary field multiplication with toffoli depth one. In: You I, Youn TY (eds) Information Security Applications 2023, pp. 256\u2013264","DOI":"10.1007\/978-3-031-25659-2_18"},{"key":"515_CR14","first-page":"2022","volume":"2004\u2013107","author":"DSC Putranto","year":"2022","unstructured":"Putranto DSC, Wardhani RW, Larasati HT, Kim H (2022) Another concrete quantum cryptanalysis of binary elliptic curves. Cryptol ePrint Archive 2004\u2013107:2022","journal-title":"Cryptol ePrint Archive"},{"key":"515_CR15","first-page":"781","volume":"2025","author":"K Jang","year":"2025","unstructured":"Jang K, Srivastava V et al (2025) New quantum cryptanalysis of binary elliptic curves. ACR Trans Cryptogr Hardw Embed Syst 2025:781\u2013804","journal-title":"ACR Trans Cryptogr Hardw Embed Syst"},{"key":"515_CR16","volume-title":"Handbook of elliptic and hyperelliptic curve cryptography","author":"R Avanzi","year":"2005","unstructured":"Avanzi R, Doche C et al (2005) Handbook of elliptic and hyperelliptic curve cryptography. CRC Press"},{"key":"515_CR17","unstructured":"Byramjee B, Duquesne S (2004) Classification of Genus 2 Curves over $${\\mathbb{F}}_{2^n}$$ and Optimization of Their Arithmetic. arXiv:1503.07894"},{"issue":"10","key":"515_CR18","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s11128-024-04536-1","volume":"23","author":"S Kim","year":"2024","unstructured":"Kim S, Kim I, Kim S, Hong S (2024) Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication. Quantum Inf Process 23(10):330","journal-title":"Quantum Inf Process"},{"issue":"6","key":"515_CR19","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TCAD.2003.811448","volume":"22","author":"V Shende","year":"2003","unstructured":"Shende V, Prasad AK, Markov IL, Hayes JP (2003) Synthesis of reversible logic circuits. IEEE Trans Comput Aided Des 22(6):710\u2013722","journal-title":"IEEE Trans Comput Aided Des"},{"key":"515_CR20","doi-asserted-by":"crossref","unstructured":"Toffoli T (1980) Reversible computing. In de Bakker, J, van Leeuwen J (eds) Automata, Languages and Programming 1980, pp. 632\u2013644","DOI":"10.1007\/3-540-10003-2_104"},{"issue":"1","key":"515_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0003-4916(02)00018-0","volume":"303","author":"AY Kitaev","year":"2003","unstructured":"Kitaev AY (2003) Fault-tolerant quantum computation by anyons. Ann Phys 303(1):2\u201330","journal-title":"Ann Phys"},{"key":"515_CR22","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/s00145-016-9227-7","volume":"30","author":"H Hisil","year":"2017","unstructured":"Hisil H, Costello C (2017) Jacobian coordinates on genus 2 curves. J Cryptol 30:572\u2013600","journal-title":"J Cryptol"},{"key":"515_CR23","unstructured":"Coppersmith D. An approximate Fourier transform useful in quantum factoring. arXiv:1910.02849"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00515-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00515-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00515-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T09:58:13Z","timestamp":1765965493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00515-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,17]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["515"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00515-w","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,17]]},"assertion":[{"value":"29 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 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 that there is no Conflict of interest regarding the publication of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"117"}}