Quantum multicollision-finding algorithm

DOI10.1007/978-3-319-70697-9_7zbMath1380.81087OpenAlexW2768738052MaRDI QIDQ1703921

Yu Sasaki, Akinori Hosoyamada, Keita Xagawa

Publication date: 8 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70697-9_7

zbMATH Keywords

quantum algorithmpost-quantum cryptographyGroverBHTmulticollisionrigorous complexity evaluationstate-of-art

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (7)

Quantum attacks on some Feistel block ciphers ⋮ Triangulating rebound attack on AES-like hashing ⋮ Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms ⋮ Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 ⋮ Quantum algorithm for the multicollision problem ⋮ On subset-resilient hash function families ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms

This page was built for publication: Quantum multicollision-finding algorithm