[Resource Topic] 2011/378: A generalization of the Lucas addition chains

Welcome to the resource topic for 2011/378

Title:
A generalization of the Lucas addition chains

Authors: Amadou TALL

Abstract:

In this paper, we give a generalization of Lucas addition chains, where subtraction is allowed. We call them ‘‘Lucas addition-subtraction chain’’. We also show that this new method gives minimal addition-subtraction chains for infinitely many integers. This new method will also be used to prove that Lucas addition chains are optimal for many integers. Moreover, we show that Lucas addition chains give minimal addition chains for all integers of Hamming weight 3, like the \emph{binary method}. Finally, we give a theorem to get short (and many times minimal) Lucas addition-subtraction chains.

ePrint: https://eprint.iacr.org/2011/378

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 .