Quantum time/memory/data tradeoff attacks
From MaRDI portal
Publication:6146595
DOI10.1007/s10623-023-01300-xzbMath1530.94027OpenAlexW3217041859MaRDI QIDQ6146595
Adi Shamir, Orr Dunkelman, Eyal Ronen, Nathan Keller
Publication date: 15 January 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01300-x
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers
- Quantum algorithms for the \(k\)-XOR problem
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Low-communication parallel quantum multi-target preimage search
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Quantum random oracle model with auxiliary input
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Time/Space Trade-Offs for Reversible Computation
- A cryptanalytic time-memory trade-off
- Quantum Algorithms for the Subset-Sum Problem
- Improved Time-Memory Trade-Offs with Multiple Data
- Advances in Cryptology - CRYPTO 2003
- Quantum Walk Algorithm for Element Distinctness
- Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
- Cryptanalysis of the generalised Legendre pseudorandom function
- Quantum cryptanalysis of hash and claw-free functions
- Finding many collisions via reusable quantum walks. Application to lattice sieving
This page was built for publication: Quantum time/memory/data tradeoff attacks