Low-communication parallel quantum multi-target preimage search

DOI10.1007/978-3-319-72565-9_16zbMath1384.94030OpenAlexW2612094000MaRDI QIDQ1746977

Daniel J. Bernstein, Gustavo Banegas

Publication date: 26 April 2018

Full work available at URL: https://zenodo.org/record/2594640

zbMATH Keywords

Grover's algorithmquantum cryptanalysismulti-target preimagesparallel rho method

Mathematics Subject Classification ID

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

Related Items

Low-gate quantum golden collision finding ⋮ Triangulating rebound attack on AES-like hashing ⋮ Nostradamus goes quantum ⋮ Quantum time/memory/data tradeoff attacks ⋮ Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256 ⋮ Quantum search for scaled hash function preimages ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions ⋮ W-OTS\textsuperscript{+} up my sleeve! A hidden secure fallback for cryptocurrency wallets ⋮ Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound ⋮ Implementing Grover oracles for quantum key search on AES and LowMC

Cites Work

• Unnamed Item
• Unnamed Item
• Mitigating Multi-target Attacks in Hash-Based Signatures
• Applying Grover’s Algorithm to AES: Quantum Resource Estimates
• Time/Space Trade-Offs for Reversible Computation
• Efficient distributed quantum computing
• Quantum cryptanalysis of hash and claw-free functions