Bad Multiplication Performance.

FFT struggles when multiplying 2048bit numbers, I tried to replace it with karatsuba as described in the readme, and it just seg-faulted.
Have you tried benchmarking the basic arithmetic operations?

I am afraid performance has never been a strong point of this library.

Can you provide example values that will cause karatsuba to segfault? It might be recursing too much.