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
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
|
/* SecureRandom.java --- Secure Random class implementation
Copyright (C) 1999, 2001, 2002, 2003, 2005, 2006
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., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.
Linking this library statically or dynamically with other modules is
making a combined work based on this library. Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.
As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module. An independent module is a module which is not derived from
or based on this library. If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so. If you do not wish to do so, delete this
exception statement from your version. */
package java.security;
import gnu.classpath.SystemProperties;
import gnu.java.lang.CPStringBuilder;
import gnu.java.security.Engine;
import gnu.java.security.action.GetSecurityPropertyAction;
import gnu.java.security.jce.prng.SecureRandomAdapter;
import gnu.java.security.jce.prng.Sha160RandomSpi;
import java.io.IOException;
import java.io.InputStream;
import java.lang.reflect.InvocationTargetException;
import java.net.MalformedURLException;
import java.net.URL;
import java.util.Enumeration;
import java.util.Random;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
* An interface to a cryptographically secure pseudo-random number
* generator (PRNG). Random (or at least unguessable) numbers are used
* in all areas of security and cryptography, from the generation of
* keys and initialization vectors to the generation of random padding
* bytes.
*
* @author Mark Benvenuto (ivymccough@worldnet.att.net)
* @author Casey Marshall
*/
public class SecureRandom extends Random
{
// Constants and fields.
// ------------------------------------------------------------------------
/** Service name for PRNGs. */
private static final String SECURE_RANDOM = "SecureRandom";
private static final long serialVersionUID = 4940670005562187L;
//Serialized Field
long counter = 0; //Serialized
Provider provider = null;
byte[] randomBytes = null; //Always null
int randomBytesUsed = 0;
SecureRandomSpi secureRandomSpi = null;
byte[] state = null;
private String algorithm;
private boolean isSeeded = false;
// Constructors.
// ------------------------------------------------------------------------
/**
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 compatibility and programs
should use {@link #getInstance(java.lang.String)}.
*/
public SecureRandom()
{
Provider[] p = Security.getProviders();
//Format of Key: SecureRandom.algname
String key;
String classname = null;
int i;
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)
{
try
{
secureRandomSpi = (SecureRandomSpi) Class.
forName(classname).newInstance();
provider = p[i];
algorithm = key.substring(13); // Minus SecureRandom.
return;
}
catch (ThreadDeath death)
{
throw death;
}
catch (Throwable t)
{
// Ignore.
}
}
}
}
}
// Nothing found. Fall back to SHA1PRNG
secureRandomSpi = new Sha160RandomSpi();
algorithm = "Sha160";
}
/**
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 compatibility 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, provider, "unknown");
}
/**
* Private constructor called from the getInstance() method.
*/
private SecureRandom(SecureRandomSpi secureRandomSpi, Provider provider,
String algorithm)
{
this.secureRandomSpi = secureRandomSpi;
this.provider = provider;
this.algorithm = algorithm;
}
/**
* Returns an instance of a <code>SecureRandom</code> from the first provider
* that implements it.
*
* @param algorithm The algorithm name.
* @return A new <code>SecureRandom</code> implementing the given algorithm.
* @throws NoSuchAlgorithmException If no installed provider implements the
* given algorithm.
* @throws IllegalArgumentException if <code>algorithm</code> is
* <code>null</code> or is an empty string.
*/
public static SecureRandom getInstance(String algorithm)
throws NoSuchAlgorithmException
{
Provider[] p = Security.getProviders();
NoSuchAlgorithmException lastException = null;
for (int i = 0; i < p.length; i++)
try
{
return getInstance(algorithm, p[i]);
}
catch (NoSuchAlgorithmException x)
{
lastException = x;
}
if (lastException != null)
throw lastException;
throw new NoSuchAlgorithmException(algorithm);
}
/**
* Returns an instance of a <code>SecureRandom</code> for the specified
* algorithm from the named provider.
*
* @param algorithm The algorithm name.
* @param provider The provider name.
* @return A new <code>SecureRandom</code> implementing the chosen
* algorithm.
* @throws NoSuchAlgorithmException If the named provider does not implement
* the algorithm, or if the implementation cannot be instantiated.
* @throws NoSuchProviderException If no provider named <code>provider</code>
* is currently installed.
* @throws IllegalArgumentException if either <code>algorithm</code> or
* <code>provider</code> is <code>null</code> or empty.
*/
public static SecureRandom getInstance(String algorithm, String provider)
throws NoSuchAlgorithmException, NoSuchProviderException
{
if (provider == null)
throw new IllegalArgumentException("provider MUST NOT be null");
provider = provider.trim();
if (provider.length() == 0)
throw new IllegalArgumentException("provider MUST NOT be empty");
Provider p = Security.getProvider(provider);
if (p == null)
throw new NoSuchProviderException(provider);
return getInstance(algorithm, p);
}
/**
* Returns an instance of a <code>SecureRandom</code> for the specified
* algorithm from the given provider.
*
* @param algorithm The <code>SecureRandom</code> algorithm to create.
* @param provider The provider to use.
* @throws NoSuchAlgorithmException If the algorithm cannot be found, or if
* the class cannot be instantiated.
* @throws IllegalArgumentException if either <code>algorithm</code> or
* <code>provider</code> is <code>null</code>, or if
* <code>algorithm</code> is an empty string.
*/
public static SecureRandom getInstance(String algorithm, Provider provider)
throws NoSuchAlgorithmException
{
CPStringBuilder sb = new CPStringBuilder("SecureRandom for algorithm [")
.append(algorithm).append("] from provider[")
.append(provider).append("] could not be created");
Throwable cause;
try
{
Object spi = Engine.getInstance(SECURE_RANDOM, algorithm, provider);
return new SecureRandom((SecureRandomSpi) spi, provider, algorithm);
}
catch (InvocationTargetException x)
{
cause = x.getCause();
if (cause instanceof NoSuchAlgorithmException)
throw (NoSuchAlgorithmException) cause;
if (cause == null)
cause = x;
}
catch (ClassCastException x)
{
cause = x;
}
NoSuchAlgorithmException x = new NoSuchAlgorithmException(sb.toString());
x.initCause(cause);
throw x;
}
/**
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;
}
/**
* Returns the algorithm name used or "unknown" when the algorithm
* used couldn't be determined (as when constructed by the protected
* 2 argument constructor).
*
* @since 1.5
*/
public String getAlgorithm()
{
return algorithm;
}
/**
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);
isSeeded = true;
}
/**
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)
{
// This particular setSeed will be called by Random.Random(), via
// our own constructor, before secureRandomSpi is initialized. In
// this case we can't call a method on secureRandomSpi, and we
// definitely don't want to throw a NullPointerException.
// Therefore we test.
if (secureRandomSpi != null)
{
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);
isSeeded = true;
}
}
/**
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)
{
if (!isSeeded)
setSeed(getSeed(32));
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 + 7) / 8];
this.nextBytes(tmp);
int ret = 0;
for (int i = 0; i < tmp.length; i++)
ret |= (tmp[i] & 0xFF) << (8 * i);
long mask = (1L << numBits) - 1;
return (int) (ret & mask);
}
/**
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)
{
return SecureRandomAdapter.getSeed(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);
}
}
|