Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas

DOI10.1007/978-3-319-09704-6_5zbMath1416.68075OpenAlexW994871779WikidataQ62045230 ScholiaQ62045230MaRDI QIDQ5496176

Marat Ablayev, Farid M. Ablayev

Publication date: 7 August 2014

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09704-6_5

zbMATH Keywords

error-correcting codesquantum hashingquantum hash function\(\varepsilon \)-universal hashing

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (2)

О понятии квантового хеширования ⋮ Efficient branching programs for quantum hash functions generated by small-biased sets

This page was built for publication: Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas