{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:11:54Z","timestamp":1649009514287},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,1,7]],"date-time":"2015-01-07T00:00:00Z","timestamp":1420588800000},"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,3]]},"DOI":"10.1007\/s11128-014-0909-5","type":"journal-article","created":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T09:48:56Z","timestamp":1420537736000},"page":"813-829","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantum algorithm to find invariant linear structure of MD hash functions"],"prefix":"10.1007","volume":"14","author":[{"given":"WanQing","family":"Wu","sequence":"first","affiliation":[]},{"given":"HuanGuo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"ShaoWu","family":"Mao","sequence":"additional","affiliation":[]},{"given":"HouZhen","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,7]]},"reference":[{"key":"909_CR1","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997)"},{"key":"909_CR2","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Quantum lower bound for the collision problem. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 635\u2013642. ACM, New York (2002)","DOI":"10.1145\/509998.509999"},{"key":"909_CR3","unstructured":"Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 513\u2013519. IEEE (2002)"},{"issue":"1","key":"909_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.4086\/toc.2005.v001a002","volume":"1","author":"S Kutin","year":"2005","unstructured":"Kutin, S.: Quantum lower bound for the collision problem with small range. Theory Comput. 1(1), 29\u201336 (2005)","journal-title":"Theory Comput."},{"issue":"1","key":"909_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.4086\/toc.2005.v001a003","volume":"1","author":"A Ambainis","year":"2005","unstructured":"Ambainis, A.: Polynomial degree and lower bounds in quantum complexity: collision and element distinctness with small range. Theory Comput. 1(1), 37\u201346 (2005)","journal-title":"Theory Comput."},{"key":"909_CR6","volume-title":"How to Break MD5 and Other Hash Functions. Advances in Cryptology-EUROCRYPT","author":"X Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. Advances in Cryptology-EUROCRYPT. Springer, Berlin (2005)"},{"key":"909_CR7","volume-title":"Finding Collisions in the Full SHA-1. Advances in Cryptology-CRYPTO","author":"X Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. Advances in Cryptology-CRYPTO. Springer, Berlin (2005)"},{"key":"909_CR8","volume-title":"Cryptanalysis of the Hash Functions MD4 and RIPEMD. Advances in Cryptology-EUROCRYPT","author":"X Wang","year":"2005","unstructured":"Wang, X., Lai, X., Feng, D., et al.: Cryptanalysis of the Hash Functions MD4 and RIPEMD. Advances in Cryptology-EUROCRYPT. Springer, Berlin (2005)"},{"key":"909_CR9","volume-title":"Efficient Collision Search Attacks on SHA-0. Advances in Cryptology-CRYPTO","author":"X Wang","year":"2005","unstructured":"Wang, X., Yu, H., Yin, Y.L.: Efficient Collision Search Attacks on SHA-0. Advances in Cryptology-CRYPTO, 1st edn. Springer, Berlin (2005)","edition":"1"},{"key":"909_CR10","doi-asserted-by":"crossref","unstructured":"Kashefi, E., Kent, A., Vedral, V., et al.: Comparison of quantum oracles. Phys. Rev. A 65(5), 050304 (2002)","DOI":"10.1103\/PhysRevA.65.050304"},{"issue":"1","key":"909_CR11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1103\/PhysRevA.54.147","volume":"54","author":"V Vedral","year":"1996","unstructured":"Vedral, V., Barenco, A., Ekert, A.: Quantum networks for elementary arithmetic operations. Phys. Rev. A 54(1), 147 (1996)","journal-title":"Phys. Rev. A"},{"key":"909_CR12","volume-title":"The MD4 Message-Digest Algorithm. Advances in Cryptology, Crypto\u201990","author":"RL Rivest","year":"1991","unstructured":"Rivest, R.L.: The MD4 Message-Digest Algorithm. Advances in Cryptology, Crypto\u201990. Springer, Berlin (1991)"},{"key":"909_CR13","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: The MD5 Message-Digest Algorithm, Request for Comments (RFC 1320), Internet Activities Board, Internet Privacy Task Force (1992)","DOI":"10.17487\/rfc1321"},{"key":"909_CR14","unstructured":"Secure Hash Standard. Federal Information Processing Standard Publication 180, U.S. Department of Commerce, National Institute of Standards and Technology (1993)"},{"key":"909_CR15","unstructured":"National Institute of Standards and Technology (NIST) FIPS Publication 180-1: secure Hash Standard (1994)"},{"key":"909_CR16","unstructured":"National Institute of Standards and Technology (NIST), FIPS 180\u20132(2002). http:\/\/csrc.nist.gov\/encryption\/tkhash.html"},{"key":"909_CR17","doi-asserted-by":"crossref","unstructured":"Cleve, R.: An introduction to quantum complexity theory. In: Collected Papers on Quantum Computation and Quantum Information Theory, pp. 103\u2013127 (2000)","DOI":"10.1142\/9789810248185_0004"},{"issue":"2","key":"909_CR18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"909_CR19","unstructured":"Proos, J., Zalka, C.: Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf. Comput. 3, 317\u2013344 (2003)"},{"key":"909_CR20","volume-title":"Guide to Elliptic Curve Cryptography","author":"H Darrel","year":"2004","unstructured":"Darrel, H., Alfrend, M., Scott, V.: Guide to Elliptic Curve Cryptography. Springer, Berlin (2004)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-014-0909-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-014-0909-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-014-0909-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T08:20:22Z","timestamp":1566202822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-014-0909-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,7]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["909"],"URL":"https:\/\/doi.org\/10.1007\/s11128-014-0909-5","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,7]]}}}