Lines Matching refs:seed
37 * <p>Note that if a seed is not provided, we attempt to provide sufficient
38 * seed bytes to completely randomize the internal state of the generator
39 * (20 bytes). However, our seed generation algorithm has not been thoroughly
67 * to provide sufficient seed bytes to completely randomize the internal
68 * state of the generator (20 bytes). Note, however, that our seed
72 * it may take several seconds of CPU time to seed the generator, depending
75 * seed bits.
83 * with a given seed from the SeedGenerator.
85 * @param seed the seed.
87 private SecureRandom(byte seed[]) {
88 init(seed);
93 * and sets the seed, if given.
95 private void init(byte[] seed) {
102 if (seed != null) {
103 engineSetSeed(seed);
108 * Returns the given number of seed bytes, computed using the seed
109 * generation algorithm that this class uses to seed itself. This
110 * call may be used to seed other random number generators. While
116 * seed bytes, although it should be noted that seed generation is
119 * @param numBytes the number of seed bytes to generate.
121 * @return the seed bytes.
130 * Reseeds this random object. The given seed supplements, rather than
131 * replaces, the existing seed. Thus, repeated calls are guaranteed
134 * @param seed the seed.
136 synchronized public void engineSetSeed(byte[] seed) {
142 state = digest.digest(seed);
171 * to seed future instances of SHA1PRNG SecureRandoms.
182 * seed material (likely from the Native implementation).
202 byte[] seed = new byte[DIGEST_SIZE];
203 SeederHolder.seeder.engineNextBytes(seed);
204 state = digest.digest(seed);
252 * If you do not want this behaviour, you should re-seed the restored