Abstract: As a key operation in contemporary cryptosystems, modular multiplication occupies non-negligible latency and area. We first show optimizations of the k-term Karatsuba algorithm for AB/rk and ...

This is an implementation of the Karatsuba polynomial multiplication algorithm in the LEGv8 assembly language, a RISC ISA part of the ARM architecture family. This was done as my final project for ECE ...

People tend to obsess over making computer software faster. You can, of course, just crank up the clock speed and add more processors, but often the most powerful way to make something faster is to ...

Improving the efficiency of algorithms for fundamental computations can have a widespread impact, as it can affect the overall speed of a large amount of computations. Matrix multiplication is one ...

Mathematicians love a good puzzle. Even something as abstract as multiplying matrices (two-dimensional tables of numbers) can feel like a game when you try to find the most efficient way to do it.

With AlphaTensor, DeepMind Technologies has presented an AI system that is supposed to independently find novel, efficient and provably correct algorithms for complex mathematical tasks. AlphaTensor ...

Strassen's algorithm reduces matrix multiplication time complexity from O(n³) to O(n^2.81) Sounds small, but while dealing with a matrix of size 10,000, we just have to do 630B multiplication compared ...

Cannon's algorithm is a distributed algorithm for matrix multiplication that efficiently distributes the computation across multiple processes in a 2D grid configuration. This implementation focuses ...