Two tidbits of potential interest

Werner Koch wk at
Sat Sep 26 12:46:46 CEST 2009

On Fri, 25 Sep 2009 19:22, marcio.barbado at said:

> And as a conclusion, Elgamal problems would be harder to solve. Is it correct?

No; it is not sure that the discrete logarithm problem is harder to
solve that the factoring problem.



Die Gedanken sind frei.  Auschnahme regelt ein Bundeschgesetz.

More information about the Gnupg-users mailing list