Published in

Springer Verlag, Lecture Notes in Computer Science, p. 169-184

DOI: 10.1007/978-3-319-24018-3_11

Links

Tools

Export citation

Search in Google Scholar

Randomizing the Montgomery Powering Ladder

Proceedings article published in 2015 by Duc-Phong Le, Chik How Tan, Michael Tunstall
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Part 3: Secure Devices and Execution Environment ; International audience ; In this paper, we present novel randomized techniques to enhance Montgomery powering ladder. The proposed techniques increase the resistance against side-channel attacks and especially recently published correlation collision attacks in the horizontal setting. The first of these operates by randomly changing state such that the difference between registers varies, unpredictably, between two states. The second algorithm takes a random walk, albeit tightly bounded, along the possible addition chains required to compute an exponentiation. We also generalize the Montgomery powering ladder and present randomized (both left-to-right and right-to-left) m-ary exponentiation algorithms.