Implement High-Performance Karatsuba Multiplier in High-Level Synthesis (HLS) for FPGA Based on Recursive Template

Divide and Conquer algorithm to multiply n-bit numbers in O(n^1.58).. This implementation works completely without using Python's "*"-operator; just "+", "-", bitwise operations and a lookup table.

karatsuba multiplication using C

Polynomial Multiplication using Karatsuba's Algorithm

Fast Multiplication algorithm for very long digit numbers.

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.

Get factorial of large no using karatsuba algorithm.

My Data-Structures and Algorithms codes for CSE 203 Course.

Laboratorio de la asignatura Estructuras de Datos y Algoritmos (C++)

Karatsuba's Algorithm implemented in C++

Multiplication and exponentiation using Karatsuba Method

FPAA - Implementação do Algoritmo de Karatsuba

optimized karatsuba polynomial multiplication

Karatsuba's Algorithm in C, a fast multiplication technique for large numbers using recursive divide-and-conquer approach.

Polynomial multiplication algorithm written in C++, with time complexity of O(N^log3) = O(N^1.585)

To resolve multiply process reducing complexity with karatsuba algorithm

Fast Fibonacci numbers with arbitrary precision

This project implements the Karatsuba algorithm and was developed for the Foundations of Algorithm Design and Analysis course at the PUC Minas university, in the 5th period.

Python implementation of computational algebra algorithms, focusing on Finite Fields ($F_p, F_q$) and polynomial factorization. Final project for Computational Algebra.

C library developed to perform arithmetic operations on integers of arbitrary length and Karatsuba algorithm has been implemented for performing multiplication of integers