67 citations · 147 across the 11 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.SC2018★ 8 cited
Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform
Ming-Shing Chen, Chen-Mou Cheng, Po-Chun Kuo +2
We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a nat…
cs.SC2018★ 3 cited
Frobenius Additive Fast Fourier Transform
Wen-Ding Li, Ming-Shing Chen, Po-Chun Kuo +2
In ISSAC 2017, van der Hoeven and Larrieu showed that evaluating a polynomial P in GF(q)[x] of degree <n at all n-th roots of unity in GF() can essentially be computed d-time…