{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:03:53Z","timestamp":1769580233999,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T00:00:00Z","timestamp":1526342400000},"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":[[2018,7]]},"DOI":"10.1007\/s11128-018-1923-9","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T10:28:41Z","timestamp":1526380121000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Constructing quantum Hash functions based on quantum walks on Johnson graphs"],"prefix":"10.1007","volume":"17","author":[{"given":"Wei-Feng","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong-Ce","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Guang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Hua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Min","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,15]]},"reference":[{"key":"1923_CR1","volume-title":"The Art of Computer Programming, Sorting and Searching","author":"D Knuth","year":"1998","unstructured":"Knuth, D.: The Art of Computer Programming, Sorting and Searching, vol. 3, 2nd edn. Addison-Wesley, Boston (1998)","edition":"2"},{"key":"1923_CR2","doi-asserted-by":"publisher","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett. 87, 167902 (2001)","journal-title":"Phys. Rev. Lett."},{"key":"1923_CR3","unstructured":"D. Gavinsky, T. Ito: Quantum fingerprints that keep secrets. Technical Report Cornell University Library. arXiv:1010.5342 (2010)"},{"issue":"2","key":"1923_CR4","doi-asserted-by":"publisher","first-page":"025202","DOI":"10.1088\/1612-2011\/11\/2\/025202","volume":"11","author":"F Ablayev","year":"2014","unstructured":"Ablayev, F., Vasiliev, A.: Cryptographic quantum hashing. Laser Phys. Lett. 11(2), 025202 (2014)","journal-title":"Laser Phys. Lett."},{"key":"1923_CR5","first-page":"012019","volume":"681","author":"F Ablayev","year":"2016","unstructured":"Ablayev, F., Ablayev, M., Vasiliev, A.: On the balanced quantum hashing. J. Phys: Conf. Ser. 681, 012019 (2016)","journal-title":"J. Phys: Conf. Ser."},{"key":"1923_CR6","doi-asserted-by":"crossref","unstructured":"M. Ziatdinov: From graphs to keyed quantum hash functions. arXiv:1606.00256v1 (2016)","DOI":"10.1134\/S1995080216060202"},{"key":"1923_CR7","doi-asserted-by":"crossref","unstructured":"D. Aharonov, A. Ambainis, J. Kempe, et al.: Quantum walks on graphs. In: Proceedings of the 33rd ACM Symposium on Theory of Computing, pp. 50\u201359 (2001)","DOI":"10.1145\/380752.380758"},{"issue":"1","key":"1923_CR8","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539705447311","volume":"37","author":"A Ambainis","year":"2007","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210\u2013239 (2007)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1923_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/050643684","volume":"37","author":"F Magniez","year":"2007","unstructured":"Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37(2), 413\u2013424 (2007)","journal-title":"SIAM J. Comput."},{"issue":"32","key":"1923_CR10","doi-asserted-by":"publisher","first-page":"325302","DOI":"10.1088\/1751-8113\/47\/32\/325302","volume":"47","author":"D Tamascelli","year":"2014","unstructured":"Tamascelli, D., Zanetti, L.: A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems. J. Phys. A: Math. Theor. 47(32), 325302 (2014)","journal-title":"J. Phys. A: Math. Theor."},{"issue":"3","key":"1923_CR11","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1007\/s11128-012-0421-8","volume":"12","author":"D Li","year":"2013","unstructured":"Li, D., Zhang, J., Guo, F.-Z., Huang, W., Wen, Q.-Y., Chen, H.: Discrete-time interacting quantum walks and quantum Hash schemes. Quantum Inf. Process. 12(3), 1501\u20131513 (2013)","journal-title":"Quantum Inf. Process."},{"issue":"6","key":"1923_CR12","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1007\/s11128-012-0516-2","volume":"12","author":"D Li","year":"2013","unstructured":"Li, D., Zhang, J., Ma, X.W., Zhang, W.W., Wen, Q.Y.: Analysis of the two-particle controlled interacting quantum walks. Quantum Inf. Process. 12(6), 2167\u20132176 (2013)","journal-title":"Quantum Inf. Process."},{"key":"1923_CR13","doi-asserted-by":"publisher","first-page":"19788","DOI":"10.1038\/srep19788","volume":"6","author":"Y-G Yang","year":"2016","unstructured":"Yang, Y.-G., Xu, P., Yang, R., Zhou, Y.H., Shi, W.M.: Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption. Sci. Rep. 6, 19788 (2016)","journal-title":"Sci. Rep."},{"key":"1923_CR14","doi-asserted-by":"publisher","first-page":"022307","DOI":"10.1103\/PhysRevA.85.022307","volume":"85","author":"P Xue","year":"2012","unstructured":"Xue, P., Sanders, B.C.: Two quantum walkers sharing coins. Phys. Rev. A 85, 022307 (2012)","journal-title":"Phys. Rev. A"},{"key":"1923_CR15","doi-asserted-by":"publisher","first-page":"052307","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N Shenvi","year":"2003","unstructured":"Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random-walk search algorithm. Phys. Rev. A 67, 052307 (2003)","journal-title":"Phys. Rev. A"},{"key":"1923_CR16","doi-asserted-by":"publisher","first-page":"033029","DOI":"10.1088\/1367-2630\/13\/3\/033029","volume":"13","author":"M Stefa\u0148\u00e1k","year":"2011","unstructured":"Stefa\u0148\u00e1k, M., Barnett, S.M., Koll\u00e1r, B., Kiss, T., Jex, I.: Directional correlations in quantum walks with two particles. New J. Phys. 13, 033029 (2011)","journal-title":"New J. Phys."},{"key":"1923_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1038\/s41598-017-18566-6","volume":"8","author":"D Li","year":"2018","unstructured":"Li, D., Yang, Y.-G., Bi, J.-L., Yuan, J.-B., Xu, J.: Controlled alternate quantum walks based quantum Hash function. Sci. Rep. 8, 225 (2018)","journal-title":"Sci. Rep."},{"issue":"3","key":"1923_CR18","doi-asserted-by":"publisher","first-page":"030312","DOI":"10.1007\/s11433-017-9132-y","volume":"61","author":"Y-G Yang","year":"2018","unstructured":"Yang, Y.-G., Zhang, Y.-C., Xu, G., Chen, X.-B., Zhou, Y.-H., Shi, W.-M.: Improving the efficiency of quantum Hash function by dense coding of coin operators in discrete-time quantum walk. Sci. China-Phys. Mech. Astron. 61(3), 030312 (2018)","journal-title":"Sci. China-Phys. Mech. Astron."},{"key":"1923_CR19","unstructured":"S. Aaronson: G. Phi. Fo. Fum. http:\/\/scottaaronson.com\/blog\/?p=2521 . Accessed 13 May 2018"},{"key":"1923_CR20","doi-asserted-by":"crossref","unstructured":"J.A. Kun: Quasi-polynomial time algorithm for graph isomorphism: the details. http:\/\/jeremykun.com\/2015\/11\/12\/a-quasipolynomial-time-algorithm-for-graph-isomorphism-the-details\/ . Accessed 13 May 2018","DOI":"10.59350\/vre69-edk82"},{"key":"1923_CR21","unstructured":"L. Babai: Graph isomorphism in quasi-polynomial time. arXiv:1512.03547"},{"key":"1923_CR22","unstructured":"M. Bellare, T. Kohno: Hash function balance and its impact on birthday attacks. In: Eurocrypt 04, LNCS, vol. 3027, pp. 401\u2013418 (2004)"},{"key":"1923_CR23","unstructured":"M.J. Saarinen: A meeting-in-the-middle collision attack against the new FORK-256. In: Indocrypt 2007, LNCS, vol. 4859, pp. 10\u201317 (2007)"},{"issue":"4","key":"1923_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s001459900047","volume":"11","author":"H Dobbertin","year":"1998","unstructured":"Dobbertin, H.: Cryptanalysis of MD4. J. Cryptol. 11(4), 253\u2013271 (1998)","journal-title":"J. Cryptol."},{"key":"1923_CR25","unstructured":"F. Chabaud, A. Joux: Differential collisions in SHA-0. In: Crypto\u201998, LNCS, vol. 1462, pp. 56\u201371 (1998)"},{"key":"1923_CR26","doi-asserted-by":"crossref","unstructured":"Y. Sasaki, K. Aoki: Finding preimages in full MD5 faster than exhaustive search. In: Eurocrypt 2009, LNCS, vol. 5479, pp 134\u2013152 (2009)","DOI":"10.1007\/978-3-642-01001-9_8"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-018-1923-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1923-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1923-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T14:55:58Z","timestamp":1751640958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-018-1923-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,15]]},"references-count":26,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1923"],"URL":"https:\/\/doi.org\/10.1007\/s11128-018-1923-9","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,15]]},"assertion":[{"value":"11 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"156"}}