Grover's algorithm gives quantum computers a quadratic speedup for unstructured search, weakening symmetric ciphers and hash functions but not breaking them.