Lines Matching +full:128 +full:k
1 /* gf128mul.c - GF(2^128) multiplication functions
47 This file provides fast multiplication in GF(2^128) as required by several
93 * in GF(2^128) is multiplied by x^8, the following macro returns the
95 * product to reduce it modulo the polynomial x^128 + x^7 + x^2 + x + 1.
228 /* This version uses 64k bytes of table space.
230 value in GF(2^128). If we consider a GF(2^128) value in
245 int i, j, k; in gf128mul_init_64k_bbe() local
266 for (k = 1; k < j; ++k) in gf128mul_init_64k_bbe()
267 be128_xor(&t->t[i]->t[j + k], in gf128mul_init_64k_bbe()
268 &t->t[i]->t[j], &t->t[i]->t[k]); in gf128mul_init_64k_bbe()
273 for (j = 128; j > 0; j >>= 1) { in gf128mul_init_64k_bbe()
307 /* This version uses 4k bytes of table space.
309 value in GF(2^128). If we consider a GF(2^128) value in a
326 int j, k; in gf128mul_init_4k_lle() local
332 t->t[128] = *g; in gf128mul_init_4k_lle()
337 for (k = 1; k < j; ++k) in gf128mul_init_4k_lle()
338 be128_xor(&t->t[j + k], &t->t[j], &t->t[k]); in gf128mul_init_4k_lle()
361 MODULE_DESCRIPTION("Functions for multiplying elements of GF(2^128)");