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.
266 /*      This version uses 64k bytes of table space.
268     value in GF(2^128).  If we consider a GF(2^128) value in
283 	int i, j, k;  in gf128mul_init_64k_bbe()  local
304 			for (k = 1; k < j; ++k)  in gf128mul_init_64k_bbe()
305 				be128_xor(&t->t[i]->t[j + k],  in gf128mul_init_64k_bbe()
306 					  &t->t[i]->t[j], &t->t[i]->t[k]);  in gf128mul_init_64k_bbe()
311 		for (j = 128; j > 0; j >>= 1) {  in gf128mul_init_64k_bbe()
345 /*      This version uses 4k bytes of table space.
347     value in GF(2^128).  If we consider a GF(2^128) value in a
364 	int j, k;  in gf128mul_init_4k_lle()  local
370 	t->t[128] = *g;  in gf128mul_init_4k_lle()
375 		for (k = 1; k < j; ++k)  in gf128mul_init_4k_lle()
376 			be128_xor(&t->t[j + k], &t->t[j], &t->t[k]);  in gf128mul_init_4k_lle()
386 	int j, k;  in gf128mul_init_4k_bbe()  local
397 		for (k = 1; k < j; ++k)  in gf128mul_init_4k_bbe()
398 			be128_xor(&t->t[j + k], &t->t[j], &t->t[k]);  in gf128mul_init_4k_bbe()
436 MODULE_DESCRIPTION("Functions for multiplying elements of GF(2^128)");