Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS
On an embedded device, an implementation of cryptographic operation, like an RSA modular exponentiation , can be attacked by side channel analysis. In particular, recent improvements on horizontal power analysis [3, 10] render ineffective the usual counter-measures which randomize the data at the very beginning of the computations [2, 4]. To counteract horizontal analysis it is necessary to randomize the computations all along the exponentiation. The leak resistant arithmetic (LRA) proposed in  implements modular arithmetic in residue number system (RNS) and randomizes the computations by randomly changing the RNS bases. We propose in this paper a variant of the LRA in RNS: we propose to change only one or a few moduli of the RNS basis. This reduces the cost of the randomization and makes it possible to be executed at each loop of a modular exponentiation.
KeywordsLeak resistant arithmetic Randomization Modular multiplication Residue number system RSA
Unable to display preview. Download preview PDF.
- 9.Montgomery, P.: Modular Multiplication Without Trial Division. Math. Computation, 519–521 (1985)Google Scholar
- 10.Perin, G., Imbert, L., Torres, L., Maurine, P.: Attacking randomized exponentiations using unsupervised learning. In: Prouff, E. (ed.) COSADE 2014. LNCS, vol. 8622, pp. 144–160. Springer, Heidelberg (2014) Google Scholar