Grover’s algorithm reduces SHA-256’s security from 256 bits to 128 bits through its ability to search unsorted databases quadratically faster than classical algorithms. Here’s how...