CryptoDB
Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2006-21709, title={Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains}, booktitle={IACR Eprint archive}, keywords={implementation / Elliptic curve point multiplication addition chain side channel analysis fibonacci}, url={http://eprint.iacr.org/2006/216}, note={ meloni@lirmm.fr 13327 received 28 Jun 2006}, author={Meloni Nicolas}, year=2006 }