{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:27:15Z","timestamp":1743042435594,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540858546"},{"type":"electronic","value":"9783540858553"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85855-3_4","type":"book-chapter","created":{"date-parts":[[2008,8,28]],"date-time":"2008-08-28T13:27:52Z","timestamp":1219930072000},"page":"39-56","source":"Crossref","is-referenced-by-count":8,"title":["Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification"],"prefix":"10.1007","author":[{"given":"Bodo","family":"M\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Rupp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"American National Standards Institute (ANSI). The elliptic curve digital signature algorithm (ECDSA). ANSI X9.62 (1998)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/11693383_21","volume-title":"Selected Areas in Cryptography","author":"A. Antipa","year":"2006","unstructured":"Antipa, A., Brown, D., Gallant, R., Lambert, R., Struik, R., Vanstone, S.: Accelerated verification of ECDSA signatures. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 307\u2013318. Springer, Heidelberg (2006)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/978-3-540-30564-4_9","volume-title":"Selected Areas in Cryptography","author":"R.M. Avanzi","year":"2004","unstructured":"Avanzi, R.M.: A note on the sliding window integer recoding and its left-to-right analogue. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 130\u2013143. Springer, Heidelberg (2004)"},{"key":"4_CR4","unstructured":"Bernstein, D.J.: Pippenger\u2019s exponentiation algorithm. Draft (2002), \n                      http:\/\/cr.yp.to\/papers.html#pippenger"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"E.F. Brickell","year":"1993","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 200\u2013207. Springer, Heidelberg (1993)"},{"key":"4_CR6","unstructured":"Certicom Research. Standards for efficient cryptography \u2013 SEC 2: Recommended elliptic curve cryptography domain parameters. Version 1.0 (2000), \n                      http:\/\/www.secg.org\/"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"H. Cohen","year":"1998","unstructured":"Cohen, H., Ono, T., Miyaji, A.: Efficient elliptic curve exponentiation using mixed coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BFb0053453","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"P. de Rooij","year":"1995","unstructured":"de Rooij, P.: Efficient exponentiation using precomputation and vector addition chains. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 389\u2013399. Springer, Heidelberg (1995)"},{"key":"4_CR9","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\u00a027, 129\u2013146 (1998)","journal-title":"Journal of Algorithms"},{"key":"4_CR10","unstructured":"Institute of Electrical and Electronics Engineers (IEEE). IEEE standard specifications for public-key cryptography. IEEE Std 1363-2000 (2000)"},{"key":"4_CR11","unstructured":"Khabbazian, M., and Gulliver, T.\u00a0A.: A new minimal average weight representation for left-to-right point multiplication methods. Cryptology ePrint Archive Report 2004\/266 (2004), \n                      http:\/\/eprint.iacr.org\/"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"C.H. Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 95\u2013107. Springer, Heidelberg (1994)"},{"key":"4_CR13","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":"A. Miyaji","year":"1997","unstructured":"Miyaji, A., Ono, T., Cohen, H.: Efficient elliptic curve exponentiation. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 282\u2013290. Springer, Heidelberg (1997)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45537-X_13","volume-title":"Selected Areas in Cryptography","author":"B. M\u00f6ller","year":"2001","unstructured":"M\u00f6ller, B.: Algorithms for multi-exponentiation. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 165\u2013180. Springer, Heidelberg (2001)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-36552-4_21","volume-title":"Information Security and Cryptology - ICISC 2002","author":"B. M\u00f6ller","year":"2003","unstructured":"M\u00f6ller, B.: Improved techniques for fast exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 298\u2013312. Springer, Heidelberg (2003)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/11496618_11","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B. M\u00f6ller","year":"2005","unstructured":"M\u00f6ller, B.: Fractional windows revisited: Improved signed-digit representations for efficient exponentiation. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 137\u2013153. Springer, Heidelberg (2005)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/978-3-540-30574-3_25","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"J.A. Muir","year":"2005","unstructured":"Muir, J.A., Stinson, D.R.: New minimal weight representations for left-to-right window methods. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 366\u2013383. Springer, Heidelberg (2005)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1090\/S0025-5718-05-01769-2","volume":"75","author":"J.A. Muir","year":"2006","unstructured":"Muir, J.A., Stinson, D.R.: Minimality and other properties of the width-w nonadjacent form. Mathematics of Computation\u00a075, 369\u2013384 (2006)","journal-title":"Mathematics of Computation"},{"key":"4_CR19","unstructured":"National Institute of Standards and Technology (NIST). Digital Signature Standard (DSS). FIPS PUB 186-2 (2000)"},{"key":"4_CR20","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":"4_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01776581","volume":"12","author":"N. Pippenger","year":"1979","unstructured":"Pippenger, N.: The minimum number of edges in graphs with prescribed paths. Mathematical Systems Theory\u00a012, 325\u2013346 (1979)","journal-title":"Mathematical Systems Theory"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0209022","volume":"9","author":"N. Pippenger","year":"1980","unstructured":"Pippenger, N.: On the evaluation of powers and monomials. SIAM Journal on Computing\u00a09, 230\u2013250 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TC.2006.3","volume":"55","author":"K. Schmidt-Samoa","year":"2006","unstructured":"Schmidt-Samoa, K., Semay, O., Takagi, T.: Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems. IEEE Transactions on Computers\u00a055, 48\u201357 (2006)","journal-title":"IEEE Transactions on Computers"},{"key":"4_CR24","unstructured":"Struik, M., Brown, D.R., Vanstone, S.A., Gallant, R.P., Antipa, A., Lambert, R.J.: Accelerated verification of digital signatures and public keys. United States Patent Application Publication US 2007\/0064932 A1 (2007)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85855-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:38:31Z","timestamp":1715312311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85855-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540858546","9783540858553"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85855-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}