Efficient computation of  addition-subtraction chains using generalized continued Fractions

Amadou Tall; Ali Yassin Sanghare

Paper 2013/466

Efficient computation of addition-subtraction chains using generalized continued Fractions

Amadou Tall and 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: Published elsewhere. International Journal of Mathematical Research
Keywords: addition-subtraction chains non-adjacent form scalar multiplication double-and-add method vector chains continued fractions Euclidean algorithm.
Contact author(s): amadou tall @ aims-senegal org
History: 2013-08-02: received
Short URL: https://ia.cr/2013/466
License: CC BY

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},
      note = {\url{https://eprint.iacr.org/2013/466}},
      url = {https://eprint.iacr.org/2013/466}
}