On Fri, 25 Sep 2009 19:22, marcio.barb...@gmail.com 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. Shalom-Salam, Werner -- Die Gedanken sind frei. Auschnahme regelt ein Bundeschgesetz. _______________________________________________ Gnupg-users mailing list Gnupg-users@gnupg.org http://lists.gnupg.org/mailman/listinfo/gnupg-users
