What Is Grover's Algorithm and How Does It Affect Wallets?

Grover's algorithm is a quantum algorithm providing quadratic speedup for searching unstructured databases. For cryptography, it halves the effective security of symmetric encryption and hash functions. Unlike Shor's algorithm, Grover's provides speedup rather than complete breaks, making defense straightforward.

Classical brute-force search through N items requires O(N) operations. Grover's algorithm accomplishes this in O(√N) operations—quadratic speedup. For a 256-bit key, classical search needs 2^256 operations; Grover's reduces this to 2^128 operations.

Impact on symmetric cryptography is manageable. AES-128 drops to about 64-bit security against Grover's algorithm on paper, though Grover parallelises so poorly that NIST still treats AES-128-level strength as its security category 1. AES-256 provides 128-bit post-quantum security—sufficient for all foreseeable applications. Doubling key length neutralizes Grover's advantage.

Hash functions face similar analysis. SHA-256 collision resistance falls at most to about 85 bits against quantum search (Brassard-Hoyer-Tapp), but preimage resistance (the property wallets rely on) drops from 256-bit to 128-bit—still adequate. Longer hash outputs provide additional margin.

For cryptocurrency wallets, Grover's affects address security minimally. Bitcoin addresses use RIPEMD-160 (already only 160-bit), providing 80-bit quantum security—at the lower boundary of acceptability. Quantum-resistant wallets using stronger hash functions maintain comfortable security margins.

Asymmetric cryptography (ECDSA) is unaffected by Grover's but completely broken by Shor's. This is why migrating to post-quantum signatures (SPHINCS+) matters far more than hash function adjustments.

SynX uses Kyber-768 and SPHINCS+ with parameters providing strong security margins against both Shor's and Grover's algorithms. Hash functions and symmetric components are sized appropriately for the quantum computing era.