Random Order m-ary Exponentiation

This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than a standard rightto-left m-ary exponentiation. This paper demonstrates that the random order countermeasure, commonly used to protect implementations of secret key cryptographic algorithms, can be applied to public key cryptographic algorithms.

• Type: Conference
• Year: 2009
• Where: ACISP
• Authors: Michael Tunstall
• Keywords: ACISP 2009, Key Cryptographic Algorithms, M-ary Exponentiation, M-ary Exponentiation Algorithm