summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/bn/bn_rand.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/bn/bn_rand.c')
-rw-r--r--src/lib/libcrypto/bn/bn_rand.c290
1 files changed, 0 insertions, 290 deletions
diff --git a/src/lib/libcrypto/bn/bn_rand.c b/src/lib/libcrypto/bn/bn_rand.c
deleted file mode 100644
index ac5c5eb308..0000000000
--- a/src/lib/libcrypto/bn/bn_rand.c
+++ /dev/null
@@ -1,290 +0,0 @@
1/* $OpenBSD: bn_rand.c,v 1.17 2015/02/19 06:10:29 jsing Exp $ */
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 * 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 */
111
112#include <stdio.h>
113#include <stdlib.h>
114#include <time.h>
115
116#include <openssl/err.h>
117
118#include "bn_lcl.h"
119
120static int
121bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom)
122{
123 unsigned char *buf = NULL;
124 int ret = 0, bit, bytes, mask;
125
126 if (rnd == NULL) {
127 BNerr(BN_F_BNRAND, ERR_R_PASSED_NULL_PARAMETER);
128 return (0);
129 }
130
131 if (bits == 0) {
132 BN_zero(rnd);
133 return (1);
134 }
135
136 bytes = (bits + 7) / 8;
137 bit = (bits - 1) % 8;
138 mask = 0xff << (bit + 1);
139
140 buf = malloc(bytes);
141 if (buf == NULL) {
142 BNerr(BN_F_BNRAND, ERR_R_MALLOC_FAILURE);
143 goto err;
144 }
145
146 /* make a random number and set the top and bottom bits */
147 arc4random_buf(buf, bytes);
148
149#if 1
150 if (pseudorand == 2) {
151 /* generate patterns that are more likely to trigger BN
152 library bugs */
153 int i;
154 unsigned char c;
155
156 for (i = 0; i < bytes; i++) {
157 arc4random_buf(&c, 1);
158 if (c >= 128 && i > 0)
159 buf[i] = buf[i - 1];
160 else if (c < 42)
161 buf[i] = 0;
162 else if (c < 84)
163 buf[i] = 255;
164 }
165 }
166#endif
167
168 if (top != -1) {
169 if (top) {
170 if (bit == 0) {
171 buf[0] = 1;
172 buf[1] |= 0x80;
173 } else {
174 buf[0] |= (3 << (bit - 1));
175 }
176 } else {
177 buf[0] |= (1 << bit);
178 }
179 }
180 buf[0] &= ~mask;
181 if (bottom) /* set bottom bit if requested */
182 buf[bytes - 1] |= 1;
183 if (BN_bin2bn(buf, bytes, rnd) == NULL)
184 goto err;
185 ret = 1;
186
187err:
188 if (buf != NULL) {
189 OPENSSL_cleanse(buf, bytes);
190 free(buf);
191 }
192 bn_check_top(rnd);
193 return (ret);
194}
195
196int
197BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
198{
199 return bnrand(0, rnd, bits, top, bottom);
200}
201
202int
203BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom)
204{
205 return bnrand(1, rnd, bits, top, bottom);
206}
207
208#if 1
209int
210BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom)
211{
212 return bnrand(2, rnd, bits, top, bottom);
213}
214#endif
215
216
217/* random number r: 0 <= r < range */
218static int
219bn_rand_range(int pseudo, BIGNUM *r, const BIGNUM *range)
220{
221 int (*bn_rand)(BIGNUM *, int, int, int) = pseudo ? BN_pseudo_rand : BN_rand;
222 int n;
223 int count = 100;
224
225 if (range->neg || BN_is_zero(range)) {
226 BNerr(BN_F_BN_RAND_RANGE, BN_R_INVALID_RANGE);
227 return 0;
228 }
229
230 n = BN_num_bits(range); /* n > 0 */
231
232 /* BN_is_bit_set(range, n - 1) always holds */
233
234 if (n == 1)
235 BN_zero(r);
236 else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3)) {
237 /* range = 100..._2,
238 * so 3*range (= 11..._2) is exactly one bit longer than range */
239 do {
240 if (!bn_rand(r, n + 1, -1, 0))
241 return 0;
242 /* If r < 3*range, use r := r MOD range
243 * (which is either r, r - range, or r - 2*range).
244 * Otherwise, iterate once more.
245 * Since 3*range = 11..._2, each iteration succeeds with
246 * probability >= .75. */
247 if (BN_cmp(r, range) >= 0) {
248 if (!BN_sub(r, r, range))
249 return 0;
250 if (BN_cmp(r, range) >= 0)
251 if (!BN_sub(r, r, range))
252 return 0;
253 }
254
255 if (!--count) {
256 BNerr(BN_F_BN_RAND_RANGE,
257 BN_R_TOO_MANY_ITERATIONS);
258 return 0;
259 }
260
261 } while (BN_cmp(r, range) >= 0);
262 } else {
263 do {
264 /* range = 11..._2 or range = 101..._2 */
265 if (!bn_rand(r, n, -1, 0))
266 return 0;
267
268 if (!--count) {
269 BNerr(BN_F_BN_RAND_RANGE,
270 BN_R_TOO_MANY_ITERATIONS);
271 return 0;
272 }
273 } while (BN_cmp(r, range) >= 0);
274 }
275
276 bn_check_top(r);
277 return 1;
278}
279
280int
281BN_rand_range(BIGNUM *r, const BIGNUM *range)
282{
283 return bn_rand_range(0, r, range);
284}
285
286int
287BN_pseudo_rand_range(BIGNUM *r, const BIGNUM *range)
288{
289 return bn_rand_range(1, r, range);
290}
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-08-09 16:49:42 +0000