Debian Codegraph @

Cryptlib/OpenSSL/crypto/bn/bn_prime.c

raw
1 /* crypto/bn/bn_prime.c */
2 /* Copyright (C) 1995-1998 Eric Young ([email protected])
3 * All rights reserved.
4 *
5 * This package is an SSL implementation written
6 * by Eric Young ([email protected]).
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 ([email protected]).
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 ([email protected])"
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 ([email protected])"
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 * Copyright (c) 1998-2001 The OpenSSL Project. All rights reserved.
60 *
61 * Redistribution and use in source and binary forms, with or without
62 * modification, are permitted provided that the following conditions
63 * are met:
64 *
65 * 1. Redistributions of source code must retain the above copyright
66 * notice, this list of conditions and the following disclaimer.
67 *
68 * 2. Redistributions in binary form must reproduce the above copyright
69 * notice, this list of conditions and the following disclaimer in
70 * the documentation and/or other materials provided with the
71 * distribution.
72 *
73 * 3. All advertising materials mentioning features or use of this
74 * software must display the following acknowledgment:
75 * "This product includes software developed by the OpenSSL Project
76 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
77 *
78 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
79 * endorse or promote products derived from this software without
80 * prior written permission. For written permission, please contact
81 * [email protected].
82 *
83 * 5. Products derived from this software may not be called "OpenSSL"
84 * nor may "OpenSSL" appear in their names without prior written
85 * permission of the OpenSSL Project.
86 *
87 * 6. Redistributions of any form whatsoever must retain the following
88 * acknowledgment:
89 * "This product includes software developed by the OpenSSL Project
90 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
91 *
92 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
93 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
94 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
95 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
96 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
97 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
98 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
99 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
100 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
101 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
102 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
103 * OF THE POSSIBILITY OF SUCH DAMAGE.
104 * ====================================================================
105 *
106 * This product includes cryptographic software written by Eric Young
107 * ([email protected]). This product includes software written by Tim
108 * Hudson ([email protected]).
109 *
110 */
111
112 #include <stdio.h>
113 #include <time.h>
114 #include "cryptlib.h"
115 #include "bn_lcl.h"
116 #include <openssl/rand.h>
117
118 /*
119 * NB: these functions have been "upgraded", the deprecated versions (which
120 * are compatibility wrappers using these functions) are in bn_depr.c. -
121 * Geoff
122 */
123
124 /*
125 * The quick sieve algorithm approach to weeding out primes is Philip
126 * Zimmermann's, as implemented in PGP. I have had a read of his comments
127 * and implemented my own version.
128 */
129 #include "bn_prime.h"
130
131 static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
132 const BIGNUM *a1_odd, int k, BN_CTX *ctx,
133 BN_MONT_CTX *mont);
134 static int probable_prime(BIGNUM *rnd, int bits, prime_t *mods);
135 static int probable_prime_dh(BIGNUM *rnd, int bits,
136 const BIGNUM *add, const BIGNUM *rem,
137 BN_CTX *ctx);
138 static int probable_prime_dh_safe(BIGNUM *rnd, int bits, const BIGNUM *add,
139 const BIGNUM *rem, BN_CTX *ctx);
140
141 int BN_GENCB_call(BN_GENCB *cb, int a, int b)
142 {
143 /* No callback means continue */
144 if (!cb)
145 return 1;
146 switch (cb->ver) {
147 case 1:
148 /* Deprecated-style callbacks */
149 if (!cb->cb.cb_1)
150 return 1;
151 cb->cb.cb_1(a, b, cb->arg);
152 return 1;
153 case 2:
154 /* New-style callbacks */
155 return cb->cb.cb_2(a, b, cb);
156 default:
157 break;
158 }
159 /* Unrecognised callback type */
160 return 0;
161 }
162
163 int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
164 const BIGNUM *add, const BIGNUM *rem, BN_GENCB *cb)
165 {
166 BIGNUM *t;
167 int found = 0;
168 int i, j, c1 = 0;
169 BN_CTX *ctx = NULL;
170 prime_t *mods = NULL;
171 int checks = BN_prime_checks_for_size(bits);
172
173 mods = OPENSSL_malloc(sizeof(*mods) * NUMPRIMES);
174 if (mods == NULL)
175 goto err;
176 ctx = BN_CTX_new();
177 if (ctx == NULL)
178 goto err;
179 BN_CTX_start(ctx);
180 t = BN_CTX_get(ctx);
181 if (!t)
182 goto err;
183 loop:
184 /* make a random number and set the top and bottom bits */
185 if (add == NULL) {
186 if (!probable_prime(ret, bits, mods))
187 goto err;
188 } else {
189 if (safe) {
190 if (!probable_prime_dh_safe(ret, bits, add, rem, ctx))
191 goto err;
192 } else {
193 if (!probable_prime_dh(ret, bits, add, rem, ctx))
194 goto err;
195 }
196 }
197 /* if (BN_mod_word(ret,(BN_ULONG)3) == 1) goto loop; */
198 if (!BN_GENCB_call(cb, 0, c1++))
199 /* aborted */
200 goto err;
201
202 if (!safe) {
203 i = BN_is_prime_fasttest_ex(ret, checks, ctx, 0, cb);
204 if (i == -1)
205 goto err;
206 if (i == 0)
207 goto loop;
208 } else {
209 /*
210 * for "safe prime" generation, check that (p-1)/2 is prime. Since a
211 * prime is odd, We just need to divide by 2
212 */
213 if (!BN_rshift1(t, ret))
214 goto err;
215
216 for (i = 0; i < checks; i++) {
217 j = BN_is_prime_fasttest_ex(ret, 1, ctx, 0, cb);
218 if (j == -1)
219 goto err;
220 if (j == 0)
221 goto loop;
222
223 j = BN_is_prime_fasttest_ex(t, 1, ctx, 0, cb);
224 if (j == -1)
225 goto err;
226 if (j == 0)
227 goto loop;
228
229 if (!BN_GENCB_call(cb, 2, c1 - 1))
230 goto err;
231 /* We have a safe prime test pass */
232 }
233 }
234 /* we have a prime :-) */
235 found = 1;
236 err:
237 OPENSSL_free(mods);
238 if (ctx != NULL) {
239 BN_CTX_end(ctx);
240 BN_CTX_free(ctx);
241 }
242 bn_check_top(ret);
243 return found;
244 }
245
246 int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
247 BN_GENCB *cb)
248 {
249 return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
250 }
251
252 int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
253 int do_trial_division, BN_GENCB *cb)
254 {
255 int i, j, ret = -1;
256 int k;
257 BN_CTX *ctx = NULL;
258 BIGNUM *A1, *A1_odd, *check; /* taken from ctx */
259 BN_MONT_CTX *mont = NULL;
260 const BIGNUM *A = NULL;
261
262 if (BN_cmp(a, BN_value_one()) <= 0)
263 return 0;
264
265 if (checks == BN_prime_checks)
266 checks = BN_prime_checks_for_size(BN_num_bits(a));
267
268 /* first look for small factors */
269 if (!BN_is_odd(a))
270 /* a is even => a is prime if and only if a == 2 */
271 return BN_is_word(a, 2);
272 if (do_trial_division) {
273 for (i = 1; i < NUMPRIMES; i++)
274 if (BN_mod_word(a, primes[i]) == 0)
275 return 0;
276 if (!BN_GENCB_call(cb, 1, -1))
277 goto err;
278 }
279
280 if (ctx_passed != NULL)
281 ctx = ctx_passed;
282 else if ((ctx = BN_CTX_new()) == NULL)
283 goto err;
284 BN_CTX_start(ctx);
285
286 /* A := abs(a) */
287 if (a->neg) {
288 BIGNUM *t;
289 if ((t = BN_CTX_get(ctx)) == NULL)
290 goto err;
291 if (BN_copy(t, a) == NULL)
292 goto err;
293 t->neg = 0;
294 A = t;
295 } else
296 A = a;
297 A1 = BN_CTX_get(ctx);
298 A1_odd = BN_CTX_get(ctx);
299 check = BN_CTX_get(ctx);
300 if (check == NULL)
301 goto err;
302
303 /* compute A1 := A - 1 */
304 if (!BN_copy(A1, A))
305 goto err;
306 if (!BN_sub_word(A1, 1))
307 goto err;
308 if (BN_is_zero(A1)) {
309 ret = 0;
310 goto err;
311 }
312
313 /* write A1 as A1_odd * 2^k */
314 k = 1;
315 while (!BN_is_bit_set(A1, k))
316 k++;
317 if (!BN_rshift(A1_odd, A1, k))
318 goto err;
319
320 /* Montgomery setup for computations mod A */
321 mont = BN_MONT_CTX_new();
322 if (mont == NULL)
323 goto err;
324 if (!BN_MONT_CTX_set(mont, A, ctx))
325 goto err;
326
327 for (i = 0; i < checks; i++) {
328 if (!BN_pseudo_rand_range(check, A1))
329 goto err;
330 if (!BN_add_word(check, 1))
331 goto err;
332 /* now 1 <= check < A */
333
334 j = witness(check, A, A1, A1_odd, k, ctx, mont);
335 if (j == -1)
336 goto err;
337 if (j) {
338 ret = 0;
339 goto err;
340 }
341 if (!BN_GENCB_call(cb, 1, i))
342 goto err;
343 }
344 ret = 1;
345 err:
346 if (ctx != NULL) {
347 BN_CTX_end(ctx);
348 if (ctx_passed == NULL)
349 BN_CTX_free(ctx);
350 }
351 if (mont != NULL)
352 BN_MONT_CTX_free(mont);
353
354 return (ret);
355 }
356
357 static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
358 const BIGNUM *a1_odd, int k, BN_CTX *ctx,
359 BN_MONT_CTX *mont)
360 {
361 if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
362 return -1;
363 if (BN_is_one(w))
364 return 0; /* probably prime */
365 if (BN_cmp(w, a1) == 0)
366 return 0; /* w == -1 (mod a), 'a' is probably prime */
367 while (--k) {
368 if (!BN_mod_mul(w, w, w, a, ctx)) /* w := w^2 mod a */
369 return -1;
370 if (BN_is_one(w))
371 return 1; /* 'a' is composite, otherwise a previous 'w'
372 * would have been == -1 (mod 'a') */
373 if (BN_cmp(w, a1) == 0)
374 return 0; /* w == -1 (mod a), 'a' is probably prime */
375 }
376 /*
377 * If we get here, 'w' is the (a-1)/2-th power of the original 'w', and
378 * it is neither -1 nor +1 -- so 'a' cannot be prime
379 */
380 bn_check_top(w);
381 return 1;
382 }
383
384 static int probable_prime(BIGNUM *rnd, int bits, prime_t *mods)
385 {
386 int i;
387 BN_ULONG delta, maxdelta;
388
389 again:
390 if (!BN_rand(rnd, bits, 1, 1))
391 return (0);
392 /* we now have a random number 'rand' to test. */
393 for (i = 1; i < NUMPRIMES; i++)
394 mods[i] = (prime_t) BN_mod_word(rnd, (BN_ULONG)primes[i]);
395 maxdelta = BN_MASK2 - primes[NUMPRIMES - 1];
396 delta = 0;
397 loop:for (i = 1; i < NUMPRIMES; i++) {
398 /*
399 * check that rnd is not a prime and also that gcd(rnd-1,primes) == 1
400 * (except for 2)
401 */
402 if (((mods[i] + delta) % primes[i]) <= 1) {
403 delta += 2;
404 if (delta > maxdelta)
405 goto again;
406 goto loop;
407 }
408 }
409 if (!BN_add_word(rnd, delta))
410 return (0);
411 bn_check_top(rnd);
412 return (1);
413 }
414
415 static int probable_prime_dh(BIGNUM *rnd, int bits,
416 const BIGNUM *add, const BIGNUM *rem,
417 BN_CTX *ctx)
418 {
419 int i, ret = 0;
420 BIGNUM *t1;
421
422 BN_CTX_start(ctx);
423 if ((t1 = BN_CTX_get(ctx)) == NULL)
424 goto err;
425
426 if (!BN_rand(rnd, bits, 0, 1))
427 goto err;
428
429 /* we need ((rnd-rem) % add) == 0 */
430
431 if (!BN_mod(t1, rnd, add, ctx))
432 goto err;
433 if (!BN_sub(rnd, rnd, t1))
434 goto err;
435 if (rem == NULL) {
436 if (!BN_add_word(rnd, 1))
437 goto err;
438 } else {
439 if (!BN_add(rnd, rnd, rem))
440 goto err;
441 }
442
443 /* we now have a random number 'rand' to test. */
444
445 loop:for (i = 1; i < NUMPRIMES; i++) {
446 /* check that rnd is a prime */
447 if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) {
448 if (!BN_add(rnd, rnd, add))
449 goto err;
450 goto loop;
451 }
452 }
453 ret = 1;
454 err:
455 BN_CTX_end(ctx);
456 bn_check_top(rnd);
457 return (ret);
458 }
459
460 static int probable_prime_dh_safe(BIGNUM *p, int bits, const BIGNUM *padd,
461 const BIGNUM *rem, BN_CTX *ctx)
462 {
463 int i, ret = 0;
464 BIGNUM *t1, *qadd, *q;
465
466 bits--;
467 BN_CTX_start(ctx);
468 t1 = BN_CTX_get(ctx);
469 q = BN_CTX_get(ctx);
470 qadd = BN_CTX_get(ctx);
471 if (qadd == NULL)
472 goto err;
473
474 if (!BN_rshift1(qadd, padd))
475 goto err;
476
477 if (!BN_rand(q, bits, 0, 1))
478 goto err;
479
480 /* we need ((rnd-rem) % add) == 0 */
481 if (!BN_mod(t1, q, qadd, ctx))
482 goto err;
483 if (!BN_sub(q, q, t1))
484 goto err;
485 if (rem == NULL) {
486 if (!BN_add_word(q, 1))
487 goto err;
488 } else {
489 if (!BN_rshift1(t1, rem))
490 goto err;
491 if (!BN_add(q, q, t1))
492 goto err;
493 }
494
495 /* we now have a random number 'rand' to test. */
496 if (!BN_lshift1(p, q))
497 goto err;
498 if (!BN_add_word(p, 1))
499 goto err;
500
501 loop:for (i = 1; i < NUMPRIMES; i++) {
502 /* check that p and q are prime */
503 /*
504 * check that for p and q gcd(p-1,primes) == 1 (except for 2)
505 */
506 if ((BN_mod_word(p, (BN_ULONG)primes[i]) == 0) ||
507 (BN_mod_word(q, (BN_ULONG)primes[i]) == 0)) {
508 if (!BN_add(p, p, padd))
509 goto err;
510 if (!BN_add(q, q, qadd))
511 goto err;
512 goto loop;
513 }
514 }
515 ret = 1;
516 err:
517 BN_CTX_end(ctx);
518 bn_check_top(p);
519 return (ret);
520 }