Low-communication parallel quantum multi-target preimage search

DOI10.1007/978-3-319-72565-9_16MaRDI QIDQ1746977zbMATH OpenOpenAlexFDO

Authors Gustavo Banegas, Daniel J. Bernstein

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)

Recommendations

• An efficient quantum collision search algorithm and implications on symmetric cryptography
• Applying Grover's algorithm to AES: quantum resource estimates
• Quantum Demiric-Selcuk meet-in-the-middle attacks on reduced-round AES
• Improvements to quantum search techniques for block-ciphers, with applications to AES
• Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Applying Grover's algorithm to AES: quantum resource estimates
• Efficient distributed quantum computing
• How significant are the known collision and element distinctness quantum algorithms?
• Mitigating multi-target attacks in hash-based signatures
• Quantum cryptanalysis of hash and claw-free functions
• Time/Space Trade-Offs for Reversible Computation

Cited in

(14)

• Exploiting preprocessing for quantum search to break parameters for \(\mathcal{MQ}\) cryptosystems
• Low-gate quantum golden collision finding
• Nostradamus goes quantum
• Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
• Quantum search for scaled hash function preimages
• Quantum time/memory/data tradeoff attacks
• An efficient quantum collision search algorithm and implications on symmetric cryptography
• Implementing Grover oracles for quantum key search on AES and LowMC
• Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256
• Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
• Quantum attacks on hash constructions with low quantum random access memory
• Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
• Triangulating rebound attack on AES-like hashing
• W-OTS\textsuperscript{+} up my sleeve! A hidden secure fallback for cryptocurrency wallets

This page was built for publication: Low-communication parallel quantum multi-target preimage search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746977)