os/ossrv/ssl/libcrypto/src/crypto/bn/bn_rand.c
author sl
Tue, 10 Jun 2014 14:32:02 +0200
changeset 1 260cb5ec6c19
permissions -rw-r--r--
Update contrib.
sl@0
     1
/* crypto/bn/bn_rand.c */
sl@0
     2
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
sl@0
     3
 * All rights reserved.
sl@0
     4
 *
sl@0
     5
 * This package is an SSL implementation written
sl@0
     6
 * by Eric Young (eay@cryptsoft.com).
sl@0
     7
 * The implementation was written so as to conform with Netscapes SSL.
sl@0
     8
 * 
sl@0
     9
 * This library is free for commercial and non-commercial use as long as
sl@0
    10
 * the following conditions are aheared to.  The following conditions
sl@0
    11
 * apply to all code found in this distribution, be it the RC4, RSA,
sl@0
    12
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
sl@0
    13
 * included with this distribution is covered by the same copyright terms
sl@0
    14
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
sl@0
    15
 * 
sl@0
    16
 * Copyright remains Eric Young's, and as such any Copyright notices in
sl@0
    17
 * the code are not to be removed.
sl@0
    18
 * If this package is used in a product, Eric Young should be given attribution
sl@0
    19
 * as the author of the parts of the library used.
sl@0
    20
 * This can be in the form of a textual message at program startup or
sl@0
    21
 * in documentation (online or textual) provided with the package.
sl@0
    22
 * 
sl@0
    23
 * Redistribution and use in source and binary forms, with or without
sl@0
    24
 * modification, are permitted provided that the following conditions
sl@0
    25
 * are met:
sl@0
    26
 * 1. Redistributions of source code must retain the copyright
sl@0
    27
 *    notice, this list of conditions and the following disclaimer.
sl@0
    28
 * 2. Redistributions in binary form must reproduce the above copyright
sl@0
    29
 *    notice, this list of conditions and the following disclaimer in the
sl@0
    30
 *    documentation and/or other materials provided with the distribution.
sl@0
    31
 * 3. All advertising materials mentioning features or use of this software
sl@0
    32
 *    must display the following acknowledgement:
sl@0
    33
 *    "This product includes cryptographic software written by
sl@0
    34
 *     Eric Young (eay@cryptsoft.com)"
sl@0
    35
 *    The word 'cryptographic' can be left out if the rouines from the library
sl@0
    36
 *    being used are not cryptographic related :-).
sl@0
    37
 * 4. If you include any Windows specific code (or a derivative thereof) from 
sl@0
    38
 *    the apps directory (application code) you must include an acknowledgement:
sl@0
    39
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
sl@0
    40
 * 
sl@0
    41
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
sl@0
    42
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0
    43
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
sl@0
    44
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
sl@0
    45
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
sl@0
    46
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
sl@0
    47
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0
    48
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
sl@0
    49
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
sl@0
    50
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
sl@0
    51
 * SUCH DAMAGE.
sl@0
    52
 * 
sl@0
    53
 * The licence and distribution terms for any publically available version or
sl@0
    54
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
sl@0
    55
 * copied and put under another distribution licence
sl@0
    56
 * [including the GNU Public Licence.]
sl@0
    57
 */
sl@0
    58
/* ====================================================================
sl@0
    59
 * Copyright (c) 1998-2001 The OpenSSL Project.  All rights reserved.
sl@0
    60
 *
sl@0
    61
 * Redistribution and use in source and binary forms, with or without
sl@0
    62
 * modification, are permitted provided that the following conditions
sl@0
    63
 * are met:
sl@0
    64
 *
sl@0
    65
 * 1. Redistributions of source code must retain the above copyright
sl@0
    66
 *    notice, this list of conditions and the following disclaimer. 
sl@0
    67
 *
sl@0
    68
 * 2. Redistributions in binary form must reproduce the above copyright
sl@0
    69
 *    notice, this list of conditions and the following disclaimer in
sl@0
    70
 *    the documentation and/or other materials provided with the
sl@0
    71
 *    distribution.
sl@0
    72
 *
sl@0
    73
 * 3. All advertising materials mentioning features or use of this
sl@0
    74
 *    software must display the following acknowledgment:
sl@0
    75
 *    "This product includes software developed by the OpenSSL Project
sl@0
    76
 *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
sl@0
    77
 *
sl@0
    78
 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
sl@0
    79
 *    endorse or promote products derived from this software without
sl@0
    80
 *    prior written permission. For written permission, please contact
sl@0
    81
 *    openssl-core@openssl.org.
sl@0
    82
 *
sl@0
    83
 * 5. Products derived from this software may not be called "OpenSSL"
sl@0
    84
 *    nor may "OpenSSL" appear in their names without prior written
sl@0
    85
 *    permission of the OpenSSL Project.
sl@0
    86
 *
sl@0
    87
 * 6. Redistributions of any form whatsoever must retain the following
sl@0
    88
 *    acknowledgment:
sl@0
    89
 *    "This product includes software developed by the OpenSSL Project
sl@0
    90
 *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
sl@0
    91
 *
sl@0
    92
 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
sl@0
    93
 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0
    94
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
sl@0
    95
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
sl@0
    96
 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
sl@0
    97
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
sl@0
    98
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
sl@0
    99
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0
   100
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
sl@0
   101
 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
sl@0
   102
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
sl@0
   103
 * OF THE POSSIBILITY OF SUCH DAMAGE.
sl@0
   104
 * ====================================================================
sl@0
   105
 *
sl@0
   106
 * This product includes cryptographic software written by Eric Young
sl@0
   107
 * (eay@cryptsoft.com).  This product includes software written by Tim
sl@0
   108
 * Hudson (tjh@cryptsoft.com).
sl@0
   109
 *
sl@0
   110
 */
sl@0
   111
sl@0
   112
#include <stdio.h>
sl@0
   113
#include <time.h>
sl@0
   114
#include "cryptlib.h"
sl@0
   115
#include "bn_lcl.h"
sl@0
   116
#include <openssl/rand.h>
sl@0
   117
sl@0
   118
static int bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom)
sl@0
   119
	{
sl@0
   120
	unsigned char *buf=NULL;
sl@0
   121
	int ret=0,bit,bytes,mask;
sl@0
   122
	time_t tim;
sl@0
   123
sl@0
   124
	if (bits == 0)
sl@0
   125
		{
sl@0
   126
		BN_zero(rnd);
sl@0
   127
		return 1;
sl@0
   128
		}
sl@0
   129
sl@0
   130
	bytes=(bits+7)/8;
sl@0
   131
	bit=(bits-1)%8;
sl@0
   132
	mask=0xff<<(bit+1);
sl@0
   133
sl@0
   134
	buf=(unsigned char *)OPENSSL_malloc(bytes);
sl@0
   135
	if (buf == NULL)
sl@0
   136
		{
sl@0
   137
		BNerr(BN_F_BNRAND,ERR_R_MALLOC_FAILURE);
sl@0
   138
		goto err;
sl@0
   139
		}
sl@0
   140
sl@0
   141
	/* make a random number and set the top and bottom bits */
sl@0
   142
	time(&tim);
sl@0
   143
	RAND_add(&tim,sizeof(tim),0.0);
sl@0
   144
sl@0
   145
	if (pseudorand)
sl@0
   146
		{
sl@0
   147
		if (RAND_pseudo_bytes(buf, bytes) == -1)
sl@0
   148
			goto err;
sl@0
   149
		}
sl@0
   150
	else
sl@0
   151
		{
sl@0
   152
		if (RAND_bytes(buf, bytes) <= 0)
sl@0
   153
			goto err;
sl@0
   154
		}
sl@0
   155
sl@0
   156
#if 1
sl@0
   157
	if (pseudorand == 2)
sl@0
   158
		{
sl@0
   159
		/* generate patterns that are more likely to trigger BN
sl@0
   160
		   library bugs */
sl@0
   161
		int i;
sl@0
   162
		unsigned char c;
sl@0
   163
sl@0
   164
		for (i = 0; i < bytes; i++)
sl@0
   165
			{
sl@0
   166
			RAND_pseudo_bytes(&c, 1);
sl@0
   167
			if (c >= 128 && i > 0)
sl@0
   168
				buf[i] = buf[i-1];
sl@0
   169
			else if (c < 42)
sl@0
   170
				buf[i] = 0;
sl@0
   171
			else if (c < 84)
sl@0
   172
				buf[i] = 255;
sl@0
   173
			}
sl@0
   174
		}
sl@0
   175
#endif
sl@0
   176
sl@0
   177
	if (top != -1)
sl@0
   178
		{
sl@0
   179
		if (top)
sl@0
   180
			{
sl@0
   181
			if (bit == 0)
sl@0
   182
				{
sl@0
   183
				buf[0]=1;
sl@0
   184
				buf[1]|=0x80;
sl@0
   185
				}
sl@0
   186
			else
sl@0
   187
				{
sl@0
   188
				buf[0]|=(3<<(bit-1));
sl@0
   189
				}
sl@0
   190
			}
sl@0
   191
		else
sl@0
   192
			{
sl@0
   193
			buf[0]|=(1<<bit);
sl@0
   194
			}
sl@0
   195
		}
sl@0
   196
	buf[0] &= ~mask;
sl@0
   197
	if (bottom) /* set bottom bit if requested */
sl@0
   198
		buf[bytes-1]|=1;
sl@0
   199
	if (!BN_bin2bn(buf,bytes,rnd)) goto err;
sl@0
   200
	ret=1;
sl@0
   201
err:
sl@0
   202
	if (buf != NULL)
sl@0
   203
		{
sl@0
   204
		OPENSSL_cleanse(buf,bytes);
sl@0
   205
		OPENSSL_free(buf);
sl@0
   206
		}
sl@0
   207
	bn_check_top(rnd);
sl@0
   208
	return(ret);
sl@0
   209
	}
sl@0
   210
sl@0
   211
EXPORT_C int     BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
sl@0
   212
	{
sl@0
   213
	return bnrand(0, rnd, bits, top, bottom);
sl@0
   214
	}
sl@0
   215
sl@0
   216
EXPORT_C int     BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom)
sl@0
   217
	{
sl@0
   218
	return bnrand(1, rnd, bits, top, bottom);
sl@0
   219
	}
sl@0
   220
sl@0
   221
#if 1
sl@0
   222
EXPORT_C int     BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom)
sl@0
   223
	{
sl@0
   224
	return bnrand(2, rnd, bits, top, bottom);
sl@0
   225
	}
sl@0
   226
#endif
sl@0
   227
sl@0
   228
sl@0
   229
/* random number r:  0 <= r < range */
sl@0
   230
static int bn_rand_range(int pseudo, BIGNUM *r, BIGNUM *range)
sl@0
   231
	{
sl@0
   232
	int (*bn_rand)(BIGNUM *, int, int, int) = pseudo ? BN_pseudo_rand : BN_rand;
sl@0
   233
	int n;
sl@0
   234
	int count = 100;
sl@0
   235
sl@0
   236
	if (range->neg || BN_is_zero(range))
sl@0
   237
		{
sl@0
   238
		BNerr(BN_F_BN_RAND_RANGE, BN_R_INVALID_RANGE);
sl@0
   239
		return 0;
sl@0
   240
		}
sl@0
   241
sl@0
   242
	n = BN_num_bits(range); /* n > 0 */
sl@0
   243
sl@0
   244
	/* BN_is_bit_set(range, n - 1) always holds */
sl@0
   245
sl@0
   246
	if (n == 1)
sl@0
   247
		BN_zero(r);
sl@0
   248
	else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3))
sl@0
   249
		{
sl@0
   250
		/* range = 100..._2,
sl@0
   251
		 * so  3*range (= 11..._2)  is exactly one bit longer than  range */
sl@0
   252
		do
sl@0
   253
			{
sl@0
   254
			if (!bn_rand(r, n + 1, -1, 0)) return 0;
sl@0
   255
			/* If  r < 3*range,  use  r := r MOD range
sl@0
   256
			 * (which is either  r, r - range,  or  r - 2*range).
sl@0
   257
			 * Otherwise, iterate once more.
sl@0
   258
			 * Since  3*range = 11..._2, each iteration succeeds with
sl@0
   259
			 * probability >= .75. */
sl@0
   260
			if (BN_cmp(r ,range) >= 0)
sl@0
   261
				{
sl@0
   262
				if (!BN_sub(r, r, range)) return 0;
sl@0
   263
				if (BN_cmp(r, range) >= 0)
sl@0
   264
					if (!BN_sub(r, r, range)) return 0;
sl@0
   265
				}
sl@0
   266
sl@0
   267
			if (!--count)
sl@0
   268
				{
sl@0
   269
				BNerr(BN_F_BN_RAND_RANGE, BN_R_TOO_MANY_ITERATIONS);
sl@0
   270
				return 0;
sl@0
   271
				}
sl@0
   272
			
sl@0
   273
			}
sl@0
   274
		while (BN_cmp(r, range) >= 0);
sl@0
   275
		}
sl@0
   276
	else
sl@0
   277
		{
sl@0
   278
		do
sl@0
   279
			{
sl@0
   280
			/* range = 11..._2  or  range = 101..._2 */
sl@0
   281
			if (!bn_rand(r, n, -1, 0)) return 0;
sl@0
   282
sl@0
   283
			if (!--count)
sl@0
   284
				{
sl@0
   285
				BNerr(BN_F_BN_RAND_RANGE, BN_R_TOO_MANY_ITERATIONS);
sl@0
   286
				return 0;
sl@0
   287
				}
sl@0
   288
			}
sl@0
   289
		while (BN_cmp(r, range) >= 0);
sl@0
   290
		}
sl@0
   291
sl@0
   292
	bn_check_top(r);
sl@0
   293
	return 1;
sl@0
   294
	}
sl@0
   295
sl@0
   296
sl@0
   297
EXPORT_C int	BN_rand_range(BIGNUM *r, BIGNUM *range)
sl@0
   298
	{
sl@0
   299
	return bn_rand_range(0, r, range);
sl@0
   300
	}
sl@0
   301
sl@0
   302
EXPORT_C int	BN_pseudo_rand_range(BIGNUM *r, BIGNUM *range)
sl@0
   303
	{
sl@0
   304
	return bn_rand_range(1, r, range);
sl@0
   305
	}