Email this article Efficient Branching Programs for Quantum Hash Functions Generated by Small-Biased Sets
- Authors: Ablayev M.F.1
-
Affiliations:
- Institute of Computational Mathematics and Information Technologies
- Issue: Vol 39, No 7 (2018)
- Pages: 961-966
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202716
- DOI: https://doi.org/10.1134/S199508021807003X
- ID: 202716
Cite item
Open Access
Access granted
Subscription Access
Abstract
In the paper we consider quantum (δ, ϵ)-hash functions in so called phase form (phase quantum (δ, ϵ)-hash function). It is known that ϵ-biased sets generate phase quantum (δ, ϵ)- hash function. We show that the construction is invertible, that is, phase quantum (δ, ϵ)-hash function defines ϵ-biased sets. Next, we present an efficient (in the sense of time and qubits needed) Branching program construction for phase quantum (δ, ϵ)-hash function.
Keywords
About the authors
M. F. Ablayev
Institute of Computational Mathematics and Information Technologies
Author for correspondence.
Email: mablayev@gmail.com
Russian Federation, ul. Kremlevskaya 18, Kazan, Tatarstan, 420008
