Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains

Meloni Nicolas

Paper 2006/216

Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains

Meloni Nicolas

Abstract

In this paper, we propose a new fast and secure point multiplication algorithm. It is based on a particular kind of addition chains involving only additions (no doubling), providing a natural protection against side channel attacks. Moreover, we propose new addition formulae that take into account the specific structure of those chains making point multiplication very efficient.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): meloni @ lirmm fr
History: 2006-06-29: received
Short URL: https://ia.cr/2006/216
License: CC BY

BibTeX

@misc{cryptoeprint:2006/216,
      author = {Meloni Nicolas},
      title = {Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains},
      howpublished = {Cryptology ePrint Archive, Paper 2006/216},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/216}},
      url = {https://eprint.iacr.org/2006/216}
}