On-line evaluation of powers using Euclid's algorithm

DOI10.1051/ita/1995290504311zbMath0838.68044OpenAlexW147505268MaRDI QIDQ4858842

Laurent Habsieger, Srečko Brlek, Richard Mallette, Pierre Castéran

Publication date: 1 February 1996

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92517

zbMATH Keywords

addition chain

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• A lower bound for the length of addition chains
• Efficient computation of addition chains
• On addition chains \(l(mn)\leq 1 (n)-b\) and lower bounds for c(r)
• Computing Sequences with Addition Chains
• On the Evaluation of Powers
• Addition chains using continued fractions
• Speeding up the computations on an elliptic curve using addition-subtraction chains