3 ms·
Addition in F_{2^k} is not the same as XORing. But that summation idea is correct. To solve polynomial you can use this algorithm https://en.wikipedia.org/wiki/
by dandanua 6y ago
Addition in F_{2^k} is not the same as XORing. But that summation idea is correct. To solve polynomial you can use this algorithm https://en.wikipedia.org/wiki/Cantor%E2%80%93Zassenhaus_algorithm https://en.wikipedia.org/wiki/Cantor%E2%80%93Zassenhaus_algo...
- Straw 6y agoOh, neat, what's the runtime? https://math.stackexchange.com/questions/1479745/relations-of-galois-field-to-bitoperators-in-c https://math.stackexchange.com/questions/1479745/relations-o... What have we missed?
- dandanua 6y agoAh, XORing is indeed addition in F_{2^k}. It's not addition in Z_{2^k}, though. I was thinking about summation modulo prime number, in this case Z_p = F_p.