Grover's Algorithm
A quantum search algorithm that achieves a quadratic speedup for searching unordered databases. Against symmetric ciphers it provides only a quadratic speedup for brute-force attacks.
Timeline (last 90 days)
Grover's algorithm speeds up symmetric keys only quadratically, so a 256-bit key retains about 128 bits of security strength.
Symmetric ciphers such as AES are affected by Grover's algorithm, and security levels can be maintained simply by doubling the key length.
Grover's algorithm brings a quadratic speedup to symmetric key search, which can be effectively countered by doubling the key length, and AES-256 remains secure in the quantum era.
Shor的大数分解算法和Grover的搜索算法利用波函数干涉放大正确答案的概率振幅、抑制错误答案的振幅
All Facts (4)
Grover's algorithm speeds up symmetric keys only quadratically, so a 256-bit key retains about 128 bits of security strength.
50%UnverifiedSymmetric ciphers such as AES are affected by Grover's algorithm, and security levels can be maintained simply by doubling the key length.
50%UnverifiedGrover's algorithm brings a quadratic speedup to symmetric key search, which can be effectively countered by doubling the key length, and AES-256 remains secure in the quantum era.
50%UnverifiedShor的大数分解算法和Grover的搜索算法利用波函数干涉放大正确答案的概率振幅、抑制错误答案的振幅
50%