5 ms·
Grover’s algorithm could be described as quantum brute force that is able to break AES-128 but not AES-256
by ironhaven 2y ago
Grover’s algorithm could be described as quantum brute force that is able to break AES-128 but not AES-256
- nmadden 2y agoYes (although practically speaking it’s very unlikely that Grover will ever break AES-128), but that’s still a brute force attack and still subject to the physical limits mentioned in the Schneier quote. Whereas attacks on RSA like the number field sieve or Shor’s algorithm are much more efficient than brute force. (Which is why you need such big keys for RSA in the first place).