Минимизация коллизий при квантовом хешировании

DOI10.4213/mvk182zbMath1476.81030OpenAlexW2790958391MaRDI QIDQ3381820

M. T. Ziatdinov, Alexander V. Vasiliev

Publication date: 20 September 2021

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk182

zbMATH Keywords

simulated annealingquantum computationgenetic algorithmquantum hashinghashing collisions

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94)

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Quantum hashing for finite abelian groups
• Computing Boolean Functions via Quantum Hashing
• Constructing Small Sets that are Uniform in Arithmetic Progressions
• Fast Software Encryption

This page was built for publication: Минимизация коллизий при квантовом хешировании