{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:33:50Z","timestamp":1776846830029,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540243274","type":"print"},{"value":"9783540305644","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30564-4_9","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T10:39:26Z","timestamp":1268044766000},"page":"130-143","source":"Crossref","is-referenced-by-count":25,"title":["A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue"],"prefix":"10.1007","author":[{"given":"Roberto Maria","family":"Avanzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Avanzi, R.M.: On the complexity of certain multi-exponentiation techniques in cryptography. J. of Cryptology (to appear)","DOI":"10.1007\/s00145-004-0229-5"},{"key":"9_CR2","unstructured":"Bernstein, D.J.: Pippenger\u2019s exponentiation algorithm. Preprint, Available from \n                    \n                      http:\/\/cr.yp.to"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","volume":"45","author":"A. Brauer","year":"1939","unstructured":"Brauer, A.: On addition chains. Bull.\u00a0AMS.\u00a045, 736\u2013739 (1939)","journal-title":"Bull.\u00a0AMS."},{"key":"9_CR4","unstructured":"Cohen, H.: Analysis of the flexible window powering algorithm. J. of Cryptology (to appear)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/BFb0028484","volume-title":"Information and Communications Security","author":"H. Cohen","year":"1997","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 282\u2013290. Springer, Heidelberg (1997)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0210047","volume":"10","author":"P. Downey","year":"1981","unstructured":"Downey, P., Leong, B., Sethi, R.: Computing sequences with addition chains. SIAM J.\u00a0Computing\u00a010, 638\u2013646 (1981) MR 82h:68064","journal-title":"SIAM J.\u00a0Computing"},{"key":"9_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":"Erd\u0151s, P.: Remarks on number theory III. On addition chains. Acta Arith.\u00a06, 77\u201381 (1960)","journal-title":"On addition chains. Acta Arith."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D. Gordon","year":"1998","unstructured":"Gordon, D.: A Survey of Fast Exponentiation Methods. J.\u00a0of Algorithms\u00a027, 129\u2013146 (1998)","journal-title":"J.\u00a0of Algorithms"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Grabner, P.J., Heuberger, C., Prodinger, H.: Distribution results for low-weight binary representations for pairs of integers. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2004.02.012"},{"key":"9_CR10","unstructured":"Grabner, P.J., Heuberger, C., Prodinger, H., Thuswaldner, J.: Analysis of linear combination algorithms in cryptography, Preprint Available from http: \n                    \n                      http:\/\/www.opt.math.tu-graz.ac.at\/~cheub\/publications\/Windows.pdf"},{"key":"9_CR11","unstructured":"Heuberger, C., Katti, R., Prodinger, H., Ruan, X.: The Alternating Greedy Expansion and Applications to Left-To-Right Algorithms in Cryptography (preprint)"},{"issue":"7","key":"9_CR12","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/12.863044","volume":"49","author":"M. Joye","year":"2000","unstructured":"Joye, M., Yen, S.-M.: Optimal left-to-right binary signed-digit recoding. IEEE Trans.\u00a0on Comp.\u00a049(7), 740\u2013748 (2000)","journal-title":"IEEE Trans.\u00a0on Comp."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/3-540-45664-3_27","volume-title":"Public Key Cryptography","author":"M. Joye","year":"2002","unstructured":"Joye, M., Yen, S.-M.: New Minimal Modified Radix-r Representation. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 375\u2013384. Springer, Heidelberg (2002)"},{"issue":"177","key":"9_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math.\u00a0Comp.\u00a048(177), 203\u2013209 (1987)","journal-title":"Math.\u00a0Comp."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. J.\u00a0of Cryptology\u00a01, 139\u2013150 (1989)","journal-title":"J.\u00a0of Cryptology"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"9_CR17","unstructured":"Muir, J.A., Stinson, D.R.: Minimality and Other Properties of the Width-w Nonadjacent Form. Technical Report CORR 2004-08, Centre for Applied Cryptographic Research, Available from \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2004\/"},{"key":"9_CR18","unstructured":"Muir, J.A., Stinson, D.R.: New Minimal Weight Representations for Left-to-Right Window Methods. Technical Report CACR 2004-03, Centre for Applied Cryptographic Research, Available from \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2004\/"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-540-28628-8_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K. Okeya","year":"2004","unstructured":"Okeya, K., Schmidt-Samoa, K., Spahn, C., Takagi, T.: Signed binary representations revisited. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 123\u2013139. Springer, Heidelberg (2004)"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G.W. Reitwiesner","year":"1960","unstructured":"Reitwiesner, G.W.: Binary arithmetic. Advances in Computers\u00a01, 231\u2013308 (1960)","journal-title":"Advances in Computers"},{"key":"9_CR21","unstructured":"Rizzo, O.: On the complexity of the 2k-ary and of the sliding window algorithms for fast exponentiation. Rivista di Matematica dell\u2019Universit\u00e1 di Parma (to appear)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J.A. Solinas","year":"1997","unstructured":"Solinas, J.A.: An improved algorithm for arithmetic on a family of elliptic curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 357\u2013371. Springer, Heidelberg (1997)"},{"key":"9_CR23","unstructured":"Solinas, J.A.: Low-Weight Binary Representations for Pairs of Integers. Centre for Applied Cryptographic Research, University of Waterloo, Combinatorics and Optimization Research Report CORR 2001-41 (2001), Available from \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2001\/corr2001-41.ps"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-36400-5_24","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M. Stam","year":"2003","unstructured":"Stam, M., Lenstra, A.K.: Efficient subgroup exponentiation in quadratic and sixth degree extensions. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 318\u2013332. Springer, Heidelberg (2003)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1215\/S0012-7094-73-04085-4","volume":"40","author":"E.G. Thurber","year":"1973","unstructured":"Thurber, E.G.: On addition chains l(mn)\u2009\u2264\u2009l(n) b and lower bounds for c(r). Duke Math. J.\u00a040, 907\u2013913 (1973)","journal-title":"Duke Math. J."},{"key":"9_CR26","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0205008","volume":"5","author":"A.C. Yao","year":"1976","unstructured":"Yao, A.C.: On the evaluation of powers. SIAM J. Computing 5, 100\u2013103 (1976)","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30564-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:22:36Z","timestamp":1605741756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30564-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540243274","9783540305644"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30564-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}