{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:58:18Z","timestamp":1764997098606},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319494449"},{"type":"electronic","value":"9783319494456"}],"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-49445-6_17","type":"book-chapter","created":{"date-parts":[[2016,11,17]],"date-time":"2016-11-17T07:50:31Z","timestamp":1479369031000},"page":"303-322","source":"Crossref","is-referenced-by-count":17,"title":["Solving Binary $$\\mathcal {MQ}$$ with Grover\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Peter","family":"Schwabe","sequence":"first","affiliation":[]},{"given":"Bas","family":"Westerbaan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,18]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., Schanck, J.: Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. Preprint 2016. https:\/\/arxiv.org\/abs\/1603.09383","DOI":"10.1007\/978-3-319-69453-5_18"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-662-43414-7_11","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"C Bouillaguet","year":"2014","unstructured":"Bouillaguet, C., Cheng, C.-M., Chou, T., Niederhagen, R., Yang, B.-Y.: Fast exhaustive search for quadratic systems in $$\\mathbb{F}_{2}$$ on FPGAs. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 205\u2013222. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-43414-7_11"},{"key":"17_CR3","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\u00d8yer, 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). doi: 10.1007\/BFb0055105"},{"key":"17_CR4","unstructured":"Chuang, I.: Quantum circuit viewer: qasm2circ (2005). http:\/\/www.media.mit.edu\/quanta\/qasm2circ\/ . Accessed 24 June 2016"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11496137_12","volume-title":"Applied Cryptography and Network Security","author":"J Ding","year":"2005","unstructured":"Ding, J., Schmidt, D.: Rainbow, a new multivariable polynomial signature scheme. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 164\u2013175. Springer, Heidelberg (2005). doi: 10.1007\/11496137_12"},{"key":"17_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-38986-3_10","volume-title":"Reversible Computation","author":"AS Green","year":"2013","unstructured":"Green, A.S., Lumsdaine, P.L.F., Ross, N.J., Selinger, P., Valiron, B.: An introduction to quantum programming in quipper. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 110\u2013124. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38986-3_10"},{"key":"17_CR8","unstructured":"Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. 48(6), 333\u2013342 (2013). https:\/\/arxiv.org\/pdf\/1304.3390"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-29360-8_3","volume-title":"Post-Quantum Cryptography","author":"M Grassl","year":"2016","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., Steinwandt, R.: Applying grover\u2019s algorithm to AES: quantum resource estimates. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 29\u201343. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-29360-8_3"},{"key":"17_CR10","doi-asserted-by":"crossref","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, pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-48910-X_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 99","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 206\u2013222. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48910-X_15"},{"issue":"25","key":"17_CR12","doi-asserted-by":"crossref","first-page":"1790","DOI":"10.1049\/el:20031202","volume":"39","author":"D Maslov","year":"2003","unstructured":"Maslov, D., Dueck, G.W.: Improved quantum cost for n-bit Toffoli gates. Electron. Lett. 39(25), 1790\u20131791 (2003)","journal-title":"Electron. Lett."},{"key":"17_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-45353-9_21","volume-title":"Topics in Cryptology \u2014 CT-RSA 2001","author":"J Patarin","year":"2001","unstructured":"Patarin, J., Courtois, N., Goubin, L.: QUARTZ, 128-bit long digital signatures. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 282\u2013297. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45353-9_21"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-48797-6_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Petzoldt","year":"2015","unstructured":"Petzoldt, A., Chen, M.-S., Yang, B.-Y., Tao, C., Ding, J.: Design principles for HFEv- based multivariate signature schemes. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 311\u2013334. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48797-6_14"},{"key":"17_CR16","unstructured":"Selinger, P.: The quipper language. http:\/\/www.mathstat.dal.ca\/~selinger\/quipper\/ . Accessed 09 Jan 2016"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In SFCS 1994 Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994). http:\/\/www-math.mit.edu\/~shor\/papers\/algsfqc-dlf.pdf","DOI":"10.1109\/SFCS.1994.365700"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484\u20131509 (1997). http:\/\/arxiv.org\/abs\/quant-ph\/9508027","DOI":"10.1137\/S0097539795293172"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/978-3-642-22792-9_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"K Sakumoto","year":"2011","unstructured":"Sakumoto, K., Shirai, T., Hiwatari, H.: Public-key identification schemes based on multivariate quadratic polynomials. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 706\u2013723. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22792-9_40"},{"key":"17_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10003-2_104","volume-title":"Reversible Computing","author":"T Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible Computing. Springer, Heidelberg (1980)"},{"issue":"79","key":"17_CR21","first-page":"368","volume":"16","author":"EJ Watson","year":"1962","unstructured":"Watson, E.J.: Primitive polynomials (mod 2). Math. Comput. 16(79), 368\u2013369 (1962)","journal-title":"Math. Comput."},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-30191-2_31","volume-title":"Information and Communications Security","author":"B-Y Yang","year":"2004","unstructured":"Yang, B.-Y., Chen, J.-M., Courtois, N.T.: On asymptotic security estimates in XL and Gr\u00f6bner bases-related algebraic cryptanalysis. In: Lopez, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 401\u2013413. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30191-2_31"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Applied Cryptography Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49445-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T14:12:55Z","timestamp":1568556775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49445-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319494449","9783319494456"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49445-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}