Searched refs:bits (Results 1 – 3 of 3) sorted by relevance
| /crypto/ |
| A D | camellia_generic.c | 319 #define ROLDQ(ll, lr, rl, rr, w0, w1, bits) ({ \ argument
321 ll = (ll << bits) + (lr >> (32 - bits)); \
322 lr = (lr << bits) + (rl >> (32 - bits)); \
323 rl = (rl << bits) + (rr >> (32 - bits)); \
324 rr = (rr << bits) + (w0 >> (32 - bits)); \
327 #define ROLDQo32(ll, lr, rl, rr, w0, w1, bits) ({ \ argument
330 ll = (lr << (bits - 32)) + (rl >> (64 - bits)); \
331 lr = (rl << (bits - 32)) + (rr >> (64 - bits)); \
332 rl = (rr << (bits - 32)) + (w0 >> (64 - bits)); \
333 rr = (w0 << (bits - 32)) + (w1 >> (64 - bits)); \
|
| A D | jitterentropy.c | 384 static __u64 jent_loop_shuffle(unsigned int bits, unsigned int min) in jent_loop_shuffle() argument
389 unsigned int mask = (1<<bits) - 1; in jent_loop_shuffle()
397 for (i = 0; ((DATA_SIZE_BITS + bits - 1) / bits) > i; i++) { in jent_loop_shuffle()
399 time = time >> bits; in jent_loop_shuffle()
|
| A D | Kconfig | 375 The AES specifies three key sizes: 128, 192 and 256 bits
406 128 bits to 320 bits in length. It was evaluated as a entrant
435 bits to 448 bits in length. It's fast, simple and specifically
533 of 8 bits.
561 The input, output, and key of SMS4 are each 128 bits.
595 bits.
643 bits in length. This algorithm is required for driver-based
662 from 64 bits (or 96 bits using the RFC7539 convention) to 192 bits,
766 Use with aes-xts-plain, key size 256, 384 or 512 bits. This
1038 256 and 512 bits output.
[all …]
|
Completed in 13 milliseconds