{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:28:57Z","timestamp":1776828537861,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540007166","type":"print"},{"value":"9783540365525","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36552-4_21","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T23:22:37Z","timestamp":1181172157000},"page":"298-312","source":"Crossref","is-referenced-by-count":52,"title":["Improved Techniques for Fast Exponentiation"],"prefix":"10.1007","author":[{"given":"Bodo","family":"M\u00f6ller","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"21_CR1","unstructured":"American National Standards Institute (ANSI). Public key cryptography for the financial services industry: The elliptic curve digital signature algorithm (ECDSA). ANSI X9.62, 1998. 298"},{"key":"21_CR2","unstructured":"Bosma, W. Signed bits and fast exponentiation. Department of Mathematics, University of Nijmegen, Report No. 9935, 1999. 304"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology-ASIACRYPT\u2019 98","author":"H. Cohen","year":"1998","unstructured":"Cohen, H., Ono, T., and Miyaji, A. Efficient elliptic curve exponentiation using mixed coordinates. In Advances in Cryptology-ASIACRYPT\u2019 98 (1998), K. Ohta and D. Pei, Eds., vol. 1514 of Lecture Notes in Computer Science, pp. 51\u201365. 300"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D.M. Gordon","year":"1998","unstructured":"Gordon, D.M. A survey of fast exponentiation methods. Journal of Algorithms 27 (1998), 129\u2013146. 298, 302","journal-title":"Journal of Algorithms"},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-44586-2_26","volume-title":"Public Key Cryptography-PKC 2001","author":"M. Joye","year":"2001","unstructured":"Joye, M., and Tymen, C. Compact encoding of non-adjacent forms with applications to elliptic curve cryptography. In Public Key Cryptography-PKC 2001 (2001), K. Kim, Ed., vol. 1992 of Lecture Notes in Computer Science, pp. 353\u2013364. 311"},{"key":"21_CR6","unstructured":"Knuth, D. E. The Art of Computer Programming-Vol. 2: Seminumerical Algorithms (3rd ed.). Addison-Wesley, 1998. 299, 301"},{"issue":"627","key":"21_CR7","first-page":"310","volume":"5","author":"P.-J. Lee","year":"1999","unstructured":"Lee, P.-J., and Lim, C.-H. Method for exponentiation in a public-key cryptosystem. United States Patent 5,999,627, 1999. 310","journal-title":"United States Patent"},{"key":"21_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology-CRYPTO\u2019 94","author":"C. H. Lim","year":"1994","unstructured":"Lim, C. H., and Lee, P. J. More flexible exponentiation with precomputation. In Advances in Cryptology-CRYPTO\u2019 94 (1994), Y.G. Desmedt, Ed., vol. 839 of Lecture Notes in Computer Science, pp. 95\u2013107. 310"},{"key":"21_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/BFb0028484","volume-title":"Efficient elliptic curve exponentiation","author":"A. Miyaji","year":"1997","unstructured":"Miyaji, A., Ono, T., and Cohen, H. Efficient elliptic curve exponentiation. In International Conference on Information and Communications Security-ICICS\u2019 97 (1997), Y. Han, T. Okamoto, and S. Qing, Eds., vol. 1334 of Lecture Notes in Computer Science, pp. 282\u2013290. 303"},{"key":"21_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45537-X_13","volume-title":"Selected Areas in Cryptography-SAC 2001","author":"B. M\u00f6ller","year":"2001","unstructured":"M\u00f6ller, B. Algorithms for multi-exponentiation. In Selected Areas in Cryptography-SAC 2001 (2001), S. Vaudenay and A. M. Youssef, Eds., vol. 2259 of Lecture Notes in Computer Science, pp. 165\u2013180. 302, 309"},{"key":"21_CR11","unstructured":"National Institute of Standards and Technology (NIST). Digital Signature Standard (DSS). FIPS PUB 186-2, 2000. 298"},{"key":"21_CR12","unstructured":"Pippenger, N. On the evaluation of powers and related problems (preliminary version). In 17th Annual Symposium on Foundations of Computer Science (1976), IEEE Computer Society, pp. 258\u2013263. 309"},{"key":"21_CR13","doi-asserted-by":"crossref","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 1 (1960), 231\u2013308. 303","journal-title":"Advances in Computers"},{"key":"21_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/3-540-45811-5_38","volume-title":"Information Security-ISC 2002","author":"Y. Sakai","year":"2002","unstructured":"Sakai, Y., and Sakurai, K. Algorithms for efficient simultaneous elliptic scalar multiplication with reduced joint Hamming weight representation of scalars. In Information Security-ISC 2002 (2002), A.H. Chan and V. Gligor, Eds., vol. 2433 of Lecture Notes in Computer Science, pp. 484\u2013499. 309"},{"key":"21_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-44750-4_4","volume-title":"Advances in Cryptology-CRYPTO\u2019 95","author":"R. Schroeppel","year":"1995","unstructured":"Schroeppel, R., Orman, H., O\u2019Malley, S., and Spatscheck, O. Fast key exchange with elliptic curve systems. In Advances in Cryptology-CRYPTO\u2019 95 (1995), D. Coppersmith, Ed., vol. 963 of Lecture Notes in Computer Science, pp. 43\u201356. 303"},{"key":"21_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology-CRYPTO\u2019 97","author":"J.A. Solinas","year":"1997","unstructured":"Solinas, J.A. An improved algorithm for arithmetic on a family of elliptic curves. In Advances in Cryptology-CRYPTO\u2019 97 (1997), B. S. Kaliski, Jr., Ed., vol. 1294 of Lecture Notes in Computer Science, pp. 357\u2013371. 303"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"J.A. Solinas","year":"2000","unstructured":"Solinas, J.A. Efficient arithmetic on Koblitz curves. Designs, Codes and Cryptography 19 (2000), 195\u2013249. 303","journal-title":"Designs, Codes and Cryptography"},{"key":"21_CR18","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) \u2264l(n) b and lower bounds for c(r). Duke Mathematical Journal 40 (1973), 907\u2013913. 302","journal-title":"Duke Mathematical Journal"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0205008","volume":"5","author":"A. C.-C. Yao","year":"1976","unstructured":"Yao, A. C.-C. On the evaluation of powers. SIAM Journal on Computing 5 (1976), 100\u2013103. 301","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2014 ICISC 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36552-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T05:26:10Z","timestamp":1550381170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36552-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540007166","9783540365525"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36552-4_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}