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

https://hal.inria.fr/hal-01442541
Contributor : Hal Ifip <>
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

File

978-3-319-24018-3_11_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

115

Files downloads

284