Faster polynomial multiplication over finite fields using cyclotomic coefficient rings

Abstract We prove that for a fixed prime  p , polynomials in F p [ X ] of degree  n may be multiplied in O ( n log n 4 log ∗ n ) bit operations. Previously, the best known bound was O ( n log n 8 log ∗ n ) .