September 1, 2019
Author(s)
Cagdas Calik, Morris Dworkin, Nathan Dykas, Rene Peralta
Efficient circuits for multiplication of binary polynomials use what are known as Karatsuba recurrences. These methods divide the polynomials of size kn into k pieces of size n. Multiplication is performed by treating the factors as degree-(k-1)