(b) If there is a ?-bit exponent ? with ቒ
௞
ଶ
ቓ bits of “1”, where ⌈ ⌉ denotes a
ceiling function. How many times of multiplications in this algorithm to
calculate ?
௘ mod ?. Please explain your answer. (10%)