ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingComputational Number TheoryData ParallelismModular ArithmeticModular FormsNumber-theoretic AlgorithmsKaratsuba MultiplicationModular Arithmetic AlgorithmsModular ExponentiationModular MultiplicationModular Reduction Algorithms
In this paper, we propose a novel method of modular multiplication which embeds the modular reduction in the evaluation and interpolation parts of the Karatsuba-like multiplication. Before, the modular reduction can only be performed independently between multiplication. However, applying our method, the interpolation of the previous multiplication, modular reduction and evaluation of the next multiplication are merged as a whole step, which leads to the simplification of computations and improvement of parallelism. This method can be applied to the modular multiplication with simple moduli like NIST primes, and for general moduli, we can apply this method by using Montgomery modular multiplication instead.
11
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
Modular Multiplication Without Trial Division
Peter L. Montgomery · Mathematics of Computation · 1985 · 1.1K citations · Full text
Multiplication of Multidigit Numbers on Automata
Anatolij A. Karatsuba, Yu. Ofman · Soviet physics. Doklady · 1963 · 794 citations