Binary quantum hashing
From MaRDI portal
Publication:327965
DOI10.3103/S1066369X16090073zbMATH Open1348.81209OpenAlexW2489719044WikidataQ62561315 ScholiaQ62561315MaRDI QIDQ327965FDOQ327965
Authors: Alexander V. Vasiliev 
Publication date: 20 October 2016
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x16090073
Recommendations
Cryptography (94A60) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Simple Constructions of Almost k-wise Independent Random Variables
- Title not available (Why is that?)
- Constructing small-bias sets from algebraic-geometric codes
- Computing Boolean functions via quantum hashing
- Random Cayley graphs and expanders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
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
- Hash function based on quantum walks
- Analysis of properties of quantum hashing
- Quantum hashing. Group approach
- 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)
