You must implement a generator of random univariate polynomials parametrized by the desired degree and the coefficient ring. In MAPLE In AXIOM For each coefficient ring, the degree $ n$ should vary from $ 1$ to a value large enough (typically $ 200$ ) in order to show that the Karatsuba's algorithm is asymptotically faster. For each value of $ n$ , it is recommended Both MAPLE and AXIOM have graphical facilities that you can use for displaying your experimental results. You may also use gnuplot or any other tool that you are familiar with.

Marc Moreno Maza