On Mon, Mar 24, 2003 at 04:43:35PM -0800, Lawrence Teo wrote: > For RSA key generation, we need to ensure that we pick > an e, that is 1 < e < phi and gcd( e, phi ) == 1, > where phi = (p-1)(q-1) in RSA case. So we need to > check e being relatively prime to (p-1)(q-1).
Actually, the RSA key generation code now takes e as given, and tries to find p, and q such that p-1 and q-1 are both relatively prime to e. But for p, q < 2^16 it goes through another code path specific for small primes, and it wasn't doing this check in that case.
