On-line evaluation of powers using Euclid's algorithm
Srećko Brlek; Pierre Castéran; Laurent Habsieger; Richard Mallette
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1995)
- Volume: 29, Issue: 5, page 431-450
- ISSN: 0988-3754
Access Full Article
top
How to cite
topBrlek, Srećko, et al. "On-line evaluation of powers using Euclid's algorithm." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 29.5 (1995): 431-450. <http://eudml.org/doc/92517>.
@article{Brlek1995,
author = {Brlek, Srećko, Castéran, Pierre, Habsieger, Laurent, Mallette, Richard},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {addition chain},
language = {eng},
number = {5},
pages = {431-450},
publisher = {EDP-Sciences},
title = {On-line evaluation of powers using Euclid's algorithm},
url = {http://eudml.org/doc/92517},
volume = {29},
year = {1995},
}
TY - JOUR
AU - Brlek, Srećko
AU - Castéran, Pierre
AU - Habsieger, Laurent
AU - Mallette, Richard
TI - On-line evaluation of powers using Euclid's algorithm
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1995
PB - EDP-Sciences
VL - 29
IS - 5
SP - 431
EP - 450
LA - eng
KW - addition chain
UR - http://eudml.org/doc/92517
ER -
References
top- 1. A. BRAUER, On Addition Chains, Bull. Amer. Math. Soc., 1939, 45, pp. 736-739. Zbl65.0154.02MR245JFM65.0154.02
- 2. F. BERGERON, J. BERSTEL and S. BRLEK, A Unifying Approach to the Generation of Addition Chains, Proc. XV Latin American Conf. on Informatics, Santiago, Chile, July 10-14, 1989, pp. 29-38. Zbl0812.11072
- 3. F. BERGERON, J. BERSTEL and S. BRLEK, Efficient Computation of Addition Chains, J. Théorie des Nombres de Bordeaux, 1994, 6, pp. 21-38. Zbl0812.11072MR1305286
- 4. F. BERGERON, J. BERSTEL, S. BRLEK and C. DUBOC, Addition Chains Using Continued Fractions, J. Algorithms, 1989, 10, pp. 403-412. Zbl0682.68025MR1006993
- 5. F. BERGERON and J. OLIVOS, Vectorial Addition Chains Using Euclid's Algorithm, Submitted.
- 6. J. BOS and M. COSTER, Addition Chain Heuristics, Proceedings of CRYPTO 89, 1989. - Some algorithms on addition chains and their complexity Tech. Rep. Center for Mathematics and Computer Sc. Amsterdam, 1990.
- 7. S. BRLEK, P. CASTÉRAN and R. STRANDH, Chaînes d'additions et structures de contrôle, Journées JFLA 91, 28-29 janvier 1991, Gresse-en-Vercors, France, Bigre, 1991, 72, pp. 54-63.
- 8. S. BRLEK, P. CASTÉRAN and R. STRANDH, On Addition Schemes, Proceedings of TAPSOFT91, April 8-12, 1991, Brighton, England, Lect. Notes in Comp. Sci., 1991, 494, pp. 379-393.
- 9. P. DOWNEY, B. LEONG and R. SETHI, Computing Sequences with Addition Chains, SIAM J. Computing, 1981, 10, pp. 638-646. Zbl0462.68021MR623072
- 10. D. E. KNUTH, The Art of Computer Programming, vol. 2, Addison-Wesley, 1981. Zbl0477.65002MR633878
- 11. F. MORAIN and J. OLIVOS, Speeding up the computations on an elliptic curve using addition-substraction chains, RAIRO Theo. Informatics and Appl., 1990, 6, 24, pp. 531-543. Zbl0724.11068
- 12. A. SCHÖNHAGE, A Lower Bound for the Length of Addition Chains, Theoretical Comp. Sci., 1975, pp. 1-12. Zbl0307.68032
- 13. E. G. THURBER, On Addition Chains l(mn) ≤ l(n) - b and Lower Bounds for c (r), Duke Math., J., 1973, 40, pp. 907-913. Zbl0275.10027
- 14. A. C.-C. YAO, On the Evaluation of Powers, SIAM J. Comp., 1976, 9, pp. 100-103. Zbl0326.68025
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.