Paper 2015/657 Original: eprint.iacr.org/2015/657 ↗
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.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2015-07-02: last updated
- 2015-07-02: published
- Short URL
- https://ia.cr/2015/657
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/657,
author = {Duc-Phong Le and Chik How Tan and Michael Tunstall},
title = {Randomizing the Montgomery Powering Ladder},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/657},
year = {2015},
url = {https://eprint.iacr.org/2015/657}
}