{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T19:55:58Z","timestamp":1780084558445,"version":"3.54.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Institute for Information & communications Technology Planning & Evaluation","award":["No.2019-0-00033"],"award-info":[{"award-number":["No.2019-0-00033"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-024-04536-1","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T09:01:53Z","timestamp":1727686913000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication"],"prefix":"10.1007","volume":"23","author":[{"given":"Sunyeop","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Insung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seonggyeom","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7506-4023","authenticated-orcid":false,"given":"Seokhie","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,30]]},"reference":[{"key":"4536_CR1","unstructured":"Amento, B., R\u00f6tteler, M., Steinwandt, R.: Quantum binary field inversion: improved circuit depth via choice of basis representation. Preprint at arXiv arXiv:1209.5491 (2012)"},{"issue":"7","key":"4536_CR2","first-page":"610","volume":"9","author":"D Maslov","year":"2009","unstructured":"Maslov, D., Mathew, J., Cheung, D., Pradhan, D.K.: An $${O}(m^{2})$$-depth quantum algorithm for the elliptic curve discrete logarithm problem over $$\\textbf{GF} (2^{m})$$ a. Quantum Inf. Comput. 9(7), 610\u2013621 (2009)","journal-title":"Quantum Inf. Comput."},{"issue":"7","key":"4536_CR3","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1007\/s11128-015-0993-1","volume":"14","author":"S Kepley","year":"2015","unstructured":"Kepley, S., Steinwandt, R.: Quantum circuits for $$f_{2^{n}}$$-multiplication with subquadratic gate count. Quantum Inf. Process. 14(7), 2373\u20132386 (2015)","journal-title":"Quantum Inf. Process."},{"issue":"9 &10","key":"4536_CR4","first-page":"721","volume":"20","author":"I Hoof","year":"2020","unstructured":"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":"4536_CR5","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)","journal-title":"IEEE Access"},{"key":"4536_CR6","doi-asserted-by":"crossref","unstructured":"Jang, K., Kim, W., Lim, S., Kang, Y., Yang, Y., Seo, H.: Optimized implementation of quantum binary field multiplication with toffoli depth one. In: International Conference on Information Security Applications, pp. 284\u2013297. Springer (2022)","DOI":"10.1007\/978-3-031-25659-2_18"},{"issue":"3","key":"4536_CR7","first-page":"362","volume":"54","author":"A Weimerskirch","year":"2003","unstructured":"Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba algorithm for efficient implementations. IEEE Trans. Comput. 54(3), 362\u2013369 (2003)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"4536_CR8","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."},{"issue":"4","key":"4536_CR9","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TC.2018.2874662","volume":"68","author":"MG Find","year":"2018","unstructured":"Find, M.G., Peralta, R.: Better circuits for binary polynomial multiplication. IEEE Trans. Comput. 68(4), 624\u2013630 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"4536_CR10","doi-asserted-by":"crossref","unstructured":"\u00c7al\u0131k, \u00c7., Dworkin, M., Dykas, N., Peralta, R.: Searching for best karatsuba recurrences. In: International Symposium on Experimental Algorithms, pp. 332\u2013342. Springer (2019)","DOI":"10.1007\/978-3-030-34029-2_22"},{"issue":"5","key":"4536_CR11","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\u2019\u2019 five, six, and seven-term Karatsuba-like formulae. IEEE Trans. Comput. 56(5), 716\u2013717 (2007)","journal-title":"IEEE Trans. Comput."},{"key":"4536_CR12","doi-asserted-by":"crossref","unstructured":"Banegas, G., Bernstein, D.J., Van\u00a0Hoof, I., Lange, T.: Concrete quantum cryptanalysis of binary elliptic curves. Cryptology ePrint Archive (2020)","DOI":"10.46586\/tches.v2021.i1.451-472"},{"key":"4536_CR13","unstructured":"Cross, A.: The IBM Q experience and QISKit open-source quantum computing software. In: APS March Meeting Abstracts, vol. 2018, pp. 58\u2013003 (2018)"},{"issue":"6","key":"4536_CR14","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4536_CR15","unstructured":"Karatsuba, A.A., Ofman, Y.P.: Multiplication of many-digital numbers by automatic computers. In: Doklady Akademii Nauk, vol. 145, pp. 293\u2013294. Russian Academy of Sciences (1962)"},{"key":"4536_CR16","doi-asserted-by":"crossref","unstructured":"Boyar, J., Matthews, P., Peralta, R.: On the shortest linear straight-line program for computing linear forms. In: International Symposium on Mathematical Foundations of Computer Science, pp. 168\u2013179. Springer (2008)","DOI":"10.1007\/978-3-540-85238-4_13"},{"key":"4536_CR17","first-page":"309","volume":"11","author":"C Moreau","year":"1872","unstructured":"Moreau, C.: Sur les permutations circulaires distinctes. Nouvelles annales de math\u00e9matiques: journal des candidats aux \u00e9coles polytechnique et normale 11, 309\u2013314 (1872)","journal-title":"Nouvelles annales de math\u00e9matiques: journal des candidats aux \u00e9coles polytechnique et normale"},{"issue":"2","key":"4536_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0001-8708(83)90035-X","volume":"50","author":"N Metropolis","year":"1983","unstructured":"Metropolis, N., Rota, G.-C.: Witt vectors and the algebra of necklaces. Adv. Math. 50(2), 95\u2013125 (1983)","journal-title":"Adv. Math."},{"key":"4536_CR19","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034981","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H Cohen","year":"2005","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press (2005)"},{"key":"4536_CR20","unstructured":"Kerry, C.F., Gallagher, P.D.: Digital signature standard (dss). FIPS PUB, 186\u20134 (2013)"},{"issue":"4","key":"4536_CR21","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s13389-018-0197-6","volume":"9","author":"G Banegas","year":"2019","unstructured":"Banegas, G., Cust\u00f3dio, R., Panario, D.: A new class of irreducible pentanomials for polynomial-based multipliers in binary fields. J. Cryptogr. Eng. 9(4), 359\u2013373 (2019)","journal-title":"J. Cryptogr. Eng."},{"key":"4536_CR22","unstructured":"Seroussi, G.: Table of low-weight binary irreducible polynomials. Citeseer (1998)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04536-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04536-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04536-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T10:13:43Z","timestamp":1730542423000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04536-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,30]]},"references-count":22,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["4536"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04536-1","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,30]]},"assertion":[{"value":"7 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"330"}}