Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting

DOI10.1134/S199508021502002XzbMath1325.81060WikidataQ62045225 ScholiaQ62045225MaRDI QIDQ748223

D. Kharzeev

Publication date: 20 October 2015

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Quantum computation (81P68) Other types of codes (94B60) Quantum coding (general) (81P70)

Related Items (10)

From graphs to keyed quantum hash functions ⋮ On quantum \((\delta,\varepsilon)\)-resistant hashing ⋮ Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations ⋮ Binary quantum hashing ⋮ Cryptographic properties of the quantum hashing based on expander graphs ⋮ Dynamic full quantum one-way function based on quantum circuit mapping ⋮ Classical and Quantum Computations with Restricted Memory ⋮ Usefulness of decoherence in quantum-walk-based hash function ⋮ Analysis of properties of quantum hashing ⋮ Universal construction of a full quantum one-way function

Cites Work

• Universal classes of hash functions
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting