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

DOI10.1134/S199508021807003XMaRDI QIDQ1992102zbMATH OpenOpenAlexWikidataFDO

Authors 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

branching programshash functionquantum computations

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Quantum hashing via \(\varepsilon \)-universal hashing constructions and Freivalds' fingerprinting schemas
• Analysis of properties of quantum hashing
• Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
• Quantum hashing for finite abelian groups
• Binary quantum hashing

Cites work

• Computing Boolean functions via quantum hashing
• Constructing small-bias sets from algebraic-geometric codes
• scientific article; zbMATH DE number 3497764 (Why is no real title available?)
• Quantum hashing for finite abelian groups
• Quantum hashing via \(\varepsilon \)-universal hashing constructions and Freivalds' fingerprinting schemas
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Unconditionally secure quantum signatures

Cited in

(1)

• Efficient algorithms for quantum hashing

This page was built for publication: Efficient branching programs for quantum hash functions generated by small-biased sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992102)