Parallel search blunts Grover's speedup, making AES-256 harder to break than thought
Jsevillamol · x · 2026-09-23
Jsevillamol self-corrects in a quantum-crypto discussion: revisiting his past writing, he notes Grover's algorithm doesn't deliver a full quadratic advantage when performing parallel search, so breaking AES-256 with quantum computers is harder than he suggested. The thread also references analysis on breaking RSA-2048 and Fin Moorhouse's long-form interview with Jaime Sevilla on causation, forecasting and quantum computing timelines.
More from Research
- Schmidhuber: I Published the First Concrete Recursive Self-Improvement Algorithms Back in 1987 — SchmidhuberAI · 2026-09-23
- Tencent ARC's GAE: Geometry-Native Latent Space Halves Camera Error in World Generation — yshan2u · 2026-09-23
- Quanta Explains How Pricing Algorithms Can Drive Up Prices Without Collusion — burny_tech · 2026-09-23
- CodeMidas: Turning Raw Source Code into Executable RL Environments for Coding Agents — burny_tech · 2026-09-23
- Researchers pine for pre-2000s methodological papers with no mathiness or defensive fluff — PMinervini · 2026-09-23
- Block-triangular joint drifting enables one-step generative surrogate models for stochastic trajectories — chaumian · 2026-09-23