This is the PRNG for jNeo. It is based on the X9.82 DRBG algorithm "Hash Function DRBG Using Any Approved Hash Function (Hash_DRBG)" using SHA-256 as the underlying hash.
This implementation uses the following value for t:
0xcf, 0x83, 0xe1, 0x35, 0x7e, 0xef, 0xb8, 0xbd, 0xf1, 0x54,
0x28, 0x50, 0xd6, 0x6d, 0x80, 0x07, 0xd6, 0x20, 0xe4, 0x05,
0x0b, 0x57, 0x15, 0xdc, 0x83, 0xf4, 0xa9, 0x21, 0xd3, 0x6c,
0xe9, 0xce, 0x47, 0xd0, 0xd1, 0x3c, 0x5d, 0x85, 0xf2, 0xb0,
0xff, 0x83, 0x18, 0xd2, 0x87, 0x7e, 0xec, 0x2f, 0x63, 0xb9,
0x31, 0xbd, 0x47, 0x41, 0x7a, 0x81, 0xa5, 0x38, 0x32, 0x7a,
0xf9, 0x27, 0xda, 0x3e
This implementation does not enforce the seed length requirements specified in the X9.82 documentation, but in all cases the seed must be non-null.
If two instances of {@code Random} are created with the sameseed, and the same sequence of method calls is made for each, they will generate and return identical sequences of numbers. In order to guarantee this property, particular algorithms are specified for the class {@code Random}. Java implementations must use all the algorithms shown here for the class {@code Random}, for the sake of absolute portability of Java code. However, subclasses of class {@code Random}are permitted to use other algorithms, so long as they adhere to the general contracts for all the methods.
The algorithms implemented by class {@code Random} use a{@code protected} utility method that on each invocation can supplyup to 32 pseudorandomly generated bits.
Many applications will find the method {@link Math#random} simpler to use. @author Frank Yellin @version 1.47, 02/07/06 @since 1.0
Note: Implementations may not be thread-safe and should be externally synchronized.
Note: Instances should be created using the {@code AlgorithmManager} factory.
@see org.vngx.jsch.algorithm.AlgorithmManager @author Michael Laudati
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|