{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T15:05:52Z","timestamp":1761491152832,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021,1]]},"DOI":"10.1007\/s11128-020-02937-6","type":"journal-article","created":{"date-parts":[[2021,1,11]],"date-time":"2021-01-11T10:49:10Z","timestamp":1610362150000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimized reversible quantum circuits for $${\\mathbb {F}}_{2^8}$$ multiplication"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4220-4111","authenticated-orcid":false,"given":"Jos\u00e9 L.","family":"Ima\u00f1a","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"key":"2937_CR1","unstructured":"Federal Information Processing Standards Publication 197. Specification for the Advanced Encryption Standard (AES) (2001). https:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.197.pdf"},{"key":"2937_CR2","doi-asserted-by":"crossref","unstructured":"Abdessaied, N., Wille, R., Soeken, M., Drechsler, R.: Reducing the depth of quantum circuits using additional circuit lines. In: Intl. Conf. on Reversible Computation, vol. LNCS-7948, pp. 221\u2013233 (2013)","DOI":"10.1007\/978-3-642-38986-3_18"},{"key":"2937_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-1864-3","volume":"17","author":"M Almazrooie","year":"2018","unstructured":"Almazrooie, M., Samsudin, A., Abdullah, R., Mutter, K.: Quantum reversible circuit of aes-128. Quantum Inf. Process. 17, 1\u201330 (2018)","journal-title":"Quantum Inf. Process."},{"key":"2937_CR4","doi-asserted-by":"crossref","unstructured":"Boyar, J., Peralta, R.: A new combinational logic minimization technique with applications to cryptology. In: SEA 2010, vol. LNCS 6049, pp. 178\u2013189 (2010)","DOI":"10.1007\/978-3-642-13193-6_16"},{"key":"2937_CR5","doi-asserted-by":"crossref","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., Steinwandt, R.: Applying grover\u2019s algorithm to aes: Quantum resource estimates. In: PQCrypto, vol. LNCS-9606, pp. 29\u201343 (2016)","DOI":"10.1007\/978-3-319-29360-8_3"},{"key":"2937_CR6","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proc. 28th ACM Symp. Th. Computing, STOC, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"2937_CR7","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1109\/TCSII.2012.2222836","volume":"59","author":"JL Ima\u00f1a","year":"2012","unstructured":"Ima\u00f1a, J.L.: Efficient polynomial basis multipliers for type-ii irreducible pentanomials. IEEE Trans. Circuits Syst. II-Exp. Briefs 59, 795\u2013799 (2012)","journal-title":"IEEE Trans. Circuits Syst. II-Exp. Briefs"},{"key":"2937_CR8","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1109\/TVLSI.2006.887835","volume":"14","author":"JL Ima\u00f1a","year":"2006","unstructured":"Ima\u00f1a, J.L., Hermida, R., Tirado, F.: Low complexity bit-parallel multipliers based on a class of irreducible pentanomials. IEEE Trans. VLSI Syst. 14, 1388\u20131393 (2006)","journal-title":"IEEE Trans. VLSI Syst."},{"key":"2937_CR9","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/TC.2006.69","volume":"55","author":"JL Ima\u00f1a","year":"2006","unstructured":"Ima\u00f1a, J.L., S\u00e1nchez, J.M., Tirado, F.: Bit-parallel finite field multipliers for irreducible trinomials. IEEE Trans. Comput. 55, 520\u2013533 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"2937_CR10","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, 2373\u20132386 (2015)","journal-title":"Quantum Inf. Process."},{"key":"2937_CR11","unstructured":"Markov, I.L., Saeedi, M.: Constant-optimized quantum circuits for modular multiplication and exponentiation. arXiv:1202.6614v3 pp. 1\u201329 (2015)"},{"key":"2937_CR12","unstructured":"Maslov, D.: Reversible Logic Synthesis Benchmarks Page (2011). http:\/\/webhome.cs.uvic.ca\/--dmaslov\/. Accessed March 2020"},{"key":"2937_CR13","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 [quant-ph] (2009)"},{"key":"2937_CR14","unstructured":"Parent, A., Roetteler, M., Mosca, M.: Improved reversible and quantum circuits for karatsuba-based integer multiplication. arXiv:1706.03419v1 pp. 1\u201316 (2017)"},{"key":"2937_CR15","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TC.2004.47","volume":"53","author":"A Reyhani-Masoleh","year":"2004","unstructured":"Reyhani-Masoleh, A., Hasan, M.A.: Low complexity bit parallel architectures for polynomial basis multiplication over gf($$2^m$$). IEEE Trans. Comput. 53, 945\u2013959 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"2937_CR16","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1109\/TC.2003.1252850","volume":"52","author":"F Rodr\u00edguez-Henr\u00edquez","year":"2003","unstructured":"Rodr\u00edguez-Henr\u00edquez, F., Ko\u00e7, \u00c7.K.: Parallel multipliers based on special irreducible pentanomials. IEEE Trans. Comput. 52, 1535\u20131542 (2003)","journal-title":"IEEE Trans. Comput."},{"key":"2937_CR17","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithm and factoring. In: Proc. FOCS\u201994, pp. 124\u2013134 (1994)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02937-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-020-02937-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02937-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T08:41:46Z","timestamp":1612946506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-020-02937-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2937"],"URL":"https:\/\/doi.org\/10.1007\/s11128-020-02937-6","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"27 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"27"}}