> 160 bits!) was a later optimization of ElGamal by NSA.  2. The RSA
> security conjecture had not yet accumulated enough evidence to be
> trusted, specifically there was no hard evidencethat breaking an RSA
> key was as NP-hard as the discrete logarithm problem.

Neither RSAP nor DLP are believed to be NP-Hard.

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

Reply via email to