mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-04-08 13:11:28 +08:00
Code Issues Packages Projects Releases Wiki Activity

SHA1PRNG.java (ensureIsSeeded): new method used to ensure seeding has occurred and that a specific seed can be...

Browse Source 
2003-02-10  Raif S. Naffah  <raif@fl.net.au>

	* gnu/java/security/provider/SHA1PRNG.java (ensureIsSeeded): new
	method used to ensure seeding has occurred and that a specific
	seed can be set and used.

From-SVN: r62660
This commit is contained in:
Raif S. Naffah 2003-02-11 00:08:32 +00:00 committed by Tom Tromey
parent d6a2d36ee7
commit ff23b16ca7
2 changed files with 27 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
libjava/ChangeLog
View File

@ -1,3 +1,9 @@
2003-02-10 Raif S. Naffah <raif@fl.net.au>
* gnu/java/security/provider/SHA1PRNG.java (ensureIsSeeded): new
method used to ensure seeding has occurred and that a specific
seed can be set and used.
2003-02-10 Ranjit Mathew <rmathew@hotmail.com>
* java/lang/Win32Process.java (destroy): Declare as native.

32
libjava/gnu/java/security/provider/SHA1PRNG.java
View File

@ -1,5 +1,5 @@
/* SHA1PRNG.java --- Secure Random SPI SHA1PRNG
Copyright (C) 1999, 2001 Free Software Foundation, Inc.
Copyright (C) 1999, 2001, 2003 Free Software Foundation, Inc.
This file is part of GNU Classpath.
@ -51,27 +51,22 @@ public class SHA1PRNG extends SecureRandomSpi implements Serializable
byte data[];
int seedpos;
int datapos;
private boolean seeded = false; // set to true when we seed this
public SHA1PRNG()
{
try {
digest = MessageDigest.getInstance("SHA");
} catch ( NoSuchAlgorithmException nsae) {
System.out.println("Failed to find SHA Message Digest: " + nsae);
nsae.printStackTrace();
// System.out.println("Failed to find SHA Message Digest: " + nsae);
// nsae.printStackTrace();
throw new InternalError ("no SHA implementation found");
}
seed = new byte[20];
seedpos = 0;
data = new byte[40];
datapos = 0;
new Random().nextBytes(seed);
byte digestdata[];
digestdata = digest.digest( data );
System.arraycopy( digestdata, 0, data, 0, 20);
datapos = 20; // try to force hashing a first block
}
public void engineSetSeed(byte[] seed)
@ -84,6 +79,7 @@ public class SHA1PRNG extends SecureRandomSpi implements Serializable
public void engineNextBytes(byte[] bytes)
{
ensureIsSeeded ();
int loc = 0;
while (loc < bytes.length)
{
@ -113,4 +109,18 @@ public class SHA1PRNG extends SecureRandomSpi implements Serializable
engineNextBytes( tmp );
return tmp;
}
private void ensureIsSeeded()
{
if (!seeded)
{
new Random(0L).nextBytes(seed);
byte[] digestdata = digest.digest(data);
System.arraycopy(digestdata, 0, data, 0, 20);
seeded = true;
}
}
}