Faster polynomial multiplication over finite fields using cyclotomic coefficient rings

摘要

We prove that for a fixed prime p, polynomials in F-p[X] of degree n may be multiplied in O(n log n4(log)* (n)) bit operations. Previously, the best known bound was O(n log n8(log)* (n)). (C) 2019 Elsevier Inc. All rights reserved.