This chapter concerns the naive multiplication algorithms and their non-trivial advanced counterparts which all take the form of DnC strategy. Assuming we are multiplying two n-digit numbers x and y; ...

Matrix Multiplication in C We implement a cache-optmized version of standard matrix multiplication (O(n^3)). We also implement an optimized version of Strassen's matrix multiplication algorithm ...

A hardwired algorithm for computing the variable precision multiplication is presented in this paper. The computation method is based on the use of a parallel multiplier of size m to compute the ...

In this paper, we provide a triple scalar multiplication analogue of the simultaneous double scalar Schoenmakers' algorithm for multiexponentiation. We analyse this algorithm to show that on the ...

Montgomery Multiplication: An algorithm that efficiently computes modular multiplication by eliminating the need for explicit division, via a transformation into a specialised domain.