Modification of bos & coster's heuristics in search of a shorter addition chain for faster exponentiation

摘要: The basic question that necessitates a study of addition chains is: What is the fewest number of multiplications necessary to compute gr, given that the only operation permitted is multiplying two already-computed powers? This is equivalent to the question: What is the length of the shortest addition chain for r?