summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/dsa/dsa_ossl.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/dsa/dsa_ossl.c')
-rw-r--r--src/lib/libcrypto/dsa/dsa_ossl.c372
1 files changed, 0 insertions, 372 deletions
diff --git a/src/lib/libcrypto/dsa/dsa_ossl.c b/src/lib/libcrypto/dsa/dsa_ossl.c
deleted file mode 100644
index 5cbbdddfb9..0000000000
--- a/src/lib/libcrypto/dsa/dsa_ossl.c
+++ /dev/null
@@ -1,372 +0,0 @@
1/* crypto/dsa/dsa_ossl.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/* Original version from Steven Schoch <schoch@sheba.arc.nasa.gov> */
60
61#include <stdio.h>
62#include "cryptlib.h"
63#include <openssl/bn.h>
64#include <openssl/dsa.h>
65#include <openssl/rand.h>
66#include <openssl/asn1.h>
67#include <openssl/engine.h>
68
69int __BN_rand_range(BIGNUM *r, BIGNUM *range);
70
71static DSA_SIG *dsa_do_sign(const unsigned char *dgst, int dlen, DSA *dsa);
72static int dsa_sign_setup(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp, BIGNUM **rp);
73static int dsa_do_verify(const unsigned char *dgst, int dgst_len, DSA_SIG *sig,
74 DSA *dsa);
75static int dsa_init(DSA *dsa);
76static int dsa_finish(DSA *dsa);
77static int dsa_mod_exp(DSA *dsa, BIGNUM *rr, BIGNUM *a1, BIGNUM *p1,
78 BIGNUM *a2, BIGNUM *p2, BIGNUM *m, BN_CTX *ctx,
79 BN_MONT_CTX *in_mont);
80static int dsa_bn_mod_exp(DSA *dsa, BIGNUM *r, BIGNUM *a, const BIGNUM *p,
81 const BIGNUM *m, BN_CTX *ctx,
82 BN_MONT_CTX *m_ctx);
83
84static DSA_METHOD openssl_dsa_meth = {
85"OpenSSL DSA method",
86dsa_do_sign,
87dsa_sign_setup,
88dsa_do_verify,
89dsa_mod_exp,
90dsa_bn_mod_exp,
91dsa_init,
92dsa_finish,
930,
94NULL
95};
96
97DSA_METHOD *DSA_OpenSSL(void)
98{
99 return &openssl_dsa_meth;
100}
101
102static DSA_SIG *dsa_do_sign(const unsigned char *dgst, int dlen, DSA *dsa)
103 {
104 BIGNUM *kinv=NULL,*r=NULL,*s=NULL;
105 BIGNUM m;
106 BIGNUM xr;
107 BN_CTX *ctx=NULL;
108 int i,reason=ERR_R_BN_LIB;
109 DSA_SIG *ret=NULL;
110
111 BN_init(&m);
112 BN_init(&xr);
113 s=BN_new();
114 if (s == NULL) goto err;
115
116 i=BN_num_bytes(dsa->q); /* should be 20 */
117 if ((dlen > i) || (dlen > 50))
118 {
119 reason=DSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE;
120 goto err;
121 }
122
123 ctx=BN_CTX_new();
124 if (ctx == NULL) goto err;
125
126 if ((dsa->kinv == NULL) || (dsa->r == NULL))
127 {
128 if (!DSA_sign_setup(dsa,ctx,&kinv,&r)) goto err;
129 }
130 else
131 {
132 kinv=dsa->kinv;
133 dsa->kinv=NULL;
134 r=dsa->r;
135 dsa->r=NULL;
136 }
137
138 if (BN_bin2bn(dgst,dlen,&m) == NULL) goto err;
139
140 /* Compute s = inv(k) (m + xr) mod q */
141 if (!BN_mod_mul(&xr,dsa->priv_key,r,dsa->q,ctx)) goto err;/* s = xr */
142 if (!BN_add(s, &xr, &m)) goto err; /* s = m + xr */
143 if (BN_cmp(s,dsa->q) > 0)
144 BN_sub(s,s,dsa->q);
145 if (!BN_mod_mul(s,s,kinv,dsa->q,ctx)) goto err;
146
147 ret=DSA_SIG_new();
148 if (ret == NULL) goto err;
149 ret->r = r;
150 ret->s = s;
151
152err:
153 if (!ret)
154 {
155 DSAerr(DSA_F_DSA_DO_SIGN,reason);
156 BN_free(r);
157 BN_free(s);
158 }
159 if (ctx != NULL) BN_CTX_free(ctx);
160 BN_clear_free(&m);
161 BN_clear_free(&xr);
162 if (kinv != NULL) /* dsa->kinv is NULL now if we used it */
163 BN_clear_free(kinv);
164 return(ret);
165 }
166
167static int dsa_sign_setup(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp, BIGNUM **rp)
168 {
169 BN_CTX *ctx;
170 BIGNUM k,*kinv=NULL,*r=NULL;
171 int ret=0;
172
173 if (ctx_in == NULL)
174 {
175 if ((ctx=BN_CTX_new()) == NULL) goto err;
176 }
177 else
178 ctx=ctx_in;
179
180 BN_init(&k);
181 if ((r=BN_new()) == NULL) goto err;
182 kinv=NULL;
183
184 /* Get random k */
185 do
186 if (!__BN_rand_range(&k, dsa->q)) goto err;
187 while (BN_is_zero(&k));
188
189 if ((dsa->method_mont_p == NULL) && (dsa->flags & DSA_FLAG_CACHE_MONT_P))
190 {
191 if ((dsa->method_mont_p=(char *)BN_MONT_CTX_new()) != NULL)
192 if (!BN_MONT_CTX_set((BN_MONT_CTX *)dsa->method_mont_p,
193 dsa->p,ctx)) goto err;
194 }
195
196 /* Compute r = (g^k mod p) mod q */
197 if (!ENGINE_get_DSA(dsa->engine)->bn_mod_exp(dsa, r,dsa->g,&k,dsa->p,ctx,
198 (BN_MONT_CTX *)dsa->method_mont_p)) goto err;
199 if (!BN_mod(r,r,dsa->q,ctx)) goto err;
200
201 /* Compute part of 's = inv(k) (m + xr) mod q' */
202 if ((kinv=BN_mod_inverse(NULL,&k,dsa->q,ctx)) == NULL) goto err;
203
204 if (*kinvp != NULL) BN_clear_free(*kinvp);
205 *kinvp=kinv;
206 kinv=NULL;
207 if (*rp != NULL) BN_clear_free(*rp);
208 *rp=r;
209 ret=1;
210err:
211 if (!ret)
212 {
213 DSAerr(DSA_F_DSA_SIGN_SETUP,ERR_R_BN_LIB);
214 if (kinv != NULL) BN_clear_free(kinv);
215 if (r != NULL) BN_clear_free(r);
216 }
217 if (ctx_in == NULL) BN_CTX_free(ctx);
218 if (kinv != NULL) BN_clear_free(kinv);
219 BN_clear_free(&k);
220 return(ret);
221 }
222
223static int dsa_do_verify(const unsigned char *dgst, int dgst_len, DSA_SIG *sig,
224 DSA *dsa)
225 {
226 BN_CTX *ctx;
227 BIGNUM u1,u2,t1;
228 BN_MONT_CTX *mont=NULL;
229 int ret = -1;
230
231 if ((ctx=BN_CTX_new()) == NULL) goto err;
232 BN_init(&u1);
233 BN_init(&u2);
234 BN_init(&t1);
235
236 /* Calculate W = inv(S) mod Q
237 * save W in u2 */
238 if ((BN_mod_inverse(&u2,sig->s,dsa->q,ctx)) == NULL) goto err;
239
240 /* save M in u1 */
241 if (BN_bin2bn(dgst,dgst_len,&u1) == NULL) goto err;
242
243 /* u1 = M * w mod q */
244 if (!BN_mod_mul(&u1,&u1,&u2,dsa->q,ctx)) goto err;
245
246 /* u2 = r * w mod q */
247 if (!BN_mod_mul(&u2,sig->r,&u2,dsa->q,ctx)) goto err;
248
249 if ((dsa->method_mont_p == NULL) && (dsa->flags & DSA_FLAG_CACHE_MONT_P))
250 {
251 if ((dsa->method_mont_p=(char *)BN_MONT_CTX_new()) != NULL)
252 if (!BN_MONT_CTX_set((BN_MONT_CTX *)dsa->method_mont_p,
253 dsa->p,ctx)) goto err;
254 }
255 mont=(BN_MONT_CTX *)dsa->method_mont_p;
256
257#if 0
258 {
259 BIGNUM t2;
260
261 BN_init(&t2);
262 /* v = ( g^u1 * y^u2 mod p ) mod q */
263 /* let t1 = g ^ u1 mod p */
264 if (!BN_mod_exp_mont(&t1,dsa->g,&u1,dsa->p,ctx,mont)) goto err;
265 /* let t2 = y ^ u2 mod p */
266 if (!BN_mod_exp_mont(&t2,dsa->pub_key,&u2,dsa->p,ctx,mont)) goto err;
267 /* let u1 = t1 * t2 mod p */
268 if (!BN_mod_mul(&u1,&t1,&t2,dsa->p,ctx)) goto err_bn;
269 BN_free(&t2);
270 }
271 /* let u1 = u1 mod q */
272 if (!BN_mod(&u1,&u1,dsa->q,ctx)) goto err;
273#else
274 {
275 if (!ENGINE_get_DSA(dsa->engine)->dsa_mod_exp(dsa, &t1,dsa->g,&u1,dsa->pub_key,&u2,
276 dsa->p,ctx,mont)) goto err;
277 /* BN_copy(&u1,&t1); */
278 /* let u1 = u1 mod q */
279 if (!BN_mod(&u1,&t1,dsa->q,ctx)) goto err;
280 }
281#endif
282 /* V is now in u1. If the signature is correct, it will be
283 * equal to R. */
284 ret=(BN_ucmp(&u1, sig->r) == 0);
285
286 err:
287 if (ret != 1) DSAerr(DSA_F_DSA_DO_VERIFY,ERR_R_BN_LIB);
288 if (ctx != NULL) BN_CTX_free(ctx);
289 BN_free(&u1);
290 BN_free(&u2);
291 BN_free(&t1);
292 return(ret);
293 }
294
295static int dsa_init(DSA *dsa)
296{
297 dsa->flags|=DSA_FLAG_CACHE_MONT_P;
298 return(1);
299}
300
301static int dsa_finish(DSA *dsa)
302{
303 if(dsa->method_mont_p)
304 BN_MONT_CTX_free((BN_MONT_CTX *)dsa->method_mont_p);
305 return(1);
306}
307
308static int dsa_mod_exp(DSA *dsa, BIGNUM *rr, BIGNUM *a1, BIGNUM *p1,
309 BIGNUM *a2, BIGNUM *p2, BIGNUM *m, BN_CTX *ctx,
310 BN_MONT_CTX *in_mont)
311{
312 return BN_mod_exp2_mont(rr, a1, p1, a2, p2, m, ctx, in_mont);
313}
314
315static int dsa_bn_mod_exp(DSA *dsa, BIGNUM *r, BIGNUM *a, const BIGNUM *p,
316 const BIGNUM *m, BN_CTX *ctx,
317 BN_MONT_CTX *m_ctx)
318{
319 return BN_mod_exp_mont(r, a, p, m, ctx, m_ctx);
320}
321
322
323/* random number r: 0 <= r < range */
324int __BN_rand_range(BIGNUM *r, BIGNUM *range)
325 {
326 int n;
327
328 if (range->neg || BN_is_zero(range))
329 {
330 /* BNerr(BN_F_BN_RAND_RANGE, BN_R_INVALID_RANGE); */
331 return 0;
332 }
333
334 n = BN_num_bits(range); /* n > 0 */
335
336 if (n == 1)
337 {
338 if (!BN_zero(r)) return 0;
339 }
340 else if (BN_is_bit_set(range, n - 2))
341 {
342 do
343 {
344 /* range = 11..._2, so each iteration succeeds with probability >= .75 */
345 if (!BN_rand(r, n, -1, 0)) return 0;
346 }
347 while (BN_cmp(r, range) >= 0);
348 }
349 else
350 {
351 /* range = 10..._2,
352 * so 3*range (= 11..._2) is exactly one bit longer than range */
353 do
354 {
355 if (!BN_rand(r, n + 1, -1, 0)) return 0;
356 /* If r < 3*range, use r := r MOD range
357 * (which is either r, r - range, or r - 2*range).
358 * Otherwise, iterate once more.
359 * Since 3*range = 11..._2, each iteration succeeds with
360 * probability >= .75. */
361 if (BN_cmp(r ,range) >= 0)
362 {
363 if (!BN_sub(r, r, range)) return 0;
364 if (BN_cmp(r, range) >= 0)
365 if (!BN_sub(r, r, range)) return 0;
366 }
367 }
368 while (BN_cmp(r, range) >= 0);
369 }
370
371 return 1;
372 }
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-12-25 00:25:13 +0000