Efficient Branching Programs for Quantum Hash Functions Generated by Small-Biased Sets
-
Published:2018-09
Issue:7
Volume:39
Page:961-966
-
ISSN:1995-0802
-
Container-title:Lobachevskii Journal of Mathematics
-
language:en
-
Short-container-title:Lobachevskii J Math
Publisher
Pleiades Publishing Ltd
Subject
General Mathematics
Reference11 articles.
1. F. Ablayev and A. Vasiliev, “Cryptographic quantum hashing,” Laser Phys. Lett. 11, 025202 (2014).
2. A. S. Holevo, “Some estimates of the information transmitted by quantum communication channel,” Probl. Pered. Inform. 9 (3), 3–11 (1973).
3. R. Amiri and E. Andersson, “Unconditionally secure quantum signatures,” Entropy 17, 5635–5659 (2015).
4. J. Naor and M. Naor, “Small-bias probability spaces: efficient constructions and applications,” in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC’90, 1990, pp. 213–223.
5. F. Ablayev and A. Vasiliev, “Computing Boolean functions via quantum hashing,” Lect. Notes Comput. Sci. 8808, 149–160 (2014).