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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
|
/*
* Copyright (c) 1998, 1999, 2000, 2001 Virtual Unlimited B.V.
*
* Author: Bob Deblier <bob@virtualunlimited.com>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
/*!\mtprng.c
* \brief Mersenne Twister pseudo-random number generator.
*
* Developed by Makoto Matsumoto and Takuji Nishimura. For more information,
* see: http://www.math.keio.ac.jp/~matumoto/emt.html
*
* Adapted from optimized code by Shawn J. Cokus <cokus@math.washington.edu>
*
* \warning This generator has a very long period, passes statistical test and
& is very fast, but is not recommended for use in cryptography.
*
* \author Bob Deblier <bob@virtualunlimited.com>
* \ingroup PRNG_m
*/
#include "system.h"
#include "beecrypt.h"
#include "mtprng.h"
#include "mpopt.h"
#include "mp.h"
#include "debug.h"
#define hiBit(a) ((a) & 0x80000000U)
#define loBit(a) ((a) & 0x1U)
#define loBits(a) ((a) & 0x7FFFFFFFU)
#define mixBits(a, b) (hiBit(a) | loBits(b))
/*@-sizeoftype@*/
const randomGenerator mtprng = { "Mersenne Twister", sizeof(mtprngParam), (randomGeneratorSetup) mtprngSetup, (randomGeneratorSeed) mtprngSeed, (randomGeneratorNext) mtprngNext, (randomGeneratorCleanup) mtprngCleanup };
/*@=sizeoftype@*/
/**
*/
static void mtprngReload(mtprngParam* mp)
/*@modifies mp @*/
{
register uint32_t *p0 = mp->state;
register uint32_t *p2=p0+2, *pM = p0+M, s0, s1;
register int j;
for (s0=mp->state[0], s1=mp->state[1], j=N-M+1; --j; s0=s1, s1=*(p2++))
*(p0++) = *(pM++) ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0);
for (pM=mp->state, j=M; --j; s0=s1, s1=*(p2++))
*(p0++) = *(pM++) ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0);
s1 = mp->state[0], *p0 = *pM ^ (mixBits(s0, s1) >> 1) ^ (loBit(s1) ? K : 0);
mp->left = N;
mp->nextw = mp->state;
}
int mtprngSetup(mtprngParam* mp)
{
if (mp)
{
#ifdef _REENTRANT
# if WIN32
if (!(mp->lock = CreateMutex(NULL, FALSE, NULL)))
return -1;
# else
# if HAVE_THREAD_H && HAVE_SYNCH_H
if (mutex_init(&mp->lock, USYNC_THREAD, (void *) 0))
return -1;
# elif HAVE_PTHREAD_H
/*@-nullpass@*/
/*@-moduncon@*/
if (pthread_mutex_init(&mp->lock, (pthread_mutexattr_t *) 0))
return -1;
/*@=moduncon@*/
/*@=nullpass@*/
# endif
# endif
#endif
mp->left = 0;
return entropyGatherNext((byte*)mp->state, sizeof(mp->state));
}
return -1;
}
int mtprngSeed(mtprngParam* mp, const byte* data, size_t size)
{
if (mp)
{
size_t needed = sizeof(mp->state);
byte* dest = (byte *) mp->state;
#ifdef _REENTRANT
# if WIN32
if (WaitForSingleObject(mp->lock, INFINITE) != WAIT_OBJECT_0)
return -1;
# else
# if HAVE_THREAD_H && HAVE_SYNCH_H
if (mutex_lock(&mp->lock))
return -1;
# elif HAVE_PTHREAD_H
/*@-moduncon@*/
if (pthread_mutex_lock(&mp->lock))
return -1;
/*@=moduncon@*/
# endif
# endif
#endif
while (size < needed)
{
memcpy(dest, data, size);
dest += size;
needed -= size;
}
memcpy(dest, data, needed);
#ifdef _REENTRANT
# if WIN32
if (!ReleaseMutex(mp->lock))
return -1;
# else
# if HAVE_THREAD_H && HAVE_SYNCH_H
if (mutex_unlock(&mp->lock))
return -1;
# elif HAVE_PTHREAD_H
/*@-moduncon@*/
if (pthread_mutex_unlock(&mp->lock))
return -1;
/*@=moduncon@*/
# endif
# endif
#endif
return 0;
}
return -1;
}
int mtprngNext(mtprngParam* mp, byte* data, size_t size)
{
if (mp)
{
uint32_t tmp;
#ifdef _REENTRANT
# if WIN32
if (WaitForSingleObject(mp->lock, INFINITE) != WAIT_OBJECT_0)
return -1;
# else
# if HAVE_THREAD_H && HAVE_SYNCH_H
if (mutex_lock(&mp->lock))
return -1;
# elif HAVE_PTHREAD_H
/*@-moduncon@*/
if (pthread_mutex_lock(&mp->lock))
return -1;
/*@=moduncon@*/
# endif
# endif
#endif
/*@-branchstate@*/
while (size > 0)
{
if (mp->left == 0)
mtprngReload(mp);
tmp = *(mp->nextw++);
tmp ^= (tmp >> 11);
tmp ^= (tmp << 7) & 0x9D2C5680U;
tmp ^= (tmp << 15) & 0xEFC60000U;
tmp ^= (tmp >> 18);
mp->left--;
if (size >= sizeof(tmp))
{
memcpy(data, &tmp, sizeof(tmp));
size -= sizeof(tmp);
}
else
{
memcpy(data, &tmp, size);
size = 0;
}
}
/*@=branchstate@*/
#ifdef _REENTRANT
# if WIN32
if (!ReleaseMutex(mp->lock))
return -1;
# else
# if HAVE_THREAD_H && HAVE_SYNCH_H
if (mutex_unlock(&mp->lock))
return -1;
# elif HAVE_PTHREAD_H
/*@-moduncon@*/
if (pthread_mutex_unlock(&mp->lock))
return -1;
/*@=moduncon@*/
# endif
# endif
#endif
return 0;
}
return -1;
}
int mtprngCleanup(mtprngParam* mp)
{
if (mp)
{
#ifdef _REENTRANT
# if WIN32
if (!CloseHandle(mp->lock))
return -1;
# else
# if HAVE_THREAD_H && HAVE_SYNCH_H
if (mutex_destroy(&mp->lock))
return -1;
# elif HAVE_PTHREAD_H
/*@-moduncon@*/
if (pthread_mutex_destroy(&mp->lock))
return -1;
/*@=moduncon@*/
# endif
# endif
#endif
return 0;
}
return -1;
}
|
