HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Randomizing the Montgomery Powering Ladder

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, January 20, 2017 - 4:47:40 PM
Last modification on : Friday, January 20, 2017 - 4:52:45 PM
Long-term archiving on: : Friday, April 21, 2017 - 5:22:44 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Duc-Phong Le, Chik Tan, Michael Tunstall. Randomizing the Montgomery Powering Ladder. 9th Workshop on Information Security Theory and Practice (WISTP), Aug 2015, Heraklion, Crete, Greece. pp.169-184, ⟨10.1007/978-3-319-24018-3_11⟩. ⟨hal-01442541⟩



Record views


Files downloads