Quantum hashing for finite abelian groups

DOI10.1134/S1995080216060184zbMath1368.81067arXiv1603.02209OpenAlexW2963889900WikidataQ62561317 ScholiaQ62561317MaRDI QIDQ2361681

Alexander V. Vasiliev

Publication date: 30 June 2017

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

Full work available at URL: https://arxiv.org/abs/1603.02209

zbMATH Keywords

finite groupsquantum cryptographyquantum hashingsmall-bias sets

Mathematics Subject Classification ID

Quantum computation (81P68) General theory for finite permutation groups (20B05) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

From graphs to keyed quantum hash functions ⋮ On quantum \((\delta,\varepsilon)\)-resistant hashing ⋮ Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations ⋮ Collision resistance of the OAM-based quantum hashing ⋮ Cryptographic properties of the quantum hashing based on expander graphs ⋮ Tensor-spinor theory of gravitation in general even space-time dimensions ⋮ Usefulness of decoherence in quantum-walk-based hash function ⋮ Efficient branching programs for quantum hash functions generated by small-biased sets ⋮ Attacking quantum hashing. Protocols and their cryptanalysis ⋮ Минимизация коллизий при квантовом хешировании ⋮ Analysis of properties of quantum hashing

Cites Work

• Small-Bias Sets for Nonabelian Groups
• Computing Boolean Functions via Quantum Hashing
• Simple Constructions of Almost k-wise Independent Random Variables
• Random Cayley graphs and expanders
• Constructing Small-Bias Sets from Algebraic-Geometric Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item