Algebraic enhancements for GEMM & AI accelerators
Algorithms in python and C
A C++ library for big integers and dynamic precision floating-point
All algorithms and datastructures from Introduction to Algorithms (CLRS) in C
Implement High-Performance Karatsuba Multiplier in High-Level Synthesis (HLS) for FPGA Based on Recursive Template
Montgomery multiplication in number bases that are a power of 2, like binary, hexadecimal, byte-wise etc. Used mainly in RSA, DH cryptosystems.
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.
Построение и оптимизация алгоритмов (ЛЭТИ 2024) / Construction and optimization of algorithms (ETU 2024)
Simple Python implementation of the Karatsuba algorithm for multiplying two numbers.
A c++ high-precision calculator program, with plus, minus, fast multiply, improved division, improved module, fast power, bit-wise and, bit-wise or and bit-wise xor. Based on console, with colourful output.
Scripts created with AI assistance from white papers and publications and personal investigation
10 algorithms for long arithmetic
C Library of functions to compute addition, subtraction, multiplication, division and exponentiation (positive exponent) of integers of arbitrary length.
🔡 λ Karatsuba multiplication implemented in Haskell
Fast Multiplication algorithm for very long digit numbers.
Arbitrary-precision integers, decimals and rationals for Unleashed Pascal: signed BigInt, unsigned UBigInt, BigDecimal and BigRational in one dependency-free unit, typically within 1-4x of GMP.
Multiprecision arithmetic in cryptography.
C++20 implementation of a big integer precision arithmetic
To associate your repository with the karatsuba topic, visit your repo's landing page and select "manage topics."