{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T14:28:09Z","timestamp":1775312889500,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319293592","type":"print"},{"value":"9783319293608","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29360-8_3","type":"book-chapter","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T05:46:23Z","timestamp":1454478383000},"page":"29-43","source":"Crossref","is-referenced-by-count":219,"title":["Applying Grover\u2019s Algorithm to AES: Quantum Resource Estimates"],"prefix":"10.1007","author":[{"given":"Markus","family":"Grassl","sequence":"first","affiliation":[]},{"given":"Brandon","family":"Langenberg","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Roetteler","sequence":"additional","affiliation":[]},{"given":"Rainer","family":"Steinwandt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,4]]},"reference":[{"key":"3_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 \n                    \n                      \n                    \n                    $$T$$\n                  -gate complexity. Quantum Inf. Comput. 13, 631\u2013644 (2013)","journal-title":"Quantum Inf. Comput."},{"issue":"10","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","volume":"33","author":"M Amy","year":"2014","unstructured":"Amy, M., Maslov, D., Mosca, M.: Polynomial-time \n                    \n                      \n                    \n                    $$T$$\n                  -depth optimization of Clifford\n                    \n                      \n                    \n                    $$+T$$\n                   circuits via matroid partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10), 1476\u20131489 (2014). \n                    arXiv:1303.2042","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"6","key":"3_CR3","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). For a preprint version see [4]","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"3_CR4","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits (2013). \n                    arXiv:quant-ph\/1206.0758v3\n                    \n                  , \n                    arxiv.org\/abs\/1206.0758v3"},{"key":"3_CR5","unstructured":"Augot, D., Batina, L., Bernstein, D.J., Bos, J., Buchmann, J., Castryck, W., Dunkelmann, O., G\u00fcneysu, T., Gueron, S., H\u00fclsing, A., Lange, T., Mohamed, M.S.E., Rechberger, C., Schwabe, P., Sendrier, N., Vercauteren, F., Yang, B.-Y.: Initial recommendations of long-term secure post-quantum systems (2015). \n                    http:\/\/pqcrypto.eu.org\/docs\/initial-recommendations.pdf"},{"issue":"5","key":"3_CR6","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P.W., Sleator, T., Smolin, J., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457\u20133467 (1995)","journal-title":"Phys. Rev. A"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. the user language. J. Symbolic Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46, 493\u2013506 (1998). \n                    arxiv:quant-ph\/9605034","journal-title":"Fortschritte der Physik"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. AMS Contemp. Math. 305, 53\u201374 (2002). \n                    arxiv:quant-ph\/0005055","journal-title":"AMS Contemp. Math."},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/BFb0055105","volume-title":"Automata, Languages and Programming","author":"G Brassard","year":"1998","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum counting. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 820\u2013831. Springer, Heidelberg (1998)"},{"key":"3_CR11","first-page":"147","volume":"6","author":"E Dawson","year":"1992","unstructured":"Dawson, E., Gustafson, H., Pettitt, A.N.: Strict key avalanche criterion. Australas. J. Comb. 6, 147\u2013153 (1992)","journal-title":"Australas. J. Comb."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Egner, S., P\u00fcschel, M.: Solving puzzles related to permutations groups. In: Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC 1998), pp. 186\u2013193 (1998)","DOI":"10.1145\/281508.281611"},{"key":"3_CR13","unstructured":"Fowler, A.G., Mariantoni, M., Martinis, J.M., Cleland, A.N.: Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012). \n                    arXiv:1208.0928"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"052312","DOI":"10.1103\/PhysRevA.80.052312","volume":"80","author":"AG Fowler","year":"2009","unstructured":"Fowler, A.G., Stephens, A.M., Groszkowski, P.: High threshold universal quantum computation on the surface code. Phys. Rev. A 80, 052312 (2009)","journal-title":"Phys. Rev. A"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Miller, G.L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"022328","DOI":"10.1103\/PhysRevA.87.022328","volume":"87","author":"NC Jones","year":"2013","unstructured":"Jones, N.C.: Novel constructions for the fault-tolerant Toffoli gate. Phys. Rev. A 87, 022328 (2013)","journal-title":"Phys. Rev. A"},{"key":"3_CR17","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Quantum differential and linear cryptanalysis. \n                    arXiv:1510.05836"},{"issue":"7","key":"3_CR18","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 \n                    \n                      \n                    \n                    $${\\mathbb{F}}_{2^n}$$\n                   -multiplication with subquadratic gate count. Quantum Inf. Process. 14(7), 2373\u20132386 (2015)","journal-title":"Quantum Inf. Process."},{"key":"3_CR19","volume-title":"Crypt. A Primer","author":"AG Konheim","year":"1981","unstructured":"Konheim, A.G.: Crypt. A Primer. Wiley, Hoboken (1981)"},{"key":"3_CR20","unstructured":"Maslov, D.: On the advantages of using relative phase Toffolis with an application tomultiple control Toffoli optimization. \n                    arXiv:1508.03273"},{"key":"3_CR21","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 \u2013 DAC 2007, pp. 962\u2013965. ACM (2007)","DOI":"10.1109\/DAC.2007.375304"},{"key":"3_CR22","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 (2009). \n                    arXiv:0710.1093v2\n                    \n                  , \n                    arxiv.org\/abs\/0710.1093v2"},{"key":"3_CR23","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"3_CR24","unstructured":"NIST: Specification for the Advanced Encryption Standard (AES). Federal Information Processing Standards Publication 197 (2001)"},{"key":"3_CR25","first-page":"1030","volume":"9","author":"BW Reichardt","year":"2009","unstructured":"Reichardt, B.W.: Quantum universality by state distillation. Quantum Inf. Comput. 9, 1030\u20131052 (2009)","journal-title":"Quantum Inf. Comput."},{"issue":"1","key":"3_CR26","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ipl.2014.08.009","volume":"115","author":"M Roetteler","year":"2015","unstructured":"Roetteler, M., Steinwandt, R.: A note on quantum related-key attacks. Inf. Process. Lett. 115(1), 40\u201344 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"3_CR27","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":"3_CR28","doi-asserted-by":"crossref","unstructured":"Steane, A.M.: Overhead and noise threshold of fault-tolerant quantum error correction. Phys. Rev. A 68, 042322 (2003). \n                    arXiv:quant-ph\/0207119","DOI":"10.1103\/PhysRevA.68.042322"},{"key":"3_CR29","unstructured":"Wiebe, N., Roetteler, M.: Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits. \n                    arXiv:1406.2040"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"210501","DOI":"10.1103\/PhysRevLett.113.210501","volume":"113","author":"TJ Yoder","year":"2014","unstructured":"Yoder, T.J., Low, G.H., Chuang, I.L.: Fixed-point quantum search with an optimal number of queries. Phys. Rev. Lett. 113, 210501 (2014)","journal-title":"Phys. Rev. Lett."}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29360-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T08:47:02Z","timestamp":1559378822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29360-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319293592","9783319293608"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29360-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}