On the power of adaptivity for function inversion
From MaRDI portal
Cites work
- A cryptanalytic time-memory trade-off
- Advances in Cryptology - CRYPTO 2003
- Data Structures Lower Bounds and Popular Conjectures
- Data structures meet cryptography: 3SUM with preprocessing
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- scientific article; zbMATH DE number 1583765 (Why is no real title available?)
- scientific article; zbMATH DE number 3597878 (Why is no real title available?)
- scientific article; zbMATH DE number 1759258 (Why is no real title available?)
- scientific article; zbMATH DE number 7759460 (Why is no real title available?)
- Lower bounds on the time/memory tradeoff of function inversion
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- On the power of small-depth computation
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Quantum random oracle model with auxiliary input
- Random oracles and non-uniformity
- Revisiting time-space tradeoffs for function inversion
- Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
- The function-inversion problem: barriers and opportunities
- The non-uniform perebor conjecture for time-bounded Kolmogorov complexity is false
- Tight quantum time-space tradeoffs for function inversion
- Time space tradeoffs for attacks against one-way functions and PRGs
This page was built for publication: On the power of adaptivity for function inversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864454)
