{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T14:18:56Z","timestamp":1781705936112,"version":"3.54.5"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T00:00:00Z","timestamp":1431388800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s11128-015-0993-1","type":"journal-article","created":{"date-parts":[[2015,5,11]],"date-time":"2015-05-11T09:45:45Z","timestamp":1431337545000},"page":"2373-2386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Quantum circuits for $${\\mathbb {F}}_{2^{n}}$$ F 2 n -multiplication with subquadratic gate count"],"prefix":"10.1007","volume":"14","author":[{"given":"Shane","family":"Kepley","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rainer","family":"Steinwandt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,5,12]]},"reference":[{"key":"993_CR1","first-page":"631","volume":"13","author":"B Amento","year":"2013","unstructured":"Amento, B., R\u00f6tteler, M., Steinwandt, R.: Efficient quantum circuits for binary elliptic curve arithmetic: reducing $$T$$ T -gate complexity. Quantum. Inf. Comput. 13, 631\u2013644 (2013)","journal-title":"Quantum. Inf. Comput."},{"key":"993_CR2","first-page":"116","volume":"13","author":"B Amento","year":"2013","unstructured":"Amento, B., R\u00f6tteler, M., Steinwandt, R.: Quantum binary field inversion: improved circuit depth via choice of basis representation. Quantum. Inf. Comput. 13, 116\u2013134 (2013)","journal-title":"Quantum. Inf. Comput."},{"issue":"6","key":"993_CR3","doi-asserted-by":"crossref","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. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on 32(6), 818\u2013830 (2013). For a preprint version see [4]","journal-title":"Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on"},{"key":"993_CR4","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits arXiv:quant-ph\/1206.0758v3 , (January 2013). Available at http:\/\/arxiv.org\/abs\/1206.0758v3"},{"key":"993_CR5","unstructured":"Budhathoki, P., Steinwandt, R.: Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves. Quantum Information Processing, (accepted, to appear). Preprint http:\/\/lanl.arxiv.org\/abs\/1401.2437v1"},{"key":"993_CR6","unstructured":"Burns, M.: QCViewer. GitHub repository, June 2013. Available at https:\/\/github.com\/aparent\/QCViewer"},{"issue":"1","key":"993_CR7","doi-asserted-by":"crossref","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. Mod. Phys. 82(1), 1\u201352 (2010)","journal-title":"Rev. Mod. Phys."},{"issue":"2","key":"993_CR8","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1049\/iet-ifs.2007.0132","volume":"3","author":"H Fan","year":"2009","unstructured":"Fan, H., Hasan, A.: Alternative to the Karatsuba algorithm for software implementations of $$GF(2^n)$$ G F ( 2 n ) multiplications. IET Inf. Secur. 3(2), 60\u201365 (2009)","journal-title":"IET Inf. Secur."},{"issue":"240","key":"993_CR9","doi-asserted-by":"crossref","first-page":"1677","DOI":"10.1090\/S0025-5718-02-01421-7","volume":"71","author":"J Gathen von zur","year":"2002","unstructured":"von zur Gathen, J., Gerhard, J.: Polynomial factorization over $${\\mathbb{F}}_{2}$$ F 2 . Math. Comput. 71(240), 1677\u20131698 (2002)","journal-title":"Math. Comput."},{"key":"993_CR10","unstructured":"Karatsuba, A.A.: The complexity of computations. In: Proceedings of the Steklov Institute of Mathematics, 211:169\u2013183, 1995. Available at http:\/\/www.ccas.ru\/personal\/karatsuba\/divcen.pdf . Translated from Trudy Matematicheskogo Instituta imeni V.A. Steklova, Vol. 211, (1995) pp. 186\u2013202"},{"issue":"5","key":"993_CR11","first-page":"499","volume":"12","author":"LAB Kowada","year":"2006","unstructured":"Kowada, L.A.B., Portugal, R., de Figueiredo, C.H.M.: Reversible Karatsuba\u2019s algorithm. J. Univ. Comput. Sci. 12(5), 499\u2013511 (2006)","journal-title":"J. Univ. Comput. Sci."},{"key":"993_CR12","unstructured":"Maslov, D.: Reversible Logic Synthesis Benchmarks Page. http:\/\/webhome.cs.uvic.ca\/~dmaslov\/ , (2011)"},{"key":"993_CR13","doi-asserted-by":"crossref","unstructured":"Maslov, D., Falconer, S.M., Mosca, M.: Quantum circuit placement: optimizing qubit-to-qubit interactions through mapping quantum circuits into a physical experiment. In: Proceedings of the 44th Design Automation Conference\u2014DAC 2007, pp. 962\u2013965. ACM, (2007)","DOI":"10.1145\/1278480.1278717"},{"issue":"7","key":"993_CR14","first-page":"610","volume":"9","author":"D Maslov","year":"2009","unstructured":"Maslov, D., Mathew, J., Cheung, D., Pradhan, D.K.: An $$O(m^2)$$ O ( m 2 ) -depth quantum algorithm for the elliptic curve discrete logarithm problem over GF $$(2^m)$$ ( 2 m ) . Quantum Inf. Comput. 9(7), 610\u2013621 (2009). For a preprint version see [15]","journal-title":"Quantum Inf. Comput."},{"key":"993_CR15","unstructured":"Maslov, D., Mathew, J., Cheung, D., Pradhan, D.K.: On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography. arXiv:0710.1093v2 , (2009). Available at http:\/\/arxiv.org\/abs\/0710.1093v2"},{"key":"993_CR16","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, (2001). Sample chapters http:\/\/cacr.uwaterloo.ca\/hac\/"},{"key":"993_CR17","unstructured":"National Institute of Standards and Technology, Gaithersburg, MD 20899\u20138900. FIPS PUB 186\u20134. Federal Information Processing Standard Publication. Digital Signature Standard (DSS), (July 2013). Available at http:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"},{"key":"993_CR18","doi-asserted-by":"crossref","unstructured":"Offermann, S., Wille, R., Dueck, G.W., Drechsler, R.: Synthesizing multiplier in reversible logic. In: 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems\u2014DDECS 2010, pp. 335\u2013340. IEEE Computer Society, (2010)","DOI":"10.1109\/DDECS.2010.5491757"},{"key":"993_CR19","unstructured":"Parent, A.: Quantum Arithmetic Circuit Generator. GitHub Repository, (2012). Avalable at https:\/\/github.com\/aparent\/qacg"},{"key":"993_CR20","unstructured":"R\u00f6tteler, M., Steinwandt, R.: A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O $$(\\log ^2 n)$$ ( log 2 n ) . Quantum Inf. Comput. 14(9\u201310), 888\u2013900 (2014). http:\/\/dl.acm.org\/citation.cfm?id=2638681"},{"issue":"5","key":"993_CR21","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"Peter W Shor","year":"1997","unstructured":"Shor, Peter 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":"993_CR22","unstructured":"Stein, W.A. et al.: Sage Mathematics Software (Version 5.4). The Sage Development Team, (2012). http:\/\/www.sagemath.org"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-015-0993-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-015-0993-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-015-0993-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:39:21Z","timestamp":1559360361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-015-0993-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,12]]},"references-count":22,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["993"],"URL":"https:\/\/doi.org\/10.1007\/s11128-015-0993-1","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,12]]}}}