Randomizing the Montgomery Powering Ladder - Information Security Theory and Practice Access content directly
Conference Papers Year : 2015

Randomizing the Montgomery Powering Ladder

Duc-Phong Le
  • Function : Author
  • PersonId : 999001
Chik How Tan
  • Function : Author
  • PersonId : 999002
Michael Tunstall
  • Function : Author
  • PersonId : 999003


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.
Fichier principal
Vignette du fichier
978-3-319-24018-3_11_Chapter.pdf (342.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01442541 , version 1 (20-01-2017)





Duc-Phong Le, Chik How 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⟩
49 View
93 Download



Gmail Facebook X LinkedIn More