QC resistant algorithms?
anthony at cajuntechie.org
Wed Dec 16 21:22:13 CET 2015
-----BEGIN PGP SIGNED MESSAGE-----
On 12/16/2015 2:14 PM, Lachlan Gunn wrote:
> Long story short, there exist algorithms that are hypothesised tho
> be QC-resistant, though as far as I know nothing is proven in that
> respect. Those that do exist, there's still a substantial
> possibility that they'll be broken. Key and signature sizes are
> generally large, kilobytes to megabytes.
> Certainly nothing is standardised, let alone being ready to go into
> This is all outside of my area, so someone please correct me if I'm
> way off.
This is sort of what I'd gathered from the brief reading I've done
about the situation. I'm sure there's a lot of research going on in
the area and I certainly hope "we beat them to it".
-----BEGIN PGP SIGNATURE-----
-----END PGP SIGNATURE-----
More information about the Gnupg-users