{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T15:33:46Z","timestamp":1770219226948,"version":"3.49.0"},"publisher-location":"New York, NY","reference-count":23,"publisher":"Springer New York","isbn-type":[{"value":"9780387973173","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_37","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T21:05:53Z","timestamp":1194555953000},"page":"400-407","source":"Crossref","is-referenced-by-count":66,"title":["Addition Chain Heuristics"],"prefix":"10.1007","author":[{"given":"Jurjen","family":"Bos","sequence":"first","affiliation":[]},{"given":"Matthijs","family":"Coster","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","first-page":"765","volume":"70","author":"R. Bellman","year":"1963","unstructured":"R. Bellman: Advanced problem 5125, Amer. Math. Monthly 70 (1963), 765.","journal-title":"Amer. Math. Monthly"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0196-6774(89)90036-9","volume":"10","author":"F. Bergeron","year":"1989","unstructured":"F. Bergeron, J. Berstel, S. Brlek, C. Duboc: Addition Chains Using Continued Fractions, Journal of Algorithms 10, (1989), 403\u2013412.","journal-title":"Journal of Algorithms"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","volume":"45","author":"A. Brauen","year":"1939","unstructured":"A. Brauen On addition chains, Bull. Am. Math. Soc. 45 (1939), 736\u2013739.","journal-title":"Bull. Am. Math. Soc."},{"key":"37_CR4","first-page":"A-476","volume":"20","author":"A. Cottrell","year":"1973","unstructured":"A. Cottrell: A lower bound for the Scholz-Brauer problem, Notices AMS, Abst. #73T-A200, 20 (1973), A-476.","journal-title":"A lower bound for the Scholz-Brauer problem"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1137\/0209011","volume":"9","author":"D. Dobkin","year":"1980","unstructured":"D. Dobkin and R. J. Lipton: Addition chain methods for the evaluation of specific polynomials, Siam J. Comput. 9 (1980), 121\u2013125.","journal-title":"Siam J. Comput."},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0210047","volume":"3","author":"P. Downey","year":"1981","unstructured":"P. Downey, B. Leony and R. Sethi: Computing sequences with addition chains, Siam Journ. Comput. 3 (1981), 638\u2013696.","journal-title":"Siam Journ. Comput."},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.4064\/aa-6-1-77-81","volume":"6","author":"P. Erd\u0151s","year":"1960","unstructured":"P. Erd\u0151s: Remarks on number theory III, on addition chains, Acta Arith. 6 (1960), 77\u201381.","journal-title":"Acta Arith"},{"key":"37_CR8","unstructured":"A. Fiat: Batch RSA, Abstracts Crypto\u2019 89, to be published."},{"key":"37_CR9","unstructured":"A. A. Gioia and M. V. Subbarao: The Scholz-Brauer problem in addition chains II, Proc. eighth Manitoba conference on numerical math. and computing, (1978), 251\u2013274."},{"key":"37_CR10","first-page":"398","volume-title":"The art of computer programming, Vol. 2, Seminumerical algorithms","author":"D. E. Knuth","year":"1969","unstructured":"D. E. Knuth: The art of computer programming, Vol. 2, Seminumerical algorithms, Addison-Wesley, Reading, Mass., (1969), pp. 398\u2013419."},{"key":"37_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"P. J. Laarhoven van","year":"1987","unstructured":"P. J. van Laarhoven and E. H. L. Aarts: Simulated Annealing: Theory and Applications, D. Reidel Publishing Company, Dordrecht, 1987."},{"key":"37_CR12","first-page":"203","volume":"295","author":"J. Leeuwen van","year":"1977","unstructured":"J. van Leeuwen: An extension of Hansen\u2019s theorem for star chains, J. Reine Angew. Math. 295 (1977), 203\u2013207.","journal-title":"J. Reine Angew. Math."},{"key":"37_CR13","unstructured":"H. W. Lenstra, jr.: Factoring integers with elliptic curves, Report 86-18, Universiteit van Amsterdam, 1986."},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0196-6774(81)90003-1","volume":"2","author":"J. Olivos","year":"1981","unstructured":"J. Olivos: On Vectorial Addition Chains, J. of Algorithms 2 (1981), 13\u201321.","journal-title":"J. of Algorithms"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(75)90008-0","volume":"1","author":"A. Sch\u00f6nhage","year":"1975","unstructured":"A. Sch\u00f6nhage: A lower bound on the length of addition chains, Theoret Comput. Sci. 1 (1975), 1\u201312.","journal-title":"Theoret Comput. Sci."},{"key":"37_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.2140\/pjm.1973.49.229","volume":"49","author":"E. G. Thurber","year":"1973","unstructured":"E. G. Thurber: The Scholz-Brauer problem on addition chains, Pacific J. Math. 49 (1973), 229\u2013242.","journal-title":"Pacific J. Math."},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1215\/S0012-7094-73-04085-4","volume":"40","author":"E. G. Thurber","year":"1973","unstructured":"E. G. Thurber: On addition chains l(mn) \u2264 l(n)-b and lower bounds for c(r), Duke Math. J. 40 (1973), 907\u2013913.","journal-title":"Duke Math. J."},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0012-365X(76)90105-9","volume":"16","author":"E. G. Thurber","year":"1976","unstructured":"E. G. Thurber: Addition chains and solutions of l(2n) = l(n) and l(2n\u22121) = n+l(n)\u22121, Discr. Math. 16 (1976), 279\u2013289.","journal-title":"Discr. Math."},{"key":"37_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/00207168708803586","volume":"22","author":"Y. H. Tsai","year":"1987","unstructured":"Y. H. Tsai and Y. H. Chin: A study of some addition chain problems, Intern. J. Comp. Math. 22 (1987), 117\u2013134.","journal-title":"Intern. J. Comp. Math."},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0097-3165(75)90098-9","volume":"19","author":"E. Vegh","year":"1975","unstructured":"E. Vegh: A note on addition chains, J. Comb. Th. (A) 19 (1975), 117\u2013118.","journal-title":"J. Comb. Th."},{"key":"37_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0020-0190(85)90085-7","volume":"20","author":"H. Volger","year":"1985","unstructured":"H. Volger. Some results on addition\/subtraction chains, Inf. Proc. Lett. 20 (1985), 155\u2013160.","journal-title":"Inf. Proc. Lett."},{"key":"37_CR22","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2307\/2007633","volume":"39","author":"H. C. Williams","year":"1982","unstructured":"H. C. Williams, A p+ 1 method of factoring. Math. Comp. 39 (1982), 225\u2013234","journal-title":"Math. Comp."},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Andrew Yao, On the evaluation of powers, Siam J. Comput. 5, (1976).","DOI":"10.1137\/0205008"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T01:28:16Z","timestamp":1619486896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_37","relation":{},"subject":[]}}