1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
/*
* Blum, Blum & Shub PRNG using the MPI library
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is the MPI Arbitrary Precision Integer Arithmetic library.
*
* The Initial Developer of the Original Code is
* Michael J. Fromberger.
* Portions created by the Initial Developer are Copyright (C) 1998
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
/* $Id$ */
#include "bbs_rand.h"
#define SEED 1
#define MODULUS 2
/* This modulus is the product of two randomly generated 512-bit
prime integers, each of which is congruent to 3 (mod 4). */
static char *bbs_modulus =
"75A2A6E1D27393B86562B9CE7279A8403CB4258A637DAB5233465373E37837383EDC"
"332282B8575927BC4172CE8C147B4894050EE9D2BDEED355C121037270CA2570D127"
"7D2390CD1002263326635CC6B259148DE3A1A03201980A925E395E646A5E9164B0EC"
"28559EBA58C87447245ADD0651EDA507056A1129E3A3E16E903D64B437";
static int bbs_init = 0; /* flag set when library is initialized */
static mp_int bbs_state; /* the current state of the generator */
/* Suggested size of random seed data */
int bbs_seed_size = (sizeof(bbs_modulus) / 2);
void bbs_srand(unsigned char *data, int len)
{
if((bbs_init & SEED) == 0) {
mp_init(&bbs_state);
bbs_init |= SEED;
}
mp_read_raw(&bbs_state, (char *)data, len);
} /* end bbs_srand() */
unsigned int bbs_rand(void)
{
static mp_int modulus;
unsigned int result = 0, ix;
if((bbs_init & MODULUS) == 0) {
mp_init(&modulus);
mp_read_radix(&modulus, bbs_modulus, 16);
bbs_init |= MODULUS;
}
for(ix = 0; ix < sizeof(unsigned int); ix++) {
mp_digit d;
mp_sqrmod(&bbs_state, &modulus, &bbs_state);
d = DIGIT(&bbs_state, 0);
result = (result << CHAR_BIT) | (d & UCHAR_MAX);
}
return result;
} /* end bbs_rand() */
/*------------------------------------------------------------------------*/
/* HERE THERE BE DRAGONS */
|
