- C506F05A540F43FF34059CC5398431AA58B1F4F2294C38A1A793B19D9CCDC9B21C21A06577C95623401EF4154009E77301B640FD323FDEA9E3570C1407368BD6+ A8521AFBD09107DDCE7EE4683886C44F1A8C2A17B29CB7583F18CB858B8D7833E446EC1AA2C5371246759E99A163DF5676686EBDF202075EF50A34D5CDFABCC7eucrypt/smg_rsa/rsa.c(52 . 7)(52 . 7)
51 /* choose random prime e, public exponent, with 3 < e < phi */
52 /* because e is prime, gcd(e, phi) is always 1 so no need to check it */
53 do {
54 gen_random_prime( noctets_pq, sk->e);
55 gen_random_prime( E_LENGTH_OCTETS, sk->e);
56 } while ( (mpi_cmp_ui(sk->e, 3) < 0) || (mpi_cmp(sk->e, phi) > 0));
57
58 /* calculate private exponent d, 1 < d < phi, where e * d = 1 mod phi */