Efficient branching programs for quantum hash functions generated by small-biased sets

DOI10.1134/S199508021807003XzbMath1401.81033OpenAlexW2891405337WikidataQ129248174 ScholiaQ129248174MaRDI QIDQ1992102

M. F. Ablayev

Publication date: 2 November 2018

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199508021807003x

zbMATH Keywords

quantum computationsbranching programshash function

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unconditionally secure quantum signatures
• Quantum hashing for finite abelian groups
• Computing Boolean Functions via Quantum Hashing
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas