diff options
Diffstat (limited to 'src/lib/libssl/src/crypto/bn/bn_rand.c')
-rw-r--r-- | src/lib/libssl/src/crypto/bn/bn_rand.c | 216 |
1 files changed, 193 insertions, 23 deletions
diff --git a/src/lib/libssl/src/crypto/bn/bn_rand.c b/src/lib/libssl/src/crypto/bn/bn_rand.c index 75b6b0493b..9e08ccd22e 100644 --- a/src/lib/libssl/src/crypto/bn/bn_rand.c +++ b/src/lib/libssl/src/crypto/bn/bn_rand.c | |||
@@ -55,28 +55,83 @@ | |||
55 | * copied and put under another distribution licence | 55 | * copied and put under another distribution licence |
56 | * [including the GNU Public Licence.] | 56 | * [including the GNU Public Licence.] |
57 | */ | 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 | * openssl-core@openssl.org. | ||
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 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
108 | * Hudson (tjh@cryptsoft.com). | ||
109 | * | ||
110 | */ | ||
58 | 111 | ||
59 | #include <stdio.h> | 112 | #include <stdio.h> |
60 | #include <time.h> | 113 | #include <time.h> |
61 | #include "cryptlib.h" | 114 | #include "cryptlib.h" |
62 | #include "bn_lcl.h" | 115 | #include "bn_lcl.h" |
63 | #include "rand.h" | 116 | #include <openssl/rand.h> |
64 | 117 | ||
65 | int BN_rand(rnd, bits, top, bottom) | 118 | static int bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom) |
66 | BIGNUM *rnd; | ||
67 | int bits; | ||
68 | int top; | ||
69 | int bottom; | ||
70 | { | 119 | { |
71 | unsigned char *buf=NULL; | 120 | unsigned char *buf=NULL; |
72 | int ret=0,bit,bytes,mask; | 121 | int ret=0,bit,bytes,mask; |
73 | time_t tim; | 122 | time_t tim; |
74 | 123 | ||
124 | if (bits == 0) | ||
125 | { | ||
126 | BN_zero(rnd); | ||
127 | return 1; | ||
128 | } | ||
129 | |||
75 | bytes=(bits+7)/8; | 130 | bytes=(bits+7)/8; |
76 | bit=(bits-1)%8; | 131 | bit=(bits-1)%8; |
77 | mask=0xff<<bit; | 132 | mask=0xff<<(bit+1); |
78 | 133 | ||
79 | buf=(unsigned char *)Malloc(bytes); | 134 | buf=(unsigned char *)OPENSSL_malloc(bytes); |
80 | if (buf == NULL) | 135 | if (buf == NULL) |
81 | { | 136 | { |
82 | BNerr(BN_F_BN_RAND,ERR_R_MALLOC_FAILURE); | 137 | BNerr(BN_F_BN_RAND,ERR_R_MALLOC_FAILURE); |
@@ -85,28 +140,61 @@ int bottom; | |||
85 | 140 | ||
86 | /* make a random number and set the top and bottom bits */ | 141 | /* make a random number and set the top and bottom bits */ |
87 | time(&tim); | 142 | time(&tim); |
88 | RAND_seed((unsigned char *)&tim,sizeof(tim)); | 143 | RAND_add(&tim,sizeof(tim),0); |
89 | 144 | ||
90 | RAND_bytes(buf,(int)bytes); | 145 | if (pseudorand) |
91 | if (top) | ||
92 | { | 146 | { |
93 | if (bit == 0) | 147 | if (RAND_pseudo_bytes(buf, bytes) == -1) |
148 | goto err; | ||
149 | } | ||
150 | else | ||
151 | { | ||
152 | if (RAND_bytes(buf, bytes) <= 0) | ||
153 | goto err; | ||
154 | } | ||
155 | |||
156 | #if 1 | ||
157 | if (pseudorand == 2) | ||
158 | { | ||
159 | /* generate patterns that are more likely to trigger BN | ||
160 | library bugs */ | ||
161 | int i; | ||
162 | unsigned char c; | ||
163 | |||
164 | for (i = 0; i < bytes; i++) | ||
94 | { | 165 | { |
95 | buf[0]=1; | 166 | RAND_pseudo_bytes(&c, 1); |
96 | buf[1]|=0x80; | 167 | if (c >= 128 && i > 0) |
168 | buf[i] = buf[i-1]; | ||
169 | else if (c < 42) | ||
170 | buf[i] = 0; | ||
171 | else if (c < 84) | ||
172 | buf[i] = 255; | ||
173 | } | ||
174 | } | ||
175 | #endif | ||
176 | |||
177 | if (top != -1) | ||
178 | { | ||
179 | if (top) | ||
180 | { | ||
181 | if (bit == 0) | ||
182 | { | ||
183 | buf[0]=1; | ||
184 | buf[1]|=0x80; | ||
185 | } | ||
186 | else | ||
187 | { | ||
188 | buf[0]|=(3<<(bit-1)); | ||
189 | } | ||
97 | } | 190 | } |
98 | else | 191 | else |
99 | { | 192 | { |
100 | buf[0]|=(3<<(bit-1)); | 193 | buf[0]|=(1<<bit); |
101 | buf[0]&= ~(mask<<1); | ||
102 | } | 194 | } |
103 | } | 195 | } |
104 | else | 196 | buf[0] &= ~mask; |
105 | { | 197 | if (bottom) /* set bottom bit if requested */ |
106 | buf[0]|=(1<<bit); | ||
107 | buf[0]&= ~(mask<<1); | ||
108 | } | ||
109 | if (bottom) /* set bottom bits to whatever odd is */ | ||
110 | buf[bytes-1]|=1; | 198 | buf[bytes-1]|=1; |
111 | if (!BN_bin2bn(buf,bytes,rnd)) goto err; | 199 | if (!BN_bin2bn(buf,bytes,rnd)) goto err; |
112 | ret=1; | 200 | ret=1; |
@@ -114,8 +202,90 @@ err: | |||
114 | if (buf != NULL) | 202 | if (buf != NULL) |
115 | { | 203 | { |
116 | memset(buf,0,bytes); | 204 | memset(buf,0,bytes); |
117 | Free(buf); | 205 | OPENSSL_free(buf); |
118 | } | 206 | } |
119 | return(ret); | 207 | return(ret); |
120 | } | 208 | } |
121 | 209 | ||
210 | int BN_rand(BIGNUM *rnd, int bits, int top, int bottom) | ||
211 | { | ||
212 | return bnrand(0, rnd, bits, top, bottom); | ||
213 | } | ||
214 | |||
215 | int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom) | ||
216 | { | ||
217 | return bnrand(1, rnd, bits, top, bottom); | ||
218 | } | ||
219 | |||
220 | #if 1 | ||
221 | int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom) | ||
222 | { | ||
223 | return bnrand(2, rnd, bits, top, bottom); | ||
224 | } | ||
225 | #endif | ||
226 | |||
227 | |||
228 | /* random number r: 0 <= r < range */ | ||
229 | static int bn_rand_range(int pseudo, BIGNUM *r, BIGNUM *range) | ||
230 | { | ||
231 | int (*bn_rand)(BIGNUM *, int, int, int) = pseudo ? BN_pseudo_rand : BN_rand; | ||
232 | int n; | ||
233 | |||
234 | if (range->neg || BN_is_zero(range)) | ||
235 | { | ||
236 | BNerr(BN_F_BN_RAND_RANGE, BN_R_INVALID_RANGE); | ||
237 | return 0; | ||
238 | } | ||
239 | |||
240 | n = BN_num_bits(range); /* n > 0 */ | ||
241 | |||
242 | /* BN_is_bit_set(range, n - 1) always holds */ | ||
243 | |||
244 | if (n == 1) | ||
245 | { | ||
246 | if (!BN_zero(r)) return 0; | ||
247 | } | ||
248 | else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3)) | ||
249 | { | ||
250 | /* range = 100..._2, | ||
251 | * so 3*range (= 11..._2) is exactly one bit longer than range */ | ||
252 | do | ||
253 | { | ||
254 | if (!bn_rand(r, n + 1, -1, 0)) return 0; | ||
255 | /* If r < 3*range, use r := r MOD range | ||
256 | * (which is either r, r - range, or r - 2*range). | ||
257 | * Otherwise, iterate once more. | ||
258 | * Since 3*range = 11..._2, each iteration succeeds with | ||
259 | * probability >= .75. */ | ||
260 | if (BN_cmp(r ,range) >= 0) | ||
261 | { | ||
262 | if (!BN_sub(r, r, range)) return 0; | ||
263 | if (BN_cmp(r, range) >= 0) | ||
264 | if (!BN_sub(r, r, range)) return 0; | ||
265 | } | ||
266 | } | ||
267 | while (BN_cmp(r, range) >= 0); | ||
268 | } | ||
269 | else | ||
270 | { | ||
271 | do | ||
272 | { | ||
273 | /* range = 11..._2 or range = 101..._2 */ | ||
274 | if (!bn_rand(r, n, -1, 0)) return 0; | ||
275 | } | ||
276 | while (BN_cmp(r, range) >= 0); | ||
277 | } | ||
278 | |||
279 | return 1; | ||
280 | } | ||
281 | |||
282 | |||
283 | int BN_rand_range(BIGNUM *r, BIGNUM *range) | ||
284 | { | ||
285 | return bn_rand_range(0, r, range); | ||
286 | } | ||
287 | |||
288 | int BN_pseudo_rand_range(BIGNUM *r, BIGNUM *range) | ||
289 | { | ||
290 | return bn_rand_range(1, r, range); | ||
291 | } | ||