]>
git.ipfire.org Git - thirdparty/openssl.git/blob - crypto/rsa/rsa_x931g.c
1 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
4 * This package is an SSL implementation written
5 * by Eric Young (eay@cryptsoft.com).
6 * The implementation was written so as to conform with Netscapes SSL.
8 * This library is free for commercial and non-commercial use as long as
9 * the following conditions are aheared to. The following conditions
10 * apply to all code found in this distribution, be it the RC4, RSA,
11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
12 * included with this distribution is covered by the same copyright terms
13 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed.
17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
19 * This can be in the form of a textual message at program startup or
20 * in documentation (online or textual) provided with the package.
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
25 * 1. Redistributions of source code must retain the copyright
26 * notice, this list of conditions and the following disclaimer.
27 * 2. Redistributions in binary form must reproduce the above copyright
28 * notice, this list of conditions and the following disclaimer in the
29 * documentation and/or other materials provided with the distribution.
30 * 3. All advertising materials mentioning features or use of this software
31 * must display the following acknowledgement:
32 * "This product includes cryptographic software written by
33 * Eric Young (eay@cryptsoft.com)"
34 * The word 'cryptographic' can be left out if the rouines from the library
35 * being used are not cryptographic related :-).
36 * 4. If you include any Windows specific code (or a derivative thereof) from
37 * the apps directory (application code) you must include an acknowledgement:
38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52 * The licence and distribution terms for any publically available version or
53 * derivative of this code cannot be changed. i.e. this code cannot simply be
54 * copied and put under another distribution licence
55 * [including the GNU Public Licence.]
61 #include <openssl/err.h>
62 #include <openssl/bn.h>
63 #include <openssl/rsa.h>
65 /* X9.31 RSA key derivation and generation */
67 int RSA_X931_derive_ex(RSA
*rsa
, BIGNUM
*p1
, BIGNUM
*p2
, BIGNUM
*q1
,
68 BIGNUM
*q2
, const BIGNUM
*Xp1
, const BIGNUM
*Xp2
,
69 const BIGNUM
*Xp
, const BIGNUM
*Xq1
, const BIGNUM
*Xq2
,
70 const BIGNUM
*Xq
, const BIGNUM
*e
, BN_GENCB
*cb
)
72 BIGNUM
*r0
= NULL
, *r1
= NULL
, *r2
= NULL
, *r3
= NULL
;
73 BN_CTX
*ctx
= NULL
, *ctx2
= NULL
;
99 * If not all parameters present only calculate what we can. This allows
100 * test programs to output selective parameters.
103 if (Xp
&& rsa
->p
== NULL
) {
108 if (!BN_X931_derive_prime_ex(rsa
->p
, p1
, p2
,
109 Xp
, Xp1
, Xp2
, e
, ctx
, cb
))
113 if (Xq
&& rsa
->q
== NULL
) {
117 if (!BN_X931_derive_prime_ex(rsa
->q
, q1
, q2
,
118 Xq
, Xq1
, Xq2
, e
, ctx
, cb
))
122 if (rsa
->p
== NULL
|| rsa
->q
== NULL
) {
129 * Since both primes are set we can now calculate all remaining
137 if (!BN_mul(rsa
->n
, rsa
->p
, rsa
->q
, ctx
))
141 if (!BN_sub(r1
, rsa
->p
, BN_value_one()))
143 if (!BN_sub(r2
, rsa
->q
, BN_value_one()))
145 if (!BN_mul(r0
, r1
, r2
, ctx
))
146 goto err
; /* (p-1)(q-1) */
148 if (!BN_gcd(r3
, r1
, r2
, ctx
))
151 if (!BN_div(r0
, NULL
, r0
, r3
, ctx
))
152 goto err
; /* LCM((p-1)(q-1)) */
158 rsa
->d
= BN_mod_inverse(NULL
, rsa
->e
, r0
, ctx2
); /* d */
162 /* calculate d mod (p-1) */
163 rsa
->dmp1
= BN_new();
164 if (rsa
->dmp1
== NULL
)
166 if (!BN_mod(rsa
->dmp1
, rsa
->d
, r1
, ctx
))
169 /* calculate d mod (q-1) */
170 rsa
->dmq1
= BN_new();
171 if (rsa
->dmq1
== NULL
)
173 if (!BN_mod(rsa
->dmq1
, rsa
->d
, r2
, ctx
))
176 /* calculate inverse of q mod p */
177 rsa
->iqmp
= BN_mod_inverse(NULL
, rsa
->q
, rsa
->p
, ctx2
);
190 int RSA_X931_generate_key_ex(RSA
*rsa
, int bits
, const BIGNUM
*e
,
194 BIGNUM
*Xp
= NULL
, *Xq
= NULL
;
202 Xp
= BN_CTX_get(ctx
);
203 Xq
= BN_CTX_get(ctx
);
204 if (!BN_X931_generate_Xpq(Xp
, Xq
, bits
, ctx
))
209 if (rsa
->p
== NULL
|| rsa
->q
== NULL
)
212 /* Generate two primes from Xp, Xq */
214 if (!BN_X931_generate_prime_ex(rsa
->p
, NULL
, NULL
, NULL
, NULL
, Xp
,
218 if (!BN_X931_generate_prime_ex(rsa
->q
, NULL
, NULL
, NULL
, NULL
, Xq
,
223 * Since rsa->p and rsa->q are valid this call will just derive remaining
227 if (!RSA_X931_derive_ex(rsa
, NULL
, NULL
, NULL
, NULL
,
228 NULL
, NULL
, NULL
, NULL
, NULL
, NULL
, e
, cb
))