Abstract
Quantumhash functions are similar to classical (cryptographic) hash functions and their security is guaranteed by physical laws. However, security of a primitive does not automatically mean that protocols based on this primitive are secure. We propose protocols based on quantum hash function and assess their security using Holevo entropy and recently introduced notion of quantum information cost.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf, “Quantum fingerprinting,” Phys. Rev. Lett. 87, 167902 (2001).
D. Gavinsky and T. Ito, “Quantum fingerprints that keep secrets,” arXiv:1010.5342 (2010), pp. 1–28.
F. Ablayev and A. Vasiliev, “Cryptographic quantum hashing,” Laser Phys. Lett. 11, 025202 (2014).
M. Ziatdinov, “Quantum hashing. Group approach,” Lobachevskii J.Math. 37, 222–226 (2016).
A. Vasiliev, “Quantum hashing for finite Abelian groups,” Lobachevskii J.Math. 37, 751–754 (2016).
M. Ziatdinov, “From graphs to keyed quantum hash functions,” Lobachevskii J.Math. 37, 705–712 (2016).
F. Ablayev, M. Ablayev, A. Vasiliev, and M. Ziatdinov, “Quantum fingerprinting and quantum hashing. Computational and cryptographical aspects,” Baltic J. Mod. Comput. 4, 860–875 (2016).
D. Touchette, “Quantum information complexity,” in Proceedings of the 47th Annual ACM Symposium on Theory of Computing, STOC’15 (2015), pp. 317–326.
A. V. Nayak, Lower Bounds for Quantum Computation and Communication (Univ. California, Berkeley, CA, 1999).
D. Gottesman and I. L. Chuang, “Quantum digital signatures,” arXiv:quant-ph/0105032 (2001), pp. 1–8.
S. Chen, C. Moore, and A. Russell, “Small-bias sets for nonabelian groups,” Lect. Notes Comput. Sci. 8096, 436–451 (2013).
N. Alon and Y. Roichman, “Random Cayley graphs and expanders,” Random Struct. Algorithms 5, 271–284 (1994).
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge Univ. Press, Cambridge, 2004).
A. Vasiliev, A. Vasilov, and M. Latypov, “Analysis of properties of quantum hashing,” Itogi Nauki Tekh., Ser.: Sovrem.Mat. Prilozh. 138, 11–18 (2017).
R. Lidl and H. Niederreiter, Finite Fields (Cambridge Univ. Press, Cambridge, 1997).
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted by F.M. Ablayev
Rights and permissions
About this article
Cite this article
Ziatdinov, M.T. Attacking Quantum Hashing. Protocols and Their Cryptanalysis. Lobachevskii J Math 39, 1039–1045 (2018). https://doi.org/10.1134/S1995080218070211
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080218070211