Mercurial > dropbear
comparison genrsa.c @ 594:a98a2138364a
Improve capitalisation for all logged strings
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Wed, 23 Feb 2011 15:50:30 +0000 |
parents | b50f0107e505 |
children | 2b1bb792cd4d 167fdc091c05 |
comparison
equal
deleted
inserted
replaced
593:ea103e4476ce | 594:a98a2138364a |
---|---|
56 &pminus, &lcm, &qminus, NULL); | 56 &pminus, &lcm, &qminus, NULL); |
57 | 57 |
58 seedrandom(); | 58 seedrandom(); |
59 | 59 |
60 if (mp_set_int(key->e, RSA_E) != MP_OKAY) { | 60 if (mp_set_int(key->e, RSA_E) != MP_OKAY) { |
61 fprintf(stderr, "rsa generation failed\n"); | 61 fprintf(stderr, "RSA generation failed\n"); |
62 exit(1); | 62 exit(1); |
63 } | 63 } |
64 | 64 |
65 getrsaprime(key->p, &pminus, key->e, size/2); | 65 getrsaprime(key->p, &pminus, key->e, size/2); |
66 getrsaprime(key->q, &qminus, key->e, size/2); | 66 getrsaprime(key->q, &qminus, key->e, size/2); |
67 | 67 |
68 if (mp_mul(key->p, key->q, key->n) != MP_OKAY) { | 68 if (mp_mul(key->p, key->q, key->n) != MP_OKAY) { |
69 fprintf(stderr, "rsa generation failed\n"); | 69 fprintf(stderr, "RSA generation failed\n"); |
70 exit(1); | 70 exit(1); |
71 } | 71 } |
72 | 72 |
73 /* lcm(p-1, q-1) */ | 73 /* lcm(p-1, q-1) */ |
74 if (mp_lcm(&pminus, &qminus, &lcm) != MP_OKAY) { | 74 if (mp_lcm(&pminus, &qminus, &lcm) != MP_OKAY) { |
75 fprintf(stderr, "rsa generation failed\n"); | 75 fprintf(stderr, "RSA generation failed\n"); |
76 exit(1); | 76 exit(1); |
77 } | 77 } |
78 | 78 |
79 /* de = 1 mod lcm(p-1,q-1) */ | 79 /* de = 1 mod lcm(p-1,q-1) */ |
80 /* therefore d = (e^-1) mod lcm(p-1,q-1) */ | 80 /* therefore d = (e^-1) mod lcm(p-1,q-1) */ |
81 if (mp_invmod(key->e, &lcm, key->d) != MP_OKAY) { | 81 if (mp_invmod(key->e, &lcm, key->d) != MP_OKAY) { |
82 fprintf(stderr, "rsa generation failed\n"); | 82 fprintf(stderr, "RSA generation failed\n"); |
83 exit(1); | 83 exit(1); |
84 } | 84 } |
85 | 85 |
86 mp_clear_multi(&pminus, &qminus, &lcm, NULL); | 86 mp_clear_multi(&pminus, &qminus, &lcm, NULL); |
87 | 87 |
106 | 106 |
107 bytes_to_mp(prime, buf, size+1); | 107 bytes_to_mp(prime, buf, size+1); |
108 | 108 |
109 /* find the next integer which is prime, 8 round of miller-rabin */ | 109 /* find the next integer which is prime, 8 round of miller-rabin */ |
110 if (mp_prime_next_prime(prime, 8, 0) != MP_OKAY) { | 110 if (mp_prime_next_prime(prime, 8, 0) != MP_OKAY) { |
111 fprintf(stderr, "rsa generation failed\n"); | 111 fprintf(stderr, "RSA generation failed\n"); |
112 exit(1); | 112 exit(1); |
113 } | 113 } |
114 | 114 |
115 /* subtract one to get p-1 */ | 115 /* subtract one to get p-1 */ |
116 if (mp_sub_d(prime, 1, primeminus) != MP_OKAY) { | 116 if (mp_sub_d(prime, 1, primeminus) != MP_OKAY) { |
117 fprintf(stderr, "rsa generation failed\n"); | 117 fprintf(stderr, "RSA generation failed\n"); |
118 exit(1); | 118 exit(1); |
119 } | 119 } |
120 /* check relative primality to e */ | 120 /* check relative primality to e */ |
121 if (mp_gcd(primeminus, rsa_e, &temp_gcd) != MP_OKAY) { | 121 if (mp_gcd(primeminus, rsa_e, &temp_gcd) != MP_OKAY) { |
122 fprintf(stderr, "rsa generation failed\n"); | 122 fprintf(stderr, "RSA generation failed\n"); |
123 exit(1); | 123 exit(1); |
124 } | 124 } |
125 } while (mp_cmp_d(&temp_gcd, 1) != MP_EQ); /* while gcd(p-1, e) != 1 */ | 125 } while (mp_cmp_d(&temp_gcd, 1) != MP_EQ); /* while gcd(p-1, e) != 1 */ |
126 | 126 |
127 /* now we have a good value for result */ | 127 /* now we have a good value for result */ |