Multiplication of polynomials over the binary field
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908362910728192 |
|---|---|
| author | Liu, Chunlei |
| author_facet | Liu, Chunlei |
| contents | 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)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_03101 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Multiplication of polynomials over the binary field Liu, Chunlei Number Theory Data Structures and Algorithms 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)$. |
| title | Multiplication of polynomials over the binary field |
| topic | Number Theory Data Structures and Algorithms |
| url | https://arxiv.org/abs/2505.03101 |