Re: quantum computing and symmetric algotithms

"Robert J. Hansen via Gnupg-users" <[email protected]> Thu, 30 Apr 2026 21:04:54 -0400

Newsgroups	gmane.comp.encryption.gpg.user
Message-ID	<[email protected]>

> It would be useful in discussions on quantum computing and
> cryptography not to miss that vulnerability (if and to the extent it
> exists) only pertains to the asymmetric algorithms. As far as we
> know, no modern symmetric block  cipher is affected.

True, with 3DES as a possible exception. There's a meet in the middle 
attack that means with truly ludicrous amounts of hardware it could be 
reduced to complexity 2**112, which is ... not practical for Grover's 
algorithm for many reasons, but is definitely not as wildly impractical 
as I'd like.

_______________________________________________
Gnupg-users mailing list
[email protected]
https://lists.gnupg.org/mailman/listinfo/gnupg-users

OpenPGP_signature.asc (application/pgp-signature, 236 B)