Implementing the fast Karatsuba multiplication algorithm

The Karatsuba algorithm is a fast multiplication algorithm that reduces the number of multiplication operations required to multiply two numbers by recursively breaking down the multiplication into smaller multiplications.

This Java project takes two rows of input as factors for two polynomials, where each row contains a set of factors from x^0 to x^n, separated by spaces. It returns an array of factors for the resulting polynomial product and has a time complexity of O(n^log3(2)) where n denotes the largest power of the product.

Karatsuba multiplication simulator.

Toy implementation of RSA using self made BigInteger classes

Karatsuba's fast multiplication algorithm implemented in Java

First integer arithmetic assignment for the TU/e course 2WF90