Fast polynomial multiplication for arbitrary rings

[mzeuner]

This PR contains a version of karatsubas algorithm for multiplying two polynomials in R[X] that does not require R to have decidable equality or an apartness relation.

For now its still a draft because we should have some benchmarking and see that it is actually faster.