Montgomery modular exponentiation secured against hidden-channel attacks

摘要

The method involves drawing of a random value, and initializing variables with the aid of the random value and by utilizing a chosen module and a Montgomery variable. An algorithm enabling a loop invariant to be retained is applied by virtue of properties of a Montgomery multiplier. A result is unmasked to obtain a signature of a message.