Hi Could any one tell me the high-level prime search method employed by GPG? Is it something like this:
- generate a random number - is it prime? if yes, use it - if not, continue adding ones to it until a prime number is found Also, which algorithm is used by GPG for testing primality? Regards Hardeep Singh _______________________________________________ Gnupg-users mailing list Gnupg-users@gnupg.org http://lists.gnupg.org/mailman/listinfo/gnupg-users
