On Mon, 29 Aug 2005 17:32:47 +0200, Simon Josefsson said: > which are Fermat pseudoprime in every base. Some applications, > e.g. Libgcrypt used by GnuPG, use Fermat tests, so if you have control > of the random number generator, I believe you could make GnuPG believe > it has found a prime when it only found a Carmichael number.
5 Rabin-Miller tests using random bases are run after a passed Fermat test. Salam-Shalom, Werner --------------------------------------------------------------------- The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
