Efficient computation of addition chains

@inproceedings{Bergron2007EfficientCO,
  title={Efficient computation of addition chains},
  author={Fr{\'e}d{\'e}ric Berg{\'e}ron and Jean Berstel and Srecko Brlek},
  year={2007}
}
The aim of this paper is to present a unifying approach to the computation of short addition chains. Our method is based upon continued fraction expansions. Most of the popular methods for the generation of addition chains, such as the binary method, the factor method, etc..., fit in our framework. However, we present new and better algorithms. We give a general upper bound for the complexity of continued fraction methods, as a function of a chosen strategy, thus the total number of operations… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

On addition chains l(mn) ~ l(n) - b and lower bounds for c(r)

  • E. G. Thurber
  • Duke Math. J. 40 (1973), 907-913. 38 [14] A. C…
  • 1976
Highly Influential
5 Excerpts

On addition chains

  • A. Brauer
  • Bull. Amer. Math. Soc. 45
  • 1939
Highly Influential
16 Excerpts

A unifying approach to the generation of addition chains

  • F. Bergeron, J. Berstel, S. Brlek
  • Proc. XV Latin American Conf. on Informatics…
  • 1989
1 Excerpt

Vectorial addition chains using Euclid ’ s algorithm , Research Report , Dpt

  • J. Olivos F. Bergeron
  • Math . , UQAM
  • 1989

Vectorial addition chains using Euclid’s algorithm

  • F. Bergeron, J. Olivos
  • Research Report, Dpt. Math., UQAM 105
  • 1989
3 Excerpts

Systematic method for determining the number of multiplications required to compute xm

  • I. Semba
  • where m is a positive integer, J. Information…
  • 1983
1 Excerpt

Similar Papers

Loading similar papers…