On quantum (δ, є)-resistant hashing
- Authors: Ablayev M.1
-
Affiliations:
- Laboratory of Quantum Informatics, Institute of Computational Mathematics and Information Technologies
- Issue: Vol 37, No 6 (2016)
- Pages: 758-767
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/198510
- DOI: https://doi.org/10.1134/S1995080216060081
- ID: 198510
Cite item
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.
About the authors
M. Ablayev
Laboratory of Quantum Informatics, Institute of Computational Mathematics and Information Technologies
Author for correspondence.
Email: mablayev@gmail.com
Russian Federation, Kremlevskaya ul. 35, Kazan, Tatarstan, 420008