[Resource Topic] 2006/216: Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains

Welcome to the resource topic for 2006/216

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

Authors: 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.

ePrint: https://eprint.iacr.org/2006/216

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .