arXiv · 2505.03101
Multiplication of polynomials over the binary field
Abstract
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Chunlei Liu. 2025-05-14. Multiplication of polynomials over the binary field. https://arxiv.org/abs/2505.03101
Cite the original work for its findings. Save a collection to share your selection of sources.