Answers are grounded in this paper and cite their sources.
Based on a recently proposed Toeplitz matrix-vector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using type I and II optimal normal bases.
No takes yet. Share an insight, caveat, or question.
Fan et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: