{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T16:36:35Z","timestamp":1770222995737,"version":"3.49.0"},"reference-count":14,"publisher":"EDP Sciences","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1995]]},"DOI":"10.1051\/ita\/1995290504311","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:17:57Z","timestamp":1486030677000},"page":"431-450","source":"Crossref","is-referenced-by-count":2,"title":["On-line evaluation of powers using Euclid's algorithm"],"prefix":"10.1051","volume":"29","author":[{"given":"Sre\u0107ko","family":"Brlek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Cast\u00e9ran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Habsieger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Mallette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BRAUER A., On Addition Chains, Bull. Amer. Math. Soc., 1939, 45, pp. 736-739.65.0154.0224565.0154.02","DOI":"10.1090\/S0002-9904-1939-07068-7"},{"key":"R2","unstructured":"2. BERGERON F., BERSTEL J. and BRLEK S., 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.0812.11072"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. BERGERON F., BERSTEL J. and BRLEK S., Efficient Computation of Addition Chains, J. Th\u00e9orie des Nombres de Bordeaux, 1994, 6, pp. 21-38.24753113052860812.11072","DOI":"10.5802\/jtnb.104"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. BERGERON F., BERSTEL J., BRLEK S. and DUBOC C., Addition Chains Using Continued Fractions, J. Algorithms, 1989, 10, pp. 403-412.10069930682.68025","DOI":"10.1016\/0196-6774(89)90036-9"},{"key":"R5","unstructured":"5. BERGERON F. and OLIVOS J., Vectorial Addition Chains Using Euclid's Algorithm, Submitted."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. BOS J. and COSTER M., 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.","DOI":"10.1007\/0-387-34805-0_37"},{"key":"R7","unstructured":"7. BRLEK S., CAST\u00c9RAN P. and STRANDH R., Cha\u00eenes d'additions et structures de contr\u00f4le, Journ\u00e9es JFLA 91, 28-29 janvier 1991, Gresse-en-Vercors, France, Bigre, 1991, 72, pp. 54-63."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. BRLEK S., CAST\u00c9RAN P. and STRANDH R., On Addition Schemes, Proceedings of TAPSOFT91, April 8-12, 1991, Brighton, England, Lect. Notes in Comp. Sci., 1991, 494, pp. 379-393.","DOI":"10.1007\/3540539816_77"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. DOWNEY P., LEONG B. and SETHI R., Computing Sequences with Addition Chains, SIAM J. Computing, 1981, 10, pp. 638-646.6230720462.68021","DOI":"10.1137\/0210047"},{"key":"R10","unstructured":"10. KNUTH D. E., The Art of Computer Programming, vol. 2, Addison-Wesley, 1981.6338780477.65002"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. MORAIN F. and OLIVOS J., Speeding up the computations on an elliptic curve using addition-substraction chains, RAIRO Theo. Informatics and Appl., 1990, 6, 24, pp. 531-543.923740724.11068","DOI":"10.1051\/ita\/1990240605311"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. SCH\u00d6NHAGE A., A Lower Bound for the Length of Addition Chains, Theoretical Comp. Sci., 1975, pp. 1-12.0307.68032","DOI":"10.1016\/0304-3975(75)90008-0"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. THURBER E. G., On Addition Chains l(mn) \u2264 l(n) - b and Lower Bounds for c (r), Duke Math., J., 1973, 40, pp. 907-913.0275.10027","DOI":"10.1215\/S0012-7094-73-04085-4"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. YAO A. C.-C., On the Evaluation of Powers, SIAM J. Comp., 1976, 9, pp. 100-103.0326.68025","DOI":"10.1137\/0205008"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1995290504311\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T02:01:42Z","timestamp":1568772102000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1995290504311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":14,"journal-issue":{"issue":"5"},"alternative-id":["ita1995290504311"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1995290504311","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}