Paper 2013/466 Original: eprint.iacr.org/2013/466 ↗

Efficient computation of addition-subtraction chains using generalized continued Fractions

Amadou Tall
Ali Yassin Sanghare
Abstract

The aim of this paper is to present a new way of computing short addition-subtraction chains using the generalized continued fractions where subtraction is allowed. We will recover the most used ways of getting addition-subtraction chains. This method is not always optimal but gives minimal chains that are easy to compute.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
History
2013-08-02: last updated
2013-08-02: published
Short URL
https://ia.cr/2013/466
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2013/466,
      author = {Amadou Tall and Ali Yassin Sanghare},
      title = {Efficient computation of  addition-subtraction chains using generalized continued Fractions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/466},
      year = {2013},
      url = {https://eprint.iacr.org/2013/466}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.