A lower bound for the length of addition chains

https://doi.org/10.1016/0304-3975(75)90008-0Get rights and content
Under an Elsevier user license
open archive

Abstract

The length l of addition chains for z is shown to be bounded from below by log2 z+ log2 s(z)−2.13, where s(z) denotes the sum of the digits in the binary expansion of z. The proof given here will also hold for addition-subtraction chains if s(z) is replaced by an appropriate substitute. At first the proof is presented in a simplified version yielding the slightly weaker result l⩾log2 z+log2 s(z)−0 (log log s(z)).

Cited by (0)