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.
Type de document :
Communication dans un congrès
Raja Naeem Akram; Sushil Jajodia. 9th Workshop on Information Security Theory and Practice (WISTP), Aug 2015, Heraklion, Crete, Greece. Springer, Lecture Notes in Computer Science, LNCS-9311, pp.169-184, 2015, Information Security Theory and Practice. 〈10.1007/978-3-319-24018-3_11〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01442541
Contributeur : Hal Ifip <>
Soumis le : vendredi 20 janvier 2017 - 16:47:40
Dernière modification le : vendredi 20 janvier 2017 - 16:52:45
Document(s) archivé(s) le : vendredi 21 avril 2017 - 17:22:44

Fichier

978-3-319-24018-3_11_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Duc-Phong Le, Chik Tan, Michael Tunstall. Randomizing the Montgomery Powering Ladder. Raja Naeem Akram; Sushil Jajodia. 9th Workshop on Information Security Theory and Practice (WISTP), Aug 2015, Heraklion, Crete, Greece. Springer, Lecture Notes in Computer Science, LNCS-9311, pp.169-184, 2015, Information Security Theory and Practice. 〈10.1007/978-3-319-24018-3_11〉. 〈hal-01442541〉

Partager

Métriques

Consultations de la notice

33

Téléchargements de fichiers

2