On-line evaluation of powers using Euclid's algorithm

DOI10.1051/ITA/1995290504311MaRDI QIDQ4858842zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On the Evaluation of Powers
• Addition chains using continued fractions
• Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
• Calculating optimal addition chains
• On Evaluation of Powers

Cites work

• A lower bound for the length of addition chains
• Addition chains using continued fractions
• Computing Sequences with Addition Chains
• Efficient computation of addition chains
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• On addition chains l(mn) 1 (n)-b and lower bounds for c(r)
• On the Evaluation of Powers
• Speeding up the computations on an elliptic curve using addition-subtraction chains

Cited in

(2)

• On the Evaluation of Powers
• Addition chains using continued fractions

This page was built for publication: On-line evaluation of powers using Euclid's algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858842)