OpenCoverage

bn_x931p.c

Absolute File Name:/home/opencoverage/opencoverage/guest-scripts/openssl/src/crypto/bn/bn_x931p.c
Source codeSwitch to Preprocessed file
LineSourceCount
1/*-
2 * Copyright 2011-2018 The OpenSSL Project Authors. All Rights Reserved.-
3 *-
4 * Licensed under the OpenSSL license (the "License"). You may not use-
5 * this file except in compliance with the License. You can obtain a copy-
6 * in the file LICENSE in the source distribution or at-
7 * https://www.openssl.org/source/license.html-
8 */-
9-
10#include <stdio.h>-
11#include <openssl/bn.h>-
12#include "bn_lcl.h"-
13-
14/* X9.31 routines for prime derivation */-
15-
16/*-
17 * X9.31 prime derivation. This is used to generate the primes pi (p1, p2,-
18 * q1, q2) from a parameter Xpi by checking successive odd integers.-
19 */-
20-
21static int bn_x931_derive_pi(BIGNUM *pi, const BIGNUM *Xpi, BN_CTX *ctx,-
22 BN_GENCB *cb)-
23{-
24 int i = 0, is_prime;-
25 if (!BN_copy(pi, Xpi))
!BN_copy(pi, Xpi)Description
TRUEnever evaluated
FALSEnever evaluated
0
26 return 0;
never executed: return 0;
0
27 if (!BN_is_odd(pi) && !BN_add_word(pi, 1))
!BN_is_odd(pi)Description
TRUEnever evaluated
FALSEnever evaluated
!BN_add_word(pi, 1)Description
TRUEnever evaluated
FALSEnever evaluated
0
28 return 0;
never executed: return 0;
0
29 for (;;) {-
30 i++;-
31 BN_GENCB_call(cb, 0, i);-
32 /* NB 27 MR is specified in X9.31 */-
33 is_prime = BN_is_prime_fasttest_ex(pi, 27, ctx, 1, cb);-
34 if (is_prime < 0)
is_prime < 0Description
TRUEnever evaluated
FALSEnever evaluated
0
35 return 0;
never executed: return 0;
0
36 if (is_prime)
is_primeDescription
TRUEnever evaluated
FALSEnever evaluated
0
37 break;
never executed: break;
0
38 if (!BN_add_word(pi, 2))
!BN_add_word(pi, 2)Description
TRUEnever evaluated
FALSEnever evaluated
0
39 return 0;
never executed: return 0;
0
40 }
never executed: end of block
0
41 BN_GENCB_call(cb, 2, i);-
42 return 1;
never executed: return 1;
0
43}-
44-
45/*-
46 * This is the main X9.31 prime derivation function. From parameters Xp1, Xp2-
47 * and Xp derive the prime p. If the parameters p1 or p2 are not NULL they-
48 * will be returned too: this is needed for testing.-
49 */-
50-
51int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,-
52 const BIGNUM *Xp, const BIGNUM *Xp1,-
53 const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,-
54 BN_GENCB *cb)-
55{-
56 int ret = 0;-
57-
58 BIGNUM *t, *p1p2, *pm1;-
59-
60 /* Only even e supported */-
61 if (!BN_is_odd(e))
!BN_is_odd(e)Description
TRUEnever evaluated
FALSEnever evaluated
0
62 return 0;
never executed: return 0;
0
63-
64 BN_CTX_start(ctx);-
65 if (p1 == NULL)
p1 == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
66 p1 = BN_CTX_get(ctx);
never executed: p1 = BN_CTX_get(ctx);
0
67-
68 if (p2 == NULL)
p2 == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
69 p2 = BN_CTX_get(ctx);
never executed: p2 = BN_CTX_get(ctx);
0
70-
71 t = BN_CTX_get(ctx);-
72-
73 p1p2 = BN_CTX_get(ctx);-
74-
75 pm1 = BN_CTX_get(ctx);-
76-
77 if (pm1 == NULL)
pm1 == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
78 goto err;
never executed: goto err;
0
79-
80 if (!bn_x931_derive_pi(p1, Xp1, ctx, cb))
!bn_x931_deriv... Xp1, ctx, cb)Description
TRUEnever evaluated
FALSEnever evaluated
0
81 goto err;
never executed: goto err;
0
82-
83 if (!bn_x931_derive_pi(p2, Xp2, ctx, cb))
!bn_x931_deriv... Xp2, ctx, cb)Description
TRUEnever evaluated
FALSEnever evaluated
0
84 goto err;
never executed: goto err;
0
85-
86 if (!BN_mul(p1p2, p1, p2, ctx))
!BN_mul(p1p2, p1, p2, ctx)Description
TRUEnever evaluated
FALSEnever evaluated
0
87 goto err;
never executed: goto err;
0
88-
89 /* First set p to value of Rp */-
90-
91 if (!BN_mod_inverse(p, p2, p1, ctx))
!BN_mod_invers..., p2, p1, ctx)Description
TRUEnever evaluated
FALSEnever evaluated
0
92 goto err;
never executed: goto err;
0
93-
94 if (!BN_mul(p, p, p2, ctx))
!BN_mul(p, p, p2, ctx)Description
TRUEnever evaluated
FALSEnever evaluated
0
95 goto err;
never executed: goto err;
0
96-
97 if (!BN_mod_inverse(t, p1, p2, ctx))
!BN_mod_invers..., p1, p2, ctx)Description
TRUEnever evaluated
FALSEnever evaluated
0
98 goto err;
never executed: goto err;
0
99-
100 if (!BN_mul(t, t, p1, ctx))
!BN_mul(t, t, p1, ctx)Description
TRUEnever evaluated
FALSEnever evaluated
0
101 goto err;
never executed: goto err;
0
102-
103 if (!BN_sub(p, p, t))
!BN_sub(p, p, t)Description
TRUEnever evaluated
FALSEnever evaluated
0
104 goto err;
never executed: goto err;
0
105-
106 if (p->neg && !BN_add(p, p, p1p2))
p->negDescription
TRUEnever evaluated
FALSEnever evaluated
!BN_add(p, p, p1p2)Description
TRUEnever evaluated
FALSEnever evaluated
0
107 goto err;
never executed: goto err;
0
108-
109 /* p now equals Rp */-
110-
111 if (!BN_mod_sub(p, p, Xp, p1p2, ctx))
!BN_mod_sub(p,...Xp, p1p2, ctx)Description
TRUEnever evaluated
FALSEnever evaluated
0
112 goto err;
never executed: goto err;
0
113-
114 if (!BN_add(p, p, Xp))
!BN_add(p, p, Xp)Description
TRUEnever evaluated
FALSEnever evaluated
0
115 goto err;
never executed: goto err;
0
116-
117 /* p now equals Yp0 */-
118-
119 for (;;) {-
120 int i = 1;-
121 BN_GENCB_call(cb, 0, i++);-
122 if (!BN_copy(pm1, p))
!BN_copy(pm1, p)Description
TRUEnever evaluated
FALSEnever evaluated
0
123 goto err;
never executed: goto err;
0
124 if (!BN_sub_word(pm1, 1))
!BN_sub_word(pm1, 1)Description
TRUEnever evaluated
FALSEnever evaluated
0
125 goto err;
never executed: goto err;
0
126 if (!BN_gcd(t, pm1, e, ctx))
!BN_gcd(t, pm1, e, ctx)Description
TRUEnever evaluated
FALSEnever evaluated
0
127 goto err;
never executed: goto err;
0
128 if (BN_is_one(t)) {
BN_is_one(t)Description
TRUEnever evaluated
FALSEnever evaluated
0
129 /*-
130 * X9.31 specifies 8 MR and 1 Lucas test or any prime test-
131 * offering similar or better guarantees 50 MR is considerably-
132 * better.-
133 */-
134 int r = BN_is_prime_fasttest_ex(p, 50, ctx, 1, cb);-
135 if (r < 0)
r < 0Description
TRUEnever evaluated
FALSEnever evaluated
0
136 goto err;
never executed: goto err;
0
137 if (r)
rDescription
TRUEnever evaluated
FALSEnever evaluated
0
138 break;
never executed: break;
0
139 }
never executed: end of block
0
140 if (!BN_add(p, p, p1p2))
!BN_add(p, p, p1p2)Description
TRUEnever evaluated
FALSEnever evaluated
0
141 goto err;
never executed: goto err;
0
142 }
never executed: end of block
0
143-
144 BN_GENCB_call(cb, 3, 0);-
145-
146 ret = 1;-
147-
148 err:
code before this statement never executed: err:
0
149-
150 BN_CTX_end(ctx);-
151-
152 return ret;
never executed: return ret;
0
153}-
154-
155/*-
156 * Generate pair of parameters Xp, Xq for X9.31 prime generation. Note: nbits-
157 * parameter is sum of number of bits in both.-
158 */-
159-
160int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx)-
161{-
162 BIGNUM *t;-
163 int i;-
164 /*-
165 * Number of bits for each prime is of the form 512+128s for s = 0, 1,-
166 * ...-
167 */-
168 if ((nbits < 1024) || (nbits & 0xff))
(nbits < 1024)Description
TRUEnever evaluated
FALSEnever evaluated
(nbits & 0xff)Description
TRUEnever evaluated
FALSEnever evaluated
0
169 return 0;
never executed: return 0;
0
170 nbits >>= 1;-
171 /*-
172 * The random value Xp must be between sqrt(2) * 2^(nbits-1) and 2^nbits-
173 * - 1. By setting the top two bits we ensure that the lower bound is-
174 * exceeded.-
175 */-
176 if (!BN_priv_rand(Xp, nbits, BN_RAND_TOP_TWO, BN_RAND_BOTTOM_ANY))
!BN_priv_rand(Xp, nbits, 1, 0)Description
TRUEnever evaluated
FALSEnever evaluated
0
177 goto err;
never executed: goto err;
0
178-
179 BN_CTX_start(ctx);-
180 t = BN_CTX_get(ctx);-
181 if (t == NULL)
t == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
182 goto err;
never executed: goto err;
0
183-
184 for (i = 0; i < 1000; i++) {
i < 1000Description
TRUEnever evaluated
FALSEnever evaluated
0
185 if (!BN_priv_rand(Xq, nbits, BN_RAND_TOP_TWO, BN_RAND_BOTTOM_ANY))
!BN_priv_rand(Xq, nbits, 1, 0)Description
TRUEnever evaluated
FALSEnever evaluated
0
186 goto err;
never executed: goto err;
0
187-
188 /* Check that |Xp - Xq| > 2^(nbits - 100) */-
189 if (!BN_sub(t, Xp, Xq))
!BN_sub(t, Xp, Xq)Description
TRUEnever evaluated
FALSEnever evaluated
0
190 goto err;
never executed: goto err;
0
191 if (BN_num_bits(t) > (nbits - 100))
BN_num_bits(t) > (nbits - 100)Description
TRUEnever evaluated
FALSEnever evaluated
0
192 break;
never executed: break;
0
193 }
never executed: end of block
0
194-
195 BN_CTX_end(ctx);-
196-
197 if (i < 1000)
i < 1000Description
TRUEnever evaluated
FALSEnever evaluated
0
198 return 1;
never executed: return 1;
0
199-
200 return 0;
never executed: return 0;
0
201-
202 err:-
203 BN_CTX_end(ctx);-
204 return 0;
never executed: return 0;
0
205}-
206-
207/*-
208 * Generate primes using X9.31 algorithm. Of the values p, p1, p2, Xp1 and-
209 * Xp2 only 'p' needs to be non-NULL. If any of the others are not NULL the-
210 * relevant parameter will be stored in it. Due to the fact that |Xp - Xq| >-
211 * 2^(nbits - 100) must be satisfied Xp and Xq are generated using the-
212 * previous function and supplied as input.-
213 */-
214-
215int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,-
216 BIGNUM *Xp1, BIGNUM *Xp2,-
217 const BIGNUM *Xp,-
218 const BIGNUM *e, BN_CTX *ctx, BN_GENCB *cb)-
219{-
220 int ret = 0;-
221-
222 BN_CTX_start(ctx);-
223 if (Xp1 == NULL)
Xp1 == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
224 Xp1 = BN_CTX_get(ctx);
never executed: Xp1 = BN_CTX_get(ctx);
0
225 if (Xp2 == NULL)
Xp2 == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
226 Xp2 = BN_CTX_get(ctx);
never executed: Xp2 = BN_CTX_get(ctx);
0
227 if (Xp1 == NULL || Xp2 == NULL)
Xp1 == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
Xp2 == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
228 goto error;
never executed: goto error;
0
229-
230 if (!BN_priv_rand(Xp1, 101, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY))
!BN_priv_rand(Xp1, 101, 0, 0)Description
TRUEnever evaluated
FALSEnever evaluated
0
231 goto error;
never executed: goto error;
0
232 if (!BN_priv_rand(Xp2, 101, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY))
!BN_priv_rand(Xp2, 101, 0, 0)Description
TRUEnever evaluated
FALSEnever evaluated
0
233 goto error;
never executed: goto error;
0
234 if (!BN_X931_derive_prime_ex(p, p1, p2, Xp, Xp1, Xp2, e, ctx, cb))
!BN_X931_deriv...2, e, ctx, cb)Description
TRUEnever evaluated
FALSEnever evaluated
0
235 goto error;
never executed: goto error;
0
236-
237 ret = 1;-
238-
239 error:
code before this statement never executed: error:
0
240 BN_CTX_end(ctx);-
241-
242 return ret;
never executed: return ret;
0
243-
244}-
Source codeSwitch to Preprocessed file
Generated by Squish Coco 4.2.2