Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
dandanua
on Jan 18, 2021
|
parent
|
context
|
favorite
| on:
That XOR Trick (2020)
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...
Straw
on Jan 18, 2021
[–]
Oh, neat, what's the runtime?
https://math.stackexchange.com/questions/1479745/relations-o...
What have we missed?
dandanua
on Jan 18, 2021
|
parent
[–]
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: