R.I.P.
👻
Ghosted
Multiplication of polynomials over the binary field
May 06, 2025 · Declared Dead · 🏛 arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Chunlei Liu
arXiv ID
2505.03101
Category
math.NT
Cross-listed
cs.DS
Citations
0
Venue
arXiv.org
Last Checked
1 month ago
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)$.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — math.NT
R.I.P.
👻
Ghosted
An analogue of Vosper's Theorem for Extension Fields
R.I.P.
👻
Ghosted
Improved torsion point attacks on SIDH variants
R.I.P.
👻
Ghosted
Ramanujan graphs in cryptography
R.I.P.
👻
Ghosted
Locally Recoverable Codes with Availability $t\geq 2$ from Fiber Products of Curves
R.I.P.
👻
Ghosted
Failing to hash into supersingular isogeny graphs
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted