openssl/crypto/rsa/rsa_x931g.c - Issue 9254031: Upgrade chrome's OpenSSL to same version Android ships with.

Side by Side Diff: openssl/crypto/rsa/rsa_x931g.c

Issue 9254031: Upgrade chrome's OpenSSL to same version Android ships with. (Closed) Base URL: http://src.chromium.org/svn/trunk/deps/third_party/openssl/

Patch Set: '' Created 8 years, 11 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch | Annotate | Revision Log

OLD	NEW
	(Empty)
1 /* crypto/rsa/rsa_gen.c */

2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)

3 * All rights reserved.

4 *

5 * This package is an SSL implementation written

6 * by Eric Young (eay@cryptsoft.com).

7 * The implementation was written so as to conform with Netscapes SSL.

8 *

9 * This library is free for commercial and non-commercial use as long as

10 * the following conditions are aheared to. The following conditions

11 * apply to all code found in this distribution, be it the RC4, RSA,

12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation

13 * included with this distribution is covered by the same copyright terms

14 * except that the holder is Tim Hudson (tjh@cryptsoft.com).

15 *

16 * Copyright remains Eric Young's, and as such any Copyright notices in

17 * the code are not to be removed.

18 * If this package is used in a product, Eric Young should be given attribution

19 * as the author of the parts of the library used.

20 * This can be in the form of a textual message at program startup or

21 * in documentation (online or textual) provided with the package.

22 *

23 * Redistribution and use in source and binary forms, with or without

24 * modification, are permitted provided that the following conditions

25 * are met:

26 * 1. Redistributions of source code must retain the copyright

27 * notice, this list of conditions and the following disclaimer.

28 * 2. Redistributions in binary form must reproduce the above copyright

29 * notice, this list of conditions and the following disclaimer in the

30 * documentation and/or other materials provided with the distribution.

31 * 3. All advertising materials mentioning features or use of this software

32 * must display the following acknowledgement:

33 * "This product includes cryptographic software written by

34 * Eric Young (eay@cryptsoft.com)"

35 * The word 'cryptographic' can be left out if the rouines from the library

36 * being used are not cryptographic related :-).

37 * 4. If you include any Windows specific code (or a derivative thereof) from

38 * the apps directory (application code) you must include an acknowledgement:

39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"

40 *

41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND

42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE

45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS

47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)

48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT

49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY

50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF

51 * SUCH DAMAGE.

52 *

53 * The licence and distribution terms for any publically available version or

54 * derivative of this code cannot be changed. i.e. this code cannot simply be

55 * copied and put under another distribution licence

56 * [including the GNU Public Licence.]

57 */

58

59 #include <stdio.h>

60 #include <string.h>

61 #include <time.h>

62 #include <openssl/err.h>

63 #include <openssl/bn.h>

64 #include <openssl/rsa.h>

65

66 #ifndef OPENSSL_FIPS

67

68 /* X9.31 RSA key derivation and generation */

69

70 int RSA_X931_derive_ex(RSA rsa, BIGNUM p1, BIGNUM p2, BIGNUM q1, BIGNUM *q2,

71 const BIGNUM Xp1, const BIGNUM Xp2, const BIGNUM *Xp,

72 const BIGNUM Xq1, const BIGNUM Xq2, const BIGNUM *Xq,

73 const BIGNUM e, BN_GENCB cb)

74 {

75 BIGNUM r0=NULL,r1=NULL,r2=NULL,r3=NULL;

76 BN_CTX ctx=NULL,ctx2=NULL;

77

78 if (!rsa)

79 goto err;

80

81 ctx = BN_CTX_new();

82 if (!ctx)

83 goto err;

84 BN_CTX_start(ctx);

85

86 r0 = BN_CTX_get(ctx);

87 r1 = BN_CTX_get(ctx);

88 r2 = BN_CTX_get(ctx);

89 r3 = BN_CTX_get(ctx);

90

91 if (r3 == NULL)

92 goto err;

93 if (!rsa->e)

94 {

95 rsa->e = BN_dup(e);

96 if (!rsa->e)

97 goto err;

98 }

99 else

100 e = rsa->e;

101

102 /* If not all parameters present only calculate what we can.

103 * This allows test programs to output selective parameters.

104 */

105

106 if (Xp && !rsa->p)

107 {

108 rsa->p = BN_new();

109 if (!rsa->p)

110 goto err;

111

112 if (!BN_X931_derive_prime_ex(rsa->p, p1, p2,

113 Xp, Xp1, Xp2, e, ctx, cb))

114 goto err;

115 }

116

117 if (Xq && !rsa->q)

118 {

119 rsa->q = BN_new();

120 if (!rsa->q)

121 goto err;

122 if (!BN_X931_derive_prime_ex(rsa->q, q1, q2,

123 Xq, Xq1, Xq2, e, ctx, cb))

124 goto err;

125 }

126

127 if (!rsa->p \|\| !rsa->q)

128 {

129 BN_CTX_end(ctx);

130 BN_CTX_free(ctx);

131 return 2;

132 }

133

134 /* Since both primes are set we can now calculate all remaining

135 * components.

136 */

137

138 /* calculate n */

139 rsa->n=BN_new();

140 if (rsa->n == NULL)

141 goto err;

142 if (!BN_mul(rsa->n,rsa->p,rsa->q,ctx))

143 goto err;

144

145 /* calculate d */

146 if (!BN_sub(r1,rsa->p,BN_value_one()))

147 goto err; /* p-1 */

148 if (!BN_sub(r2,rsa->q,BN_value_one()))

149 goto err; /* q-1 */

150 if (!BN_mul(r0,r1,r2,ctx))

151 goto err; /* (p-1)(q-1) */

152

153 if (!BN_gcd(r3, r1, r2, ctx))

154 goto err;

155

156 if (!BN_div(r0, NULL, r0, r3, ctx))

157 goto err; /* LCM((p-1)(q-1)) */

158

159 ctx2 = BN_CTX_new();

160 if (!ctx2)

161 goto err;

162

163 rsa->d=BN_mod_inverse(NULL,rsa->e,r0,ctx2); /* d */

164 if (rsa->d == NULL)

165 goto err;

166

167 /* calculate d mod (p-1) */

168 rsa->dmp1=BN_new();

169 if (rsa->dmp1 == NULL)

170 goto err;

171 if (!BN_mod(rsa->dmp1,rsa->d,r1,ctx))

172 goto err;

173

174 /* calculate d mod (q-1) */

175 rsa->dmq1=BN_new();

176 if (rsa->dmq1 == NULL)

177 goto err;

178 if (!BN_mod(rsa->dmq1,rsa->d,r2,ctx))

179 goto err;

180

181 /* calculate inverse of q mod p */

182 rsa->iqmp=BN_mod_inverse(NULL,rsa->q,rsa->p,ctx2);

183

184 err:

185 if (ctx)

186 {

187 BN_CTX_end(ctx);

188 BN_CTX_free(ctx);

189 }

190 if (ctx2)

191 BN_CTX_free(ctx2);

192 /* If this is set all calls successful */

193 if (rsa && rsa->iqmp != NULL)

194 return 1;

195

196 return 0;

197

198 }

199

200 int RSA_X931_generate_key_ex(RSA rsa, int bits, const BIGNUM e, BN_GENCB *cb)

201 {

202 int ok = 0;

203 BIGNUM Xp = NULL, Xq = NULL;

204 BN_CTX *ctx = NULL;

205

206 ctx = BN_CTX_new();

207 if (!ctx)

208 goto error;

209

210 BN_CTX_start(ctx);

211 Xp = BN_CTX_get(ctx);

212 Xq = BN_CTX_get(ctx);

213 if (!BN_X931_generate_Xpq(Xp, Xq, bits, ctx))

214 goto error;

215

216 rsa->p = BN_new();

217 rsa->q = BN_new();

218 if (!rsa->p \|\| !rsa->q)

219 goto error;

220

221 /* Generate two primes from Xp, Xq */

222

223 if (!BN_X931_generate_prime_ex(rsa->p, NULL, NULL, NULL, NULL, Xp,

224 e, ctx, cb))

225 goto error;

226

227 if (!BN_X931_generate_prime_ex(rsa->q, NULL, NULL, NULL, NULL, Xq,

228 e, ctx, cb))

229 goto error;

230

231 /* Since rsa->p and rsa->q are valid this call will just derive

232 * remaining RSA components.

233 */

234

235 if (!RSA_X931_derive_ex(rsa, NULL, NULL, NULL, NULL,

236 NULL, NULL, NULL, NULL, NULL, NULL, e, cb))

237 goto error;

238

239 ok = 1;

240

241 error:

242 if (ctx)

243 {

244 BN_CTX_end(ctx);

245 BN_CTX_free(ctx);

246 }

247

248 if (ok)

249 return 1;

250

251 return 0;

252

253 }

254

255 #endif

OLD	NEW

« openssl.gyp ('K') | « openssl/crypto/rsa/rsa_test.c ('k') | openssl/crypto/s390xcap.c » ('j') | patches/x509_hash_name_algorithm_change.patch » ('J')