Recommendations
Cites work
- scientific article; zbMATH DE number 3497764 (Why is no real title available?)
- scientific article; zbMATH DE number 1161253 (Why is no real title available?)
- scientific article; zbMATH DE number 1839432 (Why is no real title available?)
- Computing Boolean functions via quantum hashing
- Constructing small-bias sets from algebraic-geometric codes
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
- Random Cayley graphs and expanders
- Simple Constructions of Almost k-wise Independent Random Variables
Cited in
(15)- Quantum hashing via \(\varepsilon \)-universal hashing constructions and Freivalds' fingerprinting schemas
- A quantum hash function with grouped coarse-grained boson sampling
- Attacking quantum hashing. Protocols and their cryptanalysis
- Efficient branching programs for quantum hash functions generated by small-biased sets
- Simple hash function using discrete-time quantum walks
- Quantum hashing for finite abelian groups
- On the concept of quantum hashing
- Identification of quantum hashes: numerical experiment
- Quantum hashing. Group approach
- Hash function based on quantum walks
- Analysis of properties of quantum hashing
- Cryptographic properties of the quantum hashing based on expander graphs
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
- On quantum \((\delta,\varepsilon)\)-resistant hashing
- Computing Boolean functions via quantum hashing
This page was built for publication: Binary quantum hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327965)
