... modular 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 operations ... routine: Step ei Step MonPro(3,3) = MonPro(8,3) = MonPro(8,8) = MonPro(4,4) = MonPro(8,l) = MonPro(7,7) = 12 o Computation of MonPro(3,3) = 3: o Computation of MonPro(8,3) = 8: t := • = t := • = ... Section we will consider that every multiplication operation always includes a subsequent reduction step In general one can follow two strategies in order to optimize the computation of (5.1) One...