Cryptology ePrint Archive: Report 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.

Category / Keywords: implementation / Elliptic curve point multiplication addition chain side channel analysis fibonacci

Date: received 28 Jun 2006

Contact author: meloni at lirmm fr

Available format(s): PDF | BibTeX Citation

Version: 20060629:031721 (All versions of this report)

Short URL: ia.cr/2006/216

Discussion forum: Show discussion | Start new discussion