Multiplication of polynomials over the binary field
Number Theory
2025-05-15 v2 Data Structures and Algorithms
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 .
Cite
@article{arxiv.2505.03101,
title = {Multiplication of polynomials over the binary field},
author = {Chunlei Liu},
journal= {arXiv preprint arXiv:2505.03101},
year = {2025}
}