| 1 |
// 20240809 djb: split out of gf.c |
| 2 |
|
| 3 |
// linker define GF_mul |
| 4 |
// linker use gf_mul |
| 5 |
|
| 6 |
#include "gf.h" |
| 7 |
#include "params.h" |
| 8 |
|
| 9 |
/* input: in0, in1 in GF((2^m)^t) */ |
| 10 |
/* output: out = in0*in1 */ |
| 11 |
void GF_mul(gf *out, const gf *in0, const gf *in1) |
| 12 |
{ |
| 13 |
int i, j; |
| 14 |
|
| 15 |
gf prod[ SYS_T*2-1 ]; |
| 16 |
|
| 17 |
for (i = 0; i < SYS_T*2-1; i++) |
| 18 |
prod[i] = 0; |
| 19 |
|
| 20 |
for (i = 0; i < SYS_T; i++) |
| 21 |
for (j = 0; j < SYS_T; j++) |
| 22 |
prod[i+j] ^= gf_mul(in0[i], in1[j]); |
| 23 |
|
| 24 |
// |
| 25 |
|
| 26 |
for (i = (SYS_T-1)*2; i >= SYS_T; i--) |
| 27 |
{ |
| 28 |
prod[i - SYS_T + 7] ^= prod[i]; |
| 29 |
prod[i - SYS_T + 2] ^= prod[i]; |
| 30 |
prod[i - SYS_T + 1] ^= prod[i]; |
| 31 |
prod[i - SYS_T + 0] ^= prod[i]; |
| 32 |
} |
| 33 |
|
| 34 |
for (i = 0; i < SYS_T; i++) |
| 35 |
out[i] = prod[i]; |
| 36 |
} |
| 37 |
|