{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T13:04:58Z","timestamp":1765976698869,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T00:00:00Z","timestamp":1688515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T00:00:00Z","timestamp":1688515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272491","61972429"],"award-info":[{"award-number":["62272491","61972429"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Guangdong Major Project of Basic and Applied Basic Research","award":["2019B030302008"],"award-info":[{"award-number":["2019B030302008"]}]},{"name":"the National R &D Key Program of China under Grant","award":["2022YFB2701500"],"award-info":[{"award-number":["2022YFB2701500"]}]},{"name":"General Project of Hunan Provincial Department of Education","award":["21C0326"],"award-info":[{"award-number":["21C0326"]}]},{"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-04017-x","type":"journal-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T20:10:41Z","timestamp":1688587841000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantum circuits for hyperelliptic curve discrete logarithms over the Mersenne prime fields"],"prefix":"10.1007","volume":"22","author":[{"given":"Chao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peidong","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Huang","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":[[2023,7,5]]},"reference":[{"key":"4017_CR1","first-page":"28","volume-title":"ANTS 1994, LNCS","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M., DeMarrais, J., Huang, M.A.: A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In: Adleman, L.M., Huang, M.A. (eds.) ANTS 1994, LNCS, vol. 877, pp. 28\u201340. Springer, Berlin, Heidelberg (1994)"},{"issue":"1","key":"4017_CR2","first-page":"451","volume":"2021","author":"G Banegas","year":"2021","unstructured":"Banegas, G., Bernstein, D.J., van Hoof, I., Lange, T.: Concrete quantum cryptanalysis of binary elliptic curves. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1), 451\u2013472 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"4017_CR3","first-page":"317","volume-title":"ASIACRYPT 2014, LNCS","author":"DJ Bernstein","year":"2014","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., Schwabe, P.: Kummer strikes back: new DH speed records. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, LNCS, vol. 8873, pp. 317\u2013337. Springer, Berlin, Heidelberg (2014)"},{"key":"4017_CR4","first-page":"203","volume-title":"PKC 2014, LNCS","author":"JW Bos","year":"2014","unstructured":"Bos, J.W., Costello, C., Miele, A.: Elliptic and hyperelliptic curves: a practical security analysis. In: Krawczyk, H. (ed.) PKC 2014, LNCS, vol. 8383, pp. 203\u2013220. Springer, Berlin, Heidelberg (2014)"},{"issue":"1","key":"4017_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/RevModPhys.82.1","volume":"82","author":"AM Childs","year":"2010","unstructured":"Childs, A.M., van Dam, W.: Quantum algorithms for algebraic problems. Rev. Modern Phys. 82(1), 1\u201352 (2010)","journal-title":"Rev. Modern Phys."},{"issue":"4","key":"4017_CR6","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."},{"volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","year":"2005","key":"4017_CR7","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman and Hall\/CRC, New York (2005)"},{"issue":"270","key":"4017_CR8","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1090\/S0025-5718-09-02295-9","volume":"79","author":"R Cosset","year":"2010","unstructured":"Cosset, R.: Factorization with genus 2 curves. Math. Comput. 79(270), 1191\u20131208 (2010)","journal-title":"Math. Comput."},{"key":"4017_CR9","unstructured":"Cuccaro, S.A., Draper, T.G., Kutina, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit. arXiv (2004). arXiv:quant-ph\/0410184"},{"issue":"6","key":"4017_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"4017_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1515\/JMC.2007.012","volume":"1","author":"P Gaudry","year":"2007","unstructured":"Gaudry, P.: Fast genus 2 arithmetic based on Theta functions. J. Math. Cryptol. 1(3), 243\u2013265 (2007)","journal-title":"J. Math. Cryptol."},{"key":"4017_CR12","first-page":"425","volume-title":"PQCrypto 2020, LNCS","author":"T H\u00e4ner","year":"2020","unstructured":"H\u00e4ner, T., Jaques, S., Naehrig, M., Roetteler, M., Soeken, M.: Improved quantum circuits for elliptic curve discrete logarithms. In: Ding, J., Tillich, J. (eds.) PQCrypto 2020, LNCS, vol. 12100, pp. 425\u2013444. Springer, Cham (2020)"},{"issue":"7 &8","key":"4017_CR13","first-page":"673","volume":"17","author":"T H\u00e4ner","year":"2017","unstructured":"H\u00e4ner, T., Roetteler, M., Svore, K.M.: Factoring using $$2n+2$$ qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17(7 &8), 673\u2013684 (2017)","journal-title":"Quantum Inf. Comput."},{"issue":"2","key":"4017_CR14","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.: Jacobian coordinates on genus 2 curves. J. Cryptol. 30(2), 572\u2013600 (2017)","journal-title":"J. Cryptol."},{"key":"4017_CR15","first-page":"126","volume":"404","author":"Z Hu","year":"2021","unstructured":"Hu, Z., Lin, D., Zhao, C.: Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems. Appl. Math. Comput. 404, 126\u2013239 (2021)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"4017_CR16","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, Z., Zhang, F., Ding, Y., Cheng, R.: Quantum algorithm for solving hyperelliptic curve discrete logarithm problem. Quantum Inf. Process. 19(2), 62 (2020)","journal-title":"Quantum Inf. Process."},{"issue":"177","key":"4017_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comp. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comp."},{"issue":"3","key":"4017_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptol. 1(3), 139\u2013150 (1989)","journal-title":"J. Cryptol."},{"key":"4017_CR19","first-page":"417","volume-title":"CRYPTO 85, LNCS","author":"VS Miller","year":"1985","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 85, LNCS, vol. 218, pp. 417\u2013426. Springer, Berlin, Heidelberg (1985)"},{"issue":"4","key":"4017_CR20","first-page":"317","volume":"3","author":"J Proos","year":"2003","unstructured":"Proos, J., Zalka, C.: Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf. Comput. 3(4), 317\u2013344 (2003)","journal-title":"Quantum Inf. Comput."},{"key":"4017_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-319-70697-9_10","volume-title":"ASIACRYPT 2017, LNCS","author":"J Renes","year":"2017","unstructured":"Renes, J., Smith, B.: qDSA: small and secure digital signatures with curve-based Diffie-Hellman key pairs. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, LNCS, vol. 10625, pp. 273\u2013302. Springer, Cham (2017)"},{"issue":"2","key":"4017_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"4017_CR23","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-70697-9_9","volume-title":"ASIACRYPT 2017, LNCS","author":"M Roetteler","year":"2017","unstructured":"Roetteler, M., Naehrig, M., Svore, K.M., Lauter, K.E.: Quantum resource estimates for computing elliptic curve discrete logarithms. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, LNCS, vol. 10625, pp. 241\u2013270. Springer, Cham (2017)"},{"key":"4017_CR24","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual symposium on foundations of computer science, pp. 124\u2013134. IEEE Computer Society, Santa Fe (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"5","key":"4017_CR25","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"4017_CR26","doi-asserted-by":"crossref","unstructured":"Svore, K.M., Geller, A., Troyer, M., Azariah, J., Granade, C.E., Heim, B., Kliuchnikov, V., Mykhailova, M., Paz, A., Roetteler, M.: Q#: Enabling scalable quantum computing and development with a high-level DSL. In: RWDSL@CGO 2018, pp. 7:1 \u20137:10. ACM, New York (2018)","DOI":"10.1145\/3183895.3183901"},{"key":"4017_CR27","unstructured":"Wecker, D., Svore, K.M.: LIQU$$i|{}\\rangle $$ : A software design architecture and domain-specific language for quantum computing. CoRR abs\/1402.4467 (2014)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04017-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-04017-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04017-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T18:24:17Z","timestamp":1729707857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-04017-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,5]]},"references-count":27,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2023,7]]}},"alternative-id":["4017"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-04017-x","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2023,7,5]]},"assertion":[{"value":"7 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2023","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":"274"}}