Research Article
Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
Algorithm 8
Multiple-precision classical multiplication,
.
Input: positive integers and having base 2 digits. | Output: the product in base 2 representation. | | (1) Compute = and = . // | (2) For from 0 up to do: . // | (3) For from 0 up to do the following: | (3.1) Set | (3.2) If then do the following: | (3.2.1) For from 0 up to do the following: | (3.2.1.1) Compute . // u is a multi-precision binary digit | (3.2.1.2) Set and . // v is a single-precision binary digit | (3.3) . | (4) Return . |
|