Hacker News new | past | comments | ask | show | jobs | submit login

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_algo...



Oh, neat, what's the runtime?

https://math.stackexchange.com/questions/1479745/relations-o...

What have we missed?


Ah, 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.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: