QC resistant algorithms?

Robert J. Hansen rjh at sixdemonbag.org
Wed Dec 16 23:25:26 CET 2015

> 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".

If I remember correctly, we definitely already have -- a while ago I saw
some paper claiming to be a proof that McEliece was NP-HARD.  If that's
true, I'm willing to say McEliece is QC-immune, because a QC attack on
an NP-HARD problem is currently pretty much unimaginable.

More information about the Gnupg-users mailing list