| commit | 02970cb7227a335edd2c8457ebdde0195a735733 | [log] [tgz] |
|---|---|---|
| author | Mark Hindess <hindessm@apache.org> | Tue Jul 19 17:38:16 2011 +0000 |
| committer | Mark Hindess <hindessm@apache.org> | Tue Jul 19 17:38:16 2011 +0000 |
| tree | 17e6a949615df186097e3dd0c62d1ce144fa7e84 | |
| parent | 1de8c6392d68615da36e033e050c755ec32f0d5c [diff] |
Apply patch from HARMONY-6685 "SHA1PRNG produces less optimal" git-svn-id: https://svn.apache.org/repos/asf/harmony/enhanced/java/trunk@1148459 13f79535-47bb-0310-9956-ffa450edef68
diff --git a/classlib/modules/security/src/main/java/common/org/apache/harmony/security/provider/crypto/SHA1PRNG_SecureRandomImpl.java b/classlib/modules/security/src/main/java/common/org/apache/harmony/security/provider/crypto/SHA1PRNG_SecureRandomImpl.java index cd926d8..b6556a5 100644 --- a/classlib/modules/security/src/main/java/common/org/apache/harmony/security/provider/crypto/SHA1PRNG_SecureRandomImpl.java +++ b/classlib/modules/security/src/main/java/common/org/apache/harmony/security/provider/crypto/SHA1PRNG_SecureRandomImpl.java
@@ -317,7 +317,7 @@ seed[i] = 0; } - bits = seedLength << 3 + 64; // transforming # of bytes into # of bits + bits = (seedLength << 3) + 64; // transforming # of bytes into # of bits // putting # of bits into two last words (14,15) of 16 word frame in // seed or copies array depending on total length after padding