{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:50Z","timestamp":1765113050007,"version":"3.41.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T00:00:00Z","timestamp":1747267200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T00:00:00Z","timestamp":1747267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Hubei Provincial Natural Science Foundation Joint Fund Project","award":["2024AFD066","2024AFD066","2024AFD066","2024AFD066","2024AFD066"],"award-info":[{"award-number":["2024AFD066","2024AFD066","2024AFD066","2024AFD066","2024AFD066"]}]},{"name":"Campus Research Project of Hubei Minzu University","award":["XN2304","XN2304","XN2304","XN2304","XN2304"],"award-info":[{"award-number":["XN2304","XN2304","XN2304","XN2304","XN2304"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62262020, 12164037"],"award-info":[{"award-number":["62262020, 12164037"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-04749-y","type":"journal-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T05:57:01Z","timestamp":1747288621000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum circuit implementation for $$\\mathbb {F}_{2^8}$$ multiplication based on algebraic curve method"],"prefix":"10.1007","volume":"24","author":[{"given":"Haoyu","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingbin","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanmeng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lang","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,15]]},"reference":[{"issue":"2","key":"4749_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. Siam Rev. 41(2), 303\u2013332 (1999)","journal-title":"Siam Rev."},{"key":"4749_CR2","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC \u201996, pp. 212\u2013219. Association for Computing Machinery, New York, NY, USA (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"4749_CR3","unstructured":"Wang, S., Li, X., Lee, W.J.B., Deb, S., Lim, E., Chattopadhyay, A.: A comprehensive study of quantum arithmetic circuits (2024). https:\/\/arxiv.org\/abs\/2406.03867"},{"key":"4749_CR4","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography2030025","author":"J-L Danger","year":"2018","unstructured":"Danger, J.-L., El Housni, Y., Facon, A., Gueye, C.T., Guilley, S., Herbel, S., Ndiaye, O., Persichetti, E., Schaub, A.: On the performance and security of multiplication in $$\\mathbb{G}\\mathbb{F} (2^n)$$. Cryptography (2018). https:\/\/doi.org\/10.3390\/cryptography2030025","journal-title":"Cryptography"},{"key":"4749_CR5","unstructured":"Kerry, C.F., Secretary, A., Director, C.R.: Fips pub 186-4 federal information processing standards publication digital signature standard (dss) (2013)"},{"key":"4749_CR6","doi-asserted-by":"publisher","unstructured":"Fowler, A.G., Devitt, S.J.: A bridge to lower overhead quantum computation. arXiv e-prints, 1209\u20130510 (2012) https:\/\/doi.org\/10.48550\/arXiv.1209.0510. _eprint: 1209.0510","DOI":"10.48550\/arXiv.1209.0510"},{"key":"4749_CR7","doi-asserted-by":"publisher","unstructured":"O\u2019Gorman, J., Campbell, E.T.: Quantum computation with realistic magic-state factories. 95(3), 032338 (2017) https:\/\/doi.org\/10.1103\/PhysRevA.95.032338. _eprint: 1605.07197","DOI":"10.1103\/PhysRevA.95.032338"},{"issue":"4","key":"4749_CR8","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ace6ca","volume":"8","author":"Y Liu","year":"2023","unstructured":"Liu, Y., Ma, Z., Luo, L., Du, C., Fei, Y., Wang, H., Duan, Q., Yang, J.: Magic state distillation and cost analysis in fault-tolerant universal quantum computation. Quantum Sci. Technol. 8(4), 043001 (2023). https:\/\/doi.org\/10.1088\/2058-9565\/ace6ca","journal-title":"Quantum Sci. Technol."},{"key":"4749_CR9","volume-title":"On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography","author":"D Cheung","year":"2007","unstructured":"Cheung, D., Mathew, J., Pradhan, D.K., Maslov, D.: On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography. Springer, Berlin Heidelberg (2007)"},{"key":"4749_CR10","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: Fast multiplication in finite fields $$\\mathbb{G}\\mathbb{F} (2^n)$$. In: International Workshop on Cryptographic Hardware & Embedded Systems (1999)","DOI":"10.1007\/3-540-48059-5_12"},{"key":"4749_CR11","doi-asserted-by":"crossref","unstructured":"Amento, B., Rtteler, M., Steinwandt, R.: Quantum binary field inversion: improved circuit depth via choice of basis representation. Rinton Press, Incorporated (1) (2013)","DOI":"10.26421\/QIC13.1-2-7"},{"key":"4749_CR12","doi-asserted-by":"crossref","unstructured":"Kepley, S., Steinwandt, R.: Quantum circuits for $$\\mathbb{F}_{2^n}$$ multiplication with subquadratic gate count. Quantum Information Processing (2015)","DOI":"10.1007\/s11128-015-0993-1"},{"issue":"9 &10","key":"4749_CR13","first-page":"721","volume":"20","author":"I Van Hoof","year":"2020","unstructured":"Van Hoof, I.: Space-efficient quantum multiplication polynomials for binary finite fields with sub-quadratoc toffoli gate count. Quantum Inf. Comput. 20(9 &10), 721\u2013735 (2020)","journal-title":"Quantum Inf. Comput."},{"key":"4749_CR14","doi-asserted-by":"publisher","first-page":"21848","DOI":"10.1109\/ACCESS.2023.3252504","volume":"11","author":"D Putranto","year":"2023","unstructured":"Putranto, D., Wardhani, R.W., Larasati, H.T., Kim, H.: Space and time-efficient quantum multiplier in post quantum cryptography era. IEEE Access 11, 21848\u201321862 (2023)","journal-title":"IEEE Access"},{"issue":"10","key":"4749_CR15","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.: Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication. Quantum Inf. Process. 23(10), 330 (2024). https:\/\/doi.org\/10.1007\/s11128-024-04536-1","journal-title":"Quantum Inf. Process."},{"issue":"5","key":"4749_CR16","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TC.2007.1024","volume":"56","author":"H Fan","year":"2007","unstructured":"Fan, H., Hasan, M.A.: Comments on \u201cfive, six, and seven-term karatsuba-like formulae\u2019\u2019. IEEE Trans. Comput. 56(5), 716\u2013717 (2007). https:\/\/doi.org\/10.1109\/TC.2007.1024","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"4749_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0885-064X(88)90012-X","volume":"4","author":"DV Chudnovsky","year":"1988","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Algebraic complexities and algebraic curves over finite fields. J. Complexity 4(4), 285\u2013316 (1988)","journal-title":"J. Complexity"},{"key":"4749_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01810851","volume":"2","author":"U Baum","year":"1991","unstructured":"Baum, U., Shokrollahi, M.A.: An optimal algorithm for multiplication in $$\\mathbb{F} _{256}\/\\mathbb{F} _4$$. Appl. Algebra Eng., Commun. Comput. 2, 15\u201320 (1991)","journal-title":"Appl. Algebra Eng., Commun. Comput."},{"issue":"6","key":"4749_CR19","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/0221071","volume":"21","author":"MA Shokrollahi","year":"1992","unstructured":"Shokrollahi, M.A.: Optimal algorithms for multiplication in certain finite fields using elliptic curves. SIAM J. Comput. 21(6), 1193\u20131198 (1992)","journal-title":"SIAM J. Comput."},{"key":"4749_CR20","doi-asserted-by":"crossref","unstructured":"Stichtenoth, H.: Algebraic function fields and codes 254 (2009)","DOI":"10.1007\/978-3-540-76878-4"},{"issue":"2","key":"4749_CR21","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.jco.2009.11.002","volume":"26","author":"M Cenk","year":"2010","unstructured":"Cenk, M., Oezbudak, F.: On multiplication in finite fields. J. Complexity 26(2), 172\u2013186 (2010)","journal-title":"J. Complexity"},{"key":"4749_CR22","doi-asserted-by":"crossref","unstructured":"Pieltant, J., Randriam, H.: New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields. Math, Comp (2015)","DOI":"10.1090\/S0025-5718-2015-02921-4"},{"issue":"01","key":"4749_CR23","doi-asserted-by":"publisher","first-page":"1650005","DOI":"10.1142\/S0219498816500055","volume":"15","author":"S Ballet","year":"2016","unstructured":"Ballet, S., Bonnecaze, A., Tukumuli, M.: On the construction of elliptic chudnovsky-type algorithms for multiplication in large extensions of finite fields. J. Algebra Appl. 15(01), 1650005 (2016)","journal-title":"J. Algebra Appl."},{"issue":"1","key":"4749_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1070\/RM9928","volume":"76","author":"S Ballet","year":"2021","unstructured":"Ballet, S., Pieltant, J., Rambaud, M., Randriambololona, H., Rolland, R., Chaumine, J.: On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry. Russian Math. Surv. 76(1), 29\u201389 (2021)","journal-title":"Russian Math. Surv."},{"issue":"1","key":"4749_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11128-020-02935-8","volume":"20","author":"JL Imaa","year":"2021","unstructured":"Imaa, J.L.: Optimized reversible quantum circuits for $$\\mathbb{F} _{2^8}$$ multiplication. Quantum Inf. Process. 20(1), 1\u201315 (2021)","journal-title":"Quantum Inf. Process."},{"key":"4749_CR26","doi-asserted-by":"publisher","first-page":"45083","DOI":"10.1109\/ACCESS.2023.3273601","volume":"11","author":"DSC Putranto","year":"2023","unstructured":"Putranto, D.S.C., Wardhani, R.W., Larasati, H.T., Ji, J., Kim, H.: Depth-optimization of quantum cryptanalysis on binary elliptic curves. IEEE Access 11, 45083\u201345097 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3273601","journal-title":"IEEE Access"},{"issue":"6","key":"4749_CR27","doi-asserted-by":"publisher","first-page":"3156","DOI":"10.3390\/s23063156","volume":"23","author":"K Jang","year":"2023","unstructured":"Jang, K., Kim, W., Lim, S., Kang, Y., Yang, Y., Seo, H.: Quantum binary field multiplication with optimized toffoli depth and extension to quantum inversion. Sensors 23(6), 3156 (2023)","journal-title":"Sensors"},{"issue":"1","key":"4749_CR28","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s11128-022-03799-w","volume":"22","author":"Q-B Luo","year":"2023","unstructured":"Luo, Q.-B., Li, X.-Y., Yang, G.-W., Li, Q.: Quantum reversible circuits for $$\\mathbb{G}\\mathbb{F} (2^8)$$ multiplication based on composite field arithmetic operations. Quantum Inf. Process. 22(1), 58 (2023). https:\/\/doi.org\/10.1007\/s11128-022-03799-w","journal-title":"Quantum Inf. Process."},{"key":"4749_CR29","doi-asserted-by":"crossref","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing grover oracles for quantum key search on aes and lowmc. In: Advances in Cryptology\u2013EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part II 30, pp. 280\u2013310 (2020). Springer","DOI":"10.1007\/978-3-030-45724-2_10"},{"issue":"9","key":"4749_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s11433-022-1921-y","volume":"65","author":"Z Li","year":"2022","unstructured":"Li, Z., Cai, B., Sun, H., Liu, H., Wan, L., Qin, S., Wen, Q., Gao, F.: Novel quantum circuit implementation of advanced encryption standard with low costs. Sci. China Phys., Mech. Astron. 65(9), 290311 (2022)","journal-title":"Sci. China Phys., Mech. Astron."},{"key":"4749_CR31","doi-asserted-by":"crossref","unstructured":"Liu, Q., Preneel, B., Zhao, Z., Wang, M.: Improved quantum circuits for aes: Reducing the depth and the number of qubits. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 67\u201398 (2023). Springer","DOI":"10.1007\/978-981-99-8727-6_3"},{"key":"4749_CR32","doi-asserted-by":"crossref","unstructured":"Luo, Q.-B., Ding, L., Yang, G.-W., Li, X.-Y.: Analysis of converting $$\\mathfrak{C}^0$$-circuit into $$\\mathfrak{C}^*$$-circuit. EPJ Quantum Technology 12(1) (2025)","DOI":"10.1140\/epjqt\/s40507-025-00317-6"},{"key":"4749_CR33","unstructured":"Karatsuba, A.A., Ofman, Y.P.: Multiplication of many-digital numbers by automatic computers. In: Doklady Akademii Nauk, vol. 145, pp. 293\u2013294 (1962). Russian Academy of Sciences"},{"issue":"3","key":"4749_CR34","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"PL Montgomery","year":"2005","unstructured":"Montgomery, P.L.: Five, six, and seven-term karatsuba-like formulae. IEEE Trans. Comput. 54(3), 362\u2013369 (2005)","journal-title":"IEEE Trans. Comput."},{"key":"4749_CR35","doi-asserted-by":"crossref","unstructured":"Xiang, Z., Zeng, X., Lin, D., Bao, Z., Zhang, S.: Optimizing Implementations of Linear Layers. Universitatsbibliothek der Ruhr-Universitat Bochum (2020)","DOI":"10.46586\/tosc.v2020.i2.120-145"},{"key":"4749_CR36","unstructured":"Rijmen, V.: Efficient implementation of the rijndael s-box. Katholieke Universiteit Leuven, Dept. ESAT. Belgium (2000)"},{"key":"4749_CR37","doi-asserted-by":"publisher","unstructured":"Kelly, M., Kaminsky, A., Kurdziel, M., \u0141ukowiak, M., Radziszowski, S.: Customizable sponge-based authenticated encryption using 16-bit S-boxes. In: MILCOM 2015 - 2015 IEEE Military Communications Conference, pp. 43\u201348 (2015). https:\/\/doi.org\/10.1109\/MILCOM.2015.7357416","DOI":"10.1109\/MILCOM.2015.7357416"},{"issue":"2\u20133","key":"4749_CR38","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-4049(01)00137-2","volume":"171","author":"S Ballet","year":"2002","unstructured":"Ballet, S.: Quasi-optimal algorithms for multiplication in the extensions of $$\\mathbb{F} _{16}$$ of degree 13, 14 and 15. J. Pure Appl. Algebra 171(2\u20133), 149\u2013164 (2002)","journal-title":"J. Pure Appl. Algebra"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04749-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04749-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04749-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T16:39:49Z","timestamp":1748882389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04749-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,15]]},"references-count":38,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["4749"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04749-y","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,5,15]]},"assertion":[{"value":"21 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 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"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and consent to participate"}}],"article-number":"138"}}