rsa_x931g.c revision 296465 
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
70int RSA_X931_derive_ex(RSA *rsa, BIGNUM *p1, BIGNUM *p2, BIGNUM *q1,
71                       BIGNUM *q2, const BIGNUM *Xp1, const BIGNUM *Xp2,
72                       const BIGNUM *Xp, const BIGNUM *Xq1, const BIGNUM *Xq2,
73                       const BIGNUM *Xq, 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        rsa->e = BN_dup(e);
95        if (!rsa->e)
96            goto err;
97    } else
98        e = rsa->e;
99
100    /*
101     * If not all parameters present only calculate what we can. This allows
102     * test programs to output selective parameters.
103     */
104
105    if (Xp && !rsa->p) {
106        rsa->p = BN_new();
107        if (!rsa->p)
108            goto err;
109
110        if (!BN_X931_derive_prime_ex(rsa->p, p1, p2,
111                                     Xp, Xp1, Xp2, e, ctx, cb))
112            goto err;
113    }
114
115    if (Xq && !rsa->q) {
116        rsa->q = BN_new();
117        if (!rsa->q)
118            goto err;
119        if (!BN_X931_derive_prime_ex(rsa->q, q1, q2,
120                                     Xq, Xq1, Xq2, e, ctx, cb))
121            goto err;
122    }
123
124    if (!rsa->p || !rsa->q) {
125        BN_CTX_end(ctx);
126        BN_CTX_free(ctx);
127        return 2;
128    }
129
130    /*
131     * Since both primes are set we can now calculate all remaining
132     * components.
133     */
134
135    /* calculate n */
136    rsa->n = BN_new();
137    if (rsa->n == NULL)
138        goto err;
139    if (!BN_mul(rsa->n, rsa->p, rsa->q, ctx))
140        goto err;
141
142    /* calculate d */
143    if (!BN_sub(r1, rsa->p, BN_value_one()))
144        goto err;               /* p-1 */
145    if (!BN_sub(r2, rsa->q, BN_value_one()))
146        goto err;               /* q-1 */
147    if (!BN_mul(r0, r1, r2, ctx))
148        goto err;               /* (p-1)(q-1) */
149
150    if (!BN_gcd(r3, r1, r2, ctx))
151        goto err;
152
153    if (!BN_div(r0, NULL, r0, r3, ctx))
154        goto err;               /* LCM((p-1)(q-1)) */
155
156    ctx2 = BN_CTX_new();
157    if (!ctx2)
158        goto err;
159
160    rsa->d = BN_mod_inverse(NULL, rsa->e, r0, ctx2); /* d */
161    if (rsa->d == NULL)
162        goto err;
163
164    /* calculate d mod (p-1) */
165    rsa->dmp1 = BN_new();
166    if (rsa->dmp1 == NULL)
167        goto err;
168    if (!BN_mod(rsa->dmp1, rsa->d, r1, ctx))
169        goto err;
170
171    /* calculate d mod (q-1) */
172    rsa->dmq1 = BN_new();
173    if (rsa->dmq1 == NULL)
174        goto err;
175    if (!BN_mod(rsa->dmq1, rsa->d, r2, ctx))
176        goto err;
177
178    /* calculate inverse of q mod p */
179    rsa->iqmp = BN_mod_inverse(NULL, rsa->q, rsa->p, ctx2);
180
181 err:
182    if (ctx) {
183        BN_CTX_end(ctx);
184        BN_CTX_free(ctx);
185    }
186    if (ctx2)
187        BN_CTX_free(ctx2);
188    /* If this is set all calls successful */
189    if (rsa && rsa->iqmp != NULL)
190        return 1;
191
192    return 0;
193
194}
195
196int RSA_X931_generate_key_ex(RSA *rsa, int bits, const BIGNUM *e,
197                             BN_GENCB *cb)
198{
199    int ok = 0;
200    BIGNUM *Xp = NULL, *Xq = NULL;
201    BN_CTX *ctx = NULL;
202
203    ctx = BN_CTX_new();
204    if (!ctx)
205        goto error;
206
207    BN_CTX_start(ctx);
208    Xp = BN_CTX_get(ctx);
209    Xq = BN_CTX_get(ctx);
210    if (!BN_X931_generate_Xpq(Xp, Xq, bits, ctx))
211        goto error;
212
213    rsa->p = BN_new();
214    rsa->q = BN_new();
215    if (!rsa->p || !rsa->q)
216        goto error;
217
218    /* Generate two primes from Xp, Xq */
219
220    if (!BN_X931_generate_prime_ex(rsa->p, NULL, NULL, NULL, NULL, Xp,
221                                   e, ctx, cb))
222        goto error;
223
224    if (!BN_X931_generate_prime_ex(rsa->q, NULL, NULL, NULL, NULL, Xq,
225                                   e, ctx, cb))
226        goto error;
227
228    /*
229     * Since rsa->p and rsa->q are valid this call will just derive remaining
230     * RSA components.
231     */
232
233    if (!RSA_X931_derive_ex(rsa, NULL, NULL, NULL, NULL,
234                            NULL, NULL, NULL, NULL, NULL, NULL, e, cb))
235        goto error;
236
237    ok = 1;
238
239 error:
240    if (ctx) {
241        BN_CTX_end(ctx);
242        BN_CTX_free(ctx);
243    }
244
245    if (ok)
246        return 1;
247
248    return 0;
249
250}
251
252#endif
253