GCC Code Coverage Report
Directory: ./ Exec Total Coverage
File: lib/libcrypto/crypto/../../libssl/src/crypto/bn/bn_x931p.c Lines: 0 106 0.0 %
Date: 2016-12-06 Branches: 0 100 0.0 %

Line Branch Exec Source
1
/* $OpenBSD: bn_x931p.c,v 1.8 2015/04/29 00:11:12 doug Exp $ */
2
/* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
3
 * project 2005.
4
 */
5
/* ====================================================================
6
 * Copyright (c) 2005 The OpenSSL Project.  All rights reserved.
7
 *
8
 * Redistribution and use in source and binary forms, with or without
9
 * modification, are permitted provided that the following conditions
10
 * are met:
11
 *
12
 * 1. Redistributions of source code must retain the above copyright
13
 *    notice, this list of conditions and the following disclaimer.
14
 *
15
 * 2. Redistributions in binary form must reproduce the above copyright
16
 *    notice, this list of conditions and the following disclaimer in
17
 *    the documentation and/or other materials provided with the
18
 *    distribution.
19
 *
20
 * 3. All advertising materials mentioning features or use of this
21
 *    software must display the following acknowledgment:
22
 *    "This product includes software developed by the OpenSSL Project
23
 *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
24
 *
25
 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26
 *    endorse or promote products derived from this software without
27
 *    prior written permission. For written permission, please contact
28
 *    licensing@OpenSSL.org.
29
 *
30
 * 5. Products derived from this software may not be called "OpenSSL"
31
 *    nor may "OpenSSL" appear in their names without prior written
32
 *    permission of the OpenSSL Project.
33
 *
34
 * 6. Redistributions of any form whatsoever must retain the following
35
 *    acknowledgment:
36
 *    "This product includes software developed by the OpenSSL Project
37
 *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
38
 *
39
 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40
 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
43
 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48
 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50
 * OF THE POSSIBILITY OF SUCH DAMAGE.
51
 * ====================================================================
52
 *
53
 * This product includes cryptographic software written by Eric Young
54
 * (eay@cryptsoft.com).  This product includes software written by Tim
55
 * Hudson (tjh@cryptsoft.com).
56
 *
57
 */
58
59
#include <stdio.h>
60
#include <openssl/bn.h>
61
62
/* X9.31 routines for prime derivation */
63
64
/* X9.31 prime derivation. This is used to generate the primes pi
65
 * (p1, p2, q1, q2) from a parameter Xpi by checking successive odd
66
 * integers.
67
 */
68
69
static int
70
bn_x931_derive_pi(BIGNUM *pi, const BIGNUM *Xpi, BN_CTX *ctx, BN_GENCB *cb)
71
{
72
	int i = 0;
73
74
	if (!BN_copy(pi, Xpi))
75
		return 0;
76
	if (!BN_is_odd(pi) && !BN_add_word(pi, 1))
77
		return 0;
78
	for (;;) {
79
		i++;
80
		BN_GENCB_call(cb, 0, i);
81
		/* NB 27 MR is specificed in X9.31 */
82
		if (BN_is_prime_fasttest_ex(pi, 27, ctx, 1, cb))
83
			break;
84
		if (!BN_add_word(pi, 2))
85
			return 0;
86
	}
87
	BN_GENCB_call(cb, 2, i);
88
	return 1;
89
}
90
91
/* This is the main X9.31 prime derivation function. From parameters
92
 * Xp1, Xp2 and Xp derive the prime p. If the parameters p1 or p2 are
93
 * not NULL they will be returned too: this is needed for testing.
94
 */
95
96
int
97
BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, const BIGNUM *Xp,
98
    const BIGNUM *Xp1, const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,
99
    BN_GENCB *cb)
100
{
101
	int ret = 0;
102
103
	BIGNUM *t, *p1p2, *pm1;
104
105
	/* Only even e supported */
106
	if (!BN_is_odd(e))
107
		return 0;
108
109
	BN_CTX_start(ctx);
110
	if (p1 == NULL) {
111
		if ((p1 = BN_CTX_get(ctx)) == NULL)
112
			goto err;
113
	}
114
	if (p2 == NULL) {
115
		if ((p2 = BN_CTX_get(ctx)) == NULL)
116
			goto err;
117
	}
118
119
	if ((t = BN_CTX_get(ctx)) == NULL)
120
		goto err;
121
	if ((p1p2 = BN_CTX_get(ctx)) == NULL)
122
		goto err;
123
	if ((pm1 = BN_CTX_get(ctx)) == NULL)
124
		goto err;
125
126
	if (!bn_x931_derive_pi(p1, Xp1, ctx, cb))
127
		goto err;
128
129
	if (!bn_x931_derive_pi(p2, Xp2, ctx, cb))
130
		goto err;
131
132
	if (!BN_mul(p1p2, p1, p2, ctx))
133
		goto err;
134
135
	/* First set p to value of Rp */
136
137
	if (!BN_mod_inverse(p, p2, p1, ctx))
138
		goto err;
139
140
	if (!BN_mul(p, p, p2, ctx))
141
		goto err;
142
143
	if (!BN_mod_inverse(t, p1, p2, ctx))
144
		goto err;
145
146
	if (!BN_mul(t, t, p1, ctx))
147
		goto err;
148
149
	if (!BN_sub(p, p, t))
150
		goto err;
151
152
	if (p->neg && !BN_add(p, p, p1p2))
153
		goto err;
154
155
	/* p now equals Rp */
156
157
	if (!BN_mod_sub(p, p, Xp, p1p2, ctx))
158
		goto err;
159
160
	if (!BN_add(p, p, Xp))
161
		goto err;
162
163
	/* p now equals Yp0 */
164
165
	for (;;) {
166
		int i = 1;
167
		BN_GENCB_call(cb, 0, i++);
168
		if (!BN_copy(pm1, p))
169
			goto err;
170
		if (!BN_sub_word(pm1, 1))
171
			goto err;
172
		if (!BN_gcd(t, pm1, e, ctx))
173
			goto err;
174
		if (BN_is_one(t)
175
		/* X9.31 specifies 8 MR and 1 Lucas test or any prime test
176
		 * offering similar or better guarantees 50 MR is considerably
177
		 * better.
178
		 */
179
		    && BN_is_prime_fasttest_ex(p, 50, ctx, 1, cb))
180
			break;
181
		if (!BN_add(p, p, p1p2))
182
			goto err;
183
	}
184
185
	BN_GENCB_call(cb, 3, 0);
186
187
	ret = 1;
188
189
err:
190
191
	BN_CTX_end(ctx);
192
193
	return ret;
194
}
195
196
/* Generate pair of paramters Xp, Xq for X9.31 prime generation.
197
 * Note: nbits paramter is sum of number of bits in both.
198
 */
199
200
int
201
BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx)
202
{
203
	BIGNUM *t;
204
	int i;
205
	int ret = 0;
206
207
	/* Number of bits for each prime is of the form
208
	 * 512+128s for s = 0, 1, ...
209
	 */
210
	if ((nbits < 1024) || (nbits & 0xff))
211
		return 0;
212
	nbits >>= 1;
213
	/* The random value Xp must be between sqrt(2) * 2^(nbits-1) and
214
	 * 2^nbits - 1. By setting the top two bits we ensure that the lower
215
	 * bound is exceeded.
216
	 */
217
	if (!BN_rand(Xp, nbits, 1, 0))
218
		return 0;
219
220
	BN_CTX_start(ctx);
221
	if ((t = BN_CTX_get(ctx)) == NULL)
222
		goto err;
223
224
	for (i = 0; i < 1000; i++) {
225
		if (!BN_rand(Xq, nbits, 1, 0))
226
			goto err;
227
		/* Check that |Xp - Xq| > 2^(nbits - 100) */
228
		BN_sub(t, Xp, Xq);
229
		if (BN_num_bits(t) > (nbits - 100))
230
			break;
231
	}
232
233
	if (i < 1000)
234
		ret = 1;
235
236
err:
237
	BN_CTX_end(ctx);
238
239
	return ret;
240
}
241
242
/* Generate primes using X9.31 algorithm. Of the values p, p1, p2, Xp1
243
 * and Xp2 only 'p' needs to be non-NULL. If any of the others are not NULL
244
 * the relevant parameter will be stored in it.
245
 *
246
 * Due to the fact that |Xp - Xq| > 2^(nbits - 100) must be satisfied Xp and Xq
247
 * are generated using the previous function and supplied as input.
248
 */
249
250
int
251
BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1,
252
    BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e, BN_CTX *ctx, BN_GENCB *cb)
253
{
254
	int ret = 0;
255
256
	BN_CTX_start(ctx);
257
	if (Xp1 == NULL) {
258
		if ((Xp1 = BN_CTX_get(ctx)) == NULL)
259
			goto error;
260
	}
261
	if (Xp2 == NULL) {
262
		if ((Xp2 = BN_CTX_get(ctx)) == NULL)
263
			goto error;
264
	}
265
266
	if (!BN_rand(Xp1, 101, 0, 0))
267
		goto error;
268
	if (!BN_rand(Xp2, 101, 0, 0))
269
		goto error;
270
	if (!BN_X931_derive_prime_ex(p, p1, p2, Xp, Xp1, Xp2, e, ctx, cb))
271
		goto error;
272
273
	ret = 1;
274
275
error:
276
	BN_CTX_end(ctx);
277
278
	return ret;
279
}