... exponentiation, i.e., the computation of M^ mod n. Using one of the addition chain algorithms given in §5.4, we replace the exponentiation operation by a series of square and multiplication ... 1 0 Step 5 MonPro(3,3) = 3 MonPro(8,8) = 4 MonPro(4,4) = 1 MonPro(7,7) = 12 Step 7 MonPro(8,3) = 8 MonPro(8,l) = 7 o Computation of MonPro(3,3) = 3: o Computation of MonPro(8,3) = 8: ... 8 Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark.5.3 Modular Multiplication Operation 121 o Computation of MonPro(8,8) = 4: ^ Computation of MonPro(4,4) = 1; t-=8...