TL;DR: Grover's algorithm (1996) provides quadratic speedup for unstructured search problems. While less dramatic than Shor's exponential speedup, it's more broadly applicable. For a 256-bit key, Grover redu
Grover's algorithm (1996) provides quadratic speedup for unstructured search problems. While less dramatic than Shor's exponential speedup, it's more broadly applicable. For a 256-bit key, Grover reduces effective security to 128 bits. This motivates AES-256 as the post-quantum symmetric encryption standard.
Type
Search / Optimization
Complexity
O(√N) vs classical O(N)
Application
Unstructured search, cryptographic key search, database search