Paper 2015/657

Randomizing the Montgomery Powering Ladder

Duc-Phong Le, Chik How Tan, and Michael Tunstall

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
Published elsewhere. Minor revision. WISTP 2015
Keywords
side channel analysis
Contact author(s)
mike tunstall @ yahoo co uk
History
2015-07-02: revised
2015-07-02: received
See all versions
Short URL
https://ia.cr/2015/657
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2015/657}},
      url = {https://eprint.iacr.org/2015/657}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.