Abstract
In the paper we define a notion of quantum resistant ((δ, є)-resistant) hash function which combine together a notion of pre-image (one-way) resistance (δ-resistance) property and the notion of collision resistance (є-resistance) properties. We present a discussion that supports the idea of quantum hashing oriented for cryptographical purposes. We propose a quantum setting of a classical digital signature scheme do demonstrate a theoretical possibilities and restrictions of (δ, є)-hashing. The assumption we use is that a set of qubits (quantum hash) we generate, send, and receive during the execution of a protocol can be stored for a certain (a large enough) amount of time; next, the scheme requires the high degree of entanglement between the qubits which makes such a quantum hash. These properties make quantum hash cryptographically efficient.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
F. Ablayev and M. Ablayev, On the conception of cryptographical quantum hashing. arXiv:1509.01268 [quant-ph] (2015).
F. Ablayev and M. Ablayev, Quantum hashing via classical d-universal hashing constructions. arXiv:1404.1503v2 [quant-ph] (2015).
F. Ablayev and A. Vasiliev, “Algorithms for quantum branching programs based on fingerprinting,” Electronic Proceedings in Theoretical Computer Science 9, 1–11 (2009).
F. Ablayev and A. Vasiliev, “Cryptographic quantum hashing,” Laser Phys. Lett. 11 (2), 025202 (2013).
F. Ablayev and A. Vasiliev, “Computing Boolean functions via quantum hashing,” Computing with New Resources, Lecture Notes in Computer Science 8808, 149–160 (2014).
M. Ablayev, “On constructing quantum hash functions,” Discrete Models in Control Systems Theory: IX International Conference, Moscow and Moscow region, 20–22 May, 2015 (MAKS Press, Moscow, 2015), pp. 8–9 [In Russian].
N. Alon and Y. Roichman, “Random Cayley graphs and expanders,” Random Structures & Algorithms 5 (2), 271–284 (1994).
A. Ambainis and R. Freivalds, 1-Way quantum finite automata: strengths, weaknesses and generalizations. arXiv:quant-ph/9802062v3 (1998).
R. Amiri and E. Andersson, “Unconditionally secure quantum signature,” Entropy, 17 (8), 5635–5659 (2015).
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).
D. Gottesman and I. Chuang, Quantum digital signatures. arXiv:quantph/0105032 (2001).
A. Holevo, “Some estimates of the information transmitted by quantum communication channel,” Probl. Inf. Transm. 9 (3), 177–183 (1973).
J. Naor and M. Naor, “Small-bias probability spaces: Efficient constructions and applications,” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing (1990), pp. 213–223.
A. Nayak, Optimal lower bounds for quantum automata and random access codes. arXiv:quantph/9904093v3 (1999).
M. Nielsen and I. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2010).
I. Radchenko, K. Kravtsov, S. Kulik, and S. Molotkov, “Relativistic quantum cryptography,” Laser Phys. Lett. 11 (6), 065203 (2014).
A. Vasiliev, “Quantum communications based on quantum hashing,” International Journal of Applied Engineering Research 10 (12), 31415–31426 (2015).
A. Vasiliev, Quantum Hashing for Finite Abelian Groups. arXiv:1603.02209 [quant-ph] (2016).
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted by M. M. Arslanov
Rights and permissions
About this article
Cite this article
Ablayev, M. On quantum (δ, є)-resistant hashing. Lobachevskii J Math 37, 758–767 (2016). https://doi.org/10.1134/S1995080216060081
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080216060081