{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:56:29Z","timestamp":1742403389242},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673804"},{"type":"electronic","value":"9783540455684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719994_9","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T20:38:40Z","timestamp":1167511120000},"page":"102-119","source":"Crossref","is-referenced-by-count":9,"title":["Speeding Up Elliptic Scalar Multiplication with Precomputation"],"prefix":"10.1007","author":[{"given":"Chae Hoon","family":"Lim","sequence":"first","affiliation":[]},{"given":"Hyo Sun","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D.V. Bailey","year":"1998","unstructured":"Bailey, D.V., Paar, C.: Optimal extension field for fast arithmetic in public key algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 472\u2013485. Springer, Heidelberg (1998)"},{"unstructured":"Bailey, D.V., Paar, C.: Inversion in Optimal Extension Fields. In: presented at The Mathematics of Public-Key Cryptography (June 1999) (see also Elliptic curve cryptosystems over large characteristic extension fields by the same authors, preprint, 1999)","key":"9_CR2"},{"key":"9_CR3","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.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 200\u2013207. Springer, Heidelberg (1993)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BFb0054025","volume-title":"Public Key Cryptography","author":"J.H. Cheon","year":"1998","unstructured":"Cheon, J.H., Park, S.M., Park, S.W., Kim, D.H.: Two efficient algorithms for arithmetic of elliptic curves using Frobenius map. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 195\u2013202. Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"Cohen, H.: A course in computational number theory. Graduate Texts in Math, vol.??138. Springer, Heidelberg (1993);","key":"#cr-split#-9_CR5.1","DOI":"10.1007\/978-3-662-02945-9"},{"unstructured":"Third corrected printing (1996)","key":"#cr-split#-9_CR5.2"},{"key":"9_CR6","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_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., Miyaji, A., Ono, T.: 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":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/BFb0052247","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Guajardo","year":"1997","unstructured":"Guajardo, J., Paar, C.: Efficient algorithms for elliptic curve cryptosystems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 342\u2013356. Springer, Heidelberg (1997)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-48910-X_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"T. Kobayashi","year":"1999","unstructured":"Kobayashi, T., Morita, H., Kobayashi, K., Hoshino, F.: Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 176\u2013189. Springer, Heidelberg (1999)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"N. Koblitz","year":"1992","unstructured":"Koblitz, N.: CM curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 279\u2013287. Springer, Heidelberg (1992)"},{"key":"9_CR11","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":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BFb0052240","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"C.H. Lim","year":"1997","unstructured":"Lim, C.H., Lee, P.J.: A key recovery attack on discrete log-based schemes using a prime order subgroup. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 249\u2013263. Springer, Heidelberg (1997)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-46588-1_27","volume-title":"Public Key Cryptography","author":"C.H. Lim","year":"2000","unstructured":"Lim, C.H., Hwang, H.S.: Fast implementation of elliptic curve arithmetic in GF(p n ). In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751. Springer, Heidelberg (2000)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-48892-8_16","volume-title":"Selected Areas in Cryptography","author":"J. Lopez","year":"1999","unstructured":"Lopez, J., Dahab, R.: Improved algorithms for elliptic curve arithmetic in GF(2 n ). In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 201\u2013212. Springer, Heidelberg (1999)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/3-540-48071-4_24","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"W. Meier","year":"1993","unstructured":"Meier, W., Staffelbach, O.: Efficient multiplication on certain non-supersingular elliptic curves. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 333\u2013344. Springer, Heidelberg (1993)"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s001459900045","volume":"11","author":"V. Muller","year":"1998","unstructured":"Muller, V.: Fast multiplication on elliptic curves over small fields of characteristic two. J. of Cryptology\u00a011(4), 219\u2013234 (1998)","journal-title":"J. of Cryptology"},{"key":"9_CR17","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. Rooij de","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":"9_CR18","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_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48892-8_15","volume-title":"Selected Areas in Cryptography","author":"M.J. Wiener","year":"1999","unstructured":"Wiener, M.J., Zuccherato, R.J.: Faster attacks on elliptic curve cryptosystems. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 190\u2013200. Springer, Heidelberg (1999)"},{"unstructured":"IEEE P1363: Standard Specifications for Public Key Cryptography, Working Draft (August 1999)","key":"9_CR20"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719994_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:58:51Z","timestamp":1556020731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719994_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673804","9783540455684"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/10719994_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}