Grover's algorithm
Grover’s algorithm, developed in 1996 by Lov Grover, is expected to reduce the security of hashing algorithms by 50%1.
What is Grover’s algorithm?
In quantum computing, Grover’s algorithm, also known as the quantum search algorithm, is a quantum algorithm for unstructured search that finds with high probability the unique input to a black box function that produces a particular output value, using just O(sqrt(n)) evaluations of the function, where N N is the size of the function’s domain.2