Abstract
In the paper, we define the concept of the quantum hash generator and offer design, which allows to build a large amount of different quantum hash functions. The construction is based on composition of classical ∈-universal hash family and a given family of functions-quantum hash generator.
In particular, using the relationship between ∈-universal hash families and Freivalds fingerprinting schemas we present explicit quantum hash function and prove that this construction is optimal in the sense of number of qubits needed for construction.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Ablayev and A. Vasiliev, Electronic Proceedings in Theoretical Computer Science. 9, 1 (2009).
F. Ablayev and A. Vasiliev, arXiv:1310.4922 [quant-ph] (2013).
F. Ablayev and A. Vasiliev, Laser Physics Letters. 2(11), (2014).
F. Ablayev and M. Ablayev, arXiv:1404.1503 [quant-ph] (2014).
J. Bierbrauer, T. Johansson, G. Kabatianskii, and B. Smeets, Springer: Advances in Cryptology CRYPTO 93 Lecture Notes in Computer Science. 773 (1994).
H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf, Phys. Rev. Lett. 87, 167902 (2001).
J. Carter and M. Wegman, Universal Classes of Hash Functions, J. Computer and System Sciences. 18, 143 (1979).
D. Gavinsky and T. Ito, Quantum Information and Computation 13, 7–8 (2013).
D. Gottesman and I. Chuang: arXiv:0105032 [quant-ph] (2001).
R. Freivalds, Transactions of the IFIP Congress (1977).
A. Montanaro and T. Osborne, arXiv:0810.2435 [quant-ph] (2008).
A. Holevo, Problems of Information Transmission, 9 (1973).
A. Razborov, E. Szemeredi, and A. Wigderson, Combinatorics, Probability and Computing. 2 (1993).
D. Stinson, Congressus Numerantium. 114 (1996).
D. Stinson, J. Combinatorial Math. Combinatorial Comp. 42 (2002).
D. Stinson, Cryptography: Theory and Practice, 3rd ed. (CRC, Boca Raton, 2005).
A. Wigderson, Lectures on the Fusion Method and Derandomization, Technical Report SOCS-95. 2 (School of Computer Science, McGill Univ., 1995).
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted by A. M. Elizarov
Rights and permissions
About this article
Cite this article
Ablayev, F., Ablayev, M. Quantum hashing via ∈-universal hashing constructions and classical fingerprinting. Lobachevskii J Math 36, 89–96 (2015). https://doi.org/10.1134/S199508021502002X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S199508021502002X