Home
last modified time | relevance | path

Searched refs:RANDOM_KEYSIZE (Results 1 - 3 of 3) sorted by relevance

/third_party/FreeBSD/sys/dev/random/
H A Dhash.h37 #define RANDOM_KEYSIZE 32 /* (in bytes) == 256 bits */ macro
38 #define RANDOM_KEYSIZE_WORDS (RANDOM_KEYSIZE/sizeof(uint32_t))
41 #define RANDOM_KEYS_PER_BLOCK (RANDOM_KEYSIZE/RANDOM_BLOCKSIZE)
H A Dyarrow.c75 /* This algorithm (and code) presumes that RANDOM_KEYSIZE is twice as large as RANDOM_BLOCKSIZE */
77 CTASSERT(RANDOM_KEYSIZE == 2*RANDOM_BLOCKSIZE);
263 static uint8_t v[RANDOM_YARROW_TIMEBIN][RANDOM_KEYSIZE]; /* v[i] */ in random_yarrow_reseed_internal()
294 randomdev_hash_iterate(&context, v[i - 1], RANDOM_KEYSIZE); in random_yarrow_reseed_internal()
296 randomdev_hash_iterate(&context, v[0], RANDOM_KEYSIZE); in random_yarrow_reseed_internal()
307 randomdev_hash_iterate(&context, &yarrow_state.ys_key, RANDOM_KEYSIZE); in random_yarrow_reseed_internal()
309 randomdev_hash_iterate(&context, v[i], RANDOM_KEYSIZE); in random_yarrow_reseed_internal()
348 uint8_t temp[RANDOM_KEYSIZE]; in random_yarrow_generator_gate()
352 for (i = 0; i < RANDOM_KEYSIZE; i += RANDOM_BLOCKSIZE) in random_yarrow_generator_gate()
H A Dhash.c58 /* This code presumes that RANDOM_KEYSIZE is twice as large as RANDOM_BLOCKSIZE */
59 //CTASSERT(RANDOM_KEYSIZE == 2*RANDOM_BLOCKSIZE);
78 * RANDOM_KEYSIZE bytes long.
88 * from the supplied <*data> which must be RANDOM_KEYSIZE bytes of binary
96 rijndael_makeKey(&context->key, DIR_ENCRYPT, RANDOM_KEYSIZE*8, data); in randomdev_encrypt_init()

Completed in 2 milliseconds