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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
|
/* SecureRandom.java --- Secure Random class implmentation
Copyright (C) 1999 Free Software Foundation, Inc.
This file is part of GNU Classpath.
GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
GNU Classpath 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
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA.
As a special exception, if you link this library with other files to
produce an executable, this library does not by itself cause the
resulting executable to be covered by the GNU General Public License.
This exception does not however invalidate any other reasons why the
executable file might be covered by the GNU General Public License. */
package java.security;
import java.io.Serializable;
import java.util.Random;
import java.util.Enumeration;
/**
SecureRandom is the class interface for using SecureRandom
providers. It provides an interface to the SecureRandomSpi
engine so that programmers can generate pseudo-random numbers.
@author Mark Benvenuto <ivymccough@worldnet.att.net>
*/
public class SecureRandom extends Random
{
//Serialized Field
long counter = 0; //Serialized
MessageDigest digest = null;
Provider provider = null;
byte[] randomBytes = null; //Always null
int randomBytesUsed = 0;
SecureRandomSpi secureRandomSpi = null;
byte[] state = null;
/**
Default constructor for SecureRandom. It constructs a
new SecureRandom by instantating the first SecureRandom
algorithm in the default security provier.
It is not seeded and should be seeded using setseed or else
on the first call to getnextBytes it will force a seed.
It is maintained for backwards compatability and programs
should use getInstance.
*/
public SecureRandom()
{
Provider p[] = Security.getProviders();
//Format of Key: SecureRandom.algname
String key;
String classname = null;
int i, flag = 0;
Enumeration e;
for (i = 0; i < p.length; i++)
{
e = p[i].propertyNames();
while (e.hasMoreElements())
{
key = (String) e.nextElement();
if (key.startsWith("SecureRandom."))
if ((classname = p[i].getProperty(key)) != null)
break;
}
if (classname != null)
break;
}
//if( classname == null)
// throw new NoSuchAlgorithmException();
try
{
this.secureRandomSpi =
(SecureRandomSpi) Class.forName(classname).newInstance();
//s.algorithm = algorithm;
this.provider = p[i];
}
catch (ClassNotFoundException cnfe)
{
//throw new NoSuchAlgorithmException("Class not found");
}
catch (InstantiationException ie)
{
//throw new NoSuchAlgorithmException("Class instantiation failed");
}
catch (IllegalAccessException iae)
{
//throw new NoSuchAlgorithmException("Illegal Access");
}
}
/**
A constructor for SecureRandom. It constructs a new
SecureRandom by instantating the first SecureRandom algorithm
in the default security provier.
It is seeded with the passed function and is useful if the user
has access to hardware random device (like a radiation detector).
It is maintained for backwards compatability and programs
should use getInstance.
@param seed Seed bytes for class
*/
public SecureRandom(byte[] seed)
{
this();
setSeed(seed);
}
/**
A constructor for SecureRandom. It constructs a new
SecureRandom using the specified SecureRandomSpi from
the specified security provier.
@param secureRandomSpi A SecureRandomSpi class
@param provider A Provider class
*/
protected SecureRandom(SecureRandomSpi secureRandomSpi, Provider provider)
{
this.secureRandomSpi = secureRandomSpi;
this.provider = provider;
}
/**
Returns an instance of a SecureRandom. It creates the class
for the specified algorithm if it exists from a provider.
@param algorithm A SecureRandom algorithm to use
@return Returns a new SecureRandom implmenting the chosen algorithm
@throws NoSuchAlgorithmException if the algorithm cannot be found
*/
public static SecureRandom getInstance(String algorithm) throws
NoSuchAlgorithmException
{
Provider p[] = Security.getProviders();
//Format of Key: SecureRandom.algname
StringBuffer key = new StringBuffer("SecureRandom.");
key.append(algorithm);
String classname = null;
int i;
for (i = 0; i < p.length; i++)
{
if ((classname = p[i].getProperty(key.toString())) != null)
break;
}
if (classname == null)
throw new NoSuchAlgorithmException();
try
{
return new SecureRandom((SecureRandomSpi) Class.forName(classname).
newInstance(), p[i]);
}
catch (ClassNotFoundException cnfe)
{
throw new NoSuchAlgorithmException("Class not found");
}
catch (InstantiationException ie)
{
throw new NoSuchAlgorithmException("Class instantiation failed");
}
catch (IllegalAccessException iae)
{
throw new NoSuchAlgorithmException("Illegal Access");
}
}
/**
Returns an instance of a SecureRandom. It creates the class
for the specified algorithm from the specified provider.
@param algorithm A SecureRandom algorithm to use
@param provider A security provider to use
@return Returns a new SecureRandom implmenting the chosen algorithm
@throws NoSuchAlgorithmException if the algorithm cannot be found
@throws NoSuchProviderException if the provider cannot be found
*/
public static SecureRandom getInstance(String algorithm,
String provider) throws
NoSuchAlgorithmException, NoSuchProviderException
{
Provider p = Security.getProvider(provider);
if (p == null)
throw new NoSuchProviderException();
//Format of Key: SecureRandom.algName
StringBuffer key = new StringBuffer("SecureRandom.");
key.append(algorithm);
String classname = p.getProperty(key.toString());
if (classname == null)
throw new NoSuchAlgorithmException();
try
{
return new SecureRandom((SecureRandomSpi) Class.forName(classname).
newInstance(), p);
}
catch (ClassNotFoundException cnfe)
{
throw new NoSuchAlgorithmException("Class not found");
}
catch (InstantiationException ie)
{
throw new NoSuchAlgorithmException("Class instantiation failed");
}
catch (IllegalAccessException iae)
{
throw new NoSuchAlgorithmException("Illegal Access");
}
}
/**
Returns the provider being used by the current SecureRandom class.
@return The provider from which this SecureRandom was attained
*/
public final Provider getProvider()
{
return provider;
}
/**
Seeds the SecureRandom. The class is re-seeded for each call and
each seed builds on the previous seed so as not to weaken security.
@param seed seed bytes to seed with
*/
public void setSeed(byte[] seed)
{
secureRandomSpi.engineSetSeed(seed);
}
/**
Seeds the SecureRandom. The class is re-seeded for each call and
each seed builds on the previous seed so as not to weaken security.
@param seed 8 seed bytes to seed with
*/
public void setSeed(long seed)
{
byte tmp[] = { (byte) (0xff & (seed >> 56)), (byte) (0xff & (seed >> 48)),
(byte) (0xff & (seed >> 40)), (byte) (0xff & (seed >> 32)),
(byte) (0xff & (seed >> 24)), (byte) (0xff & (seed >> 16)),
(byte) (0xff & (seed >> 8)), (byte) (0xff & seed)
};
secureRandomSpi.engineSetSeed(tmp);
}
/**
Generates a user specified number of bytes. This function
is the basis for all the random functions.
@param bytes array to store generated bytes in
*/
public void nextBytes(byte[] bytes)
{
randomBytesUsed += bytes.length;
counter++;
secureRandomSpi.engineNextBytes(bytes);
}
/**
Generates an integer containing the user specified
number of random bits. It is right justified and padded
with zeros.
@param numBits number of random bits to get, 0 <= numBits <= 32;
@return the random bits
*/
protected final int next(int numBits)
{
if (numBits == 0)
return 0;
byte tmp[] = new byte[numBits / 8 + (1 * (numBits % 8))];
secureRandomSpi.engineNextBytes(tmp);
randomBytesUsed += tmp.length;
counter++;
int ret = 0;
for (int i = 0; i < tmp.length; i++)
ret |= tmp[i] << (8 * i);
return ret;
}
/**
Returns the given number of seed bytes. This method is
maintained only for backwards capability.
@param numBytes number of seed bytes to get
@return an array containing the seed bytes
*/
public static byte[] getSeed(int numBytes)
{
byte tmp[] = new byte[numBytes];
new Random().nextBytes(tmp);
return tmp;
//return secureRandomSpi.engineGenerateSeed( numBytes );
}
/**
Returns the specified number of seed bytes.
@param numBytes number of seed bytes to get
@return an array containing the seed bytes
*/
public byte[] generateSeed(int numBytes)
{
return secureRandomSpi.engineGenerateSeed(numBytes);
}
}
|