Analysis of properties of quantum hashing
From MaRDI portal
Recommendations
Cites work
- Algorithms for quantum branching programs based on fingerprinting
- Binary quantum hashing
- Computing Boolean functions via quantum hashing
- Constructing small-bias sets from algebraic-geometric codes
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 1161253 (Why is no real title available?)
- Improved Constructions of Quantum Automata
- Minimization by Random Search Techniques
- Quantum hashing for finite abelian groups
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
- Random Cayley graphs and expanders
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Small-Bias Sets for Nonabelian Groups
- Stochastic adaptive search for global optimization.
- Stochastic local search. Foundations and applications.
Cited in
(7)- Efficient branching programs for quantum hash functions generated by small-biased sets
- Usefulness of decoherence in quantum-walk-based hash function
- Hash function based on quantum walks
- Quantum hashing for finite abelian groups
- Binary quantum hashing
- Dual Universality of Hash Functions and Its Applications to Quantum Cryptography
- Identification of quantum hashes: numerical experiment
This page was built for publication: Analysis of properties of quantum hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331334)