Constant Time Montgomery Ladder

Kaushik Nath; Palash Sarkar

Paper 2020/956 Original: eprint.iacr.org/2020/956 ↗

Constant Time Montgomery Ladder

Kaushik Nath

Palash Sarkar

Abstract

In this work various approaches for constant time conditional branching in Montgomery ladder have been studied. A previous method appearing in a code for implementing X25519 has been formalized algorithmically. This algorithm is based on a conditional select operation. We consider a variant of this algorithm which groups together operations in a more convenient manner. Further, we provide a new implementation of the conditional select operation using the cmov operation such that cmov works only on registers. This provides a better guarantee of constant time behavior.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2020-12-11: last updated; 2020-08-11: published
Short URL: https://ia.cr/2020/956
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2020/956,
      author = {Kaushik Nath and Palash Sarkar},
      title = {Constant Time Montgomery Ladder},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/956},
      year = {2020},
      url = {https://eprint.iacr.org/2020/956}
}