{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:37:59Z","timestamp":1725485879486},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540007166"},{"type":"electronic","value":"9783540365525"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36552-4_19","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T19:22:37Z","timestamp":1181157757000},"page":"264-282","source":"Crossref","is-referenced-by-count":5,"title":["New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms"],"prefix":"10.1007","author":[{"given":"Tae-Jun","family":"Park","sequence":"first","affiliation":[]},{"given":"Mun-Kyu","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"Advances in Cryptology-CRYPTO 98","author":"D.V. Bailey","year":"1998","unstructured":"D.V. Bailey and C. Paar. Optimal extension fields for fast arithmetic in public key algorithms. In Advances in Cryptology-CRYPTO 98, volume 1462 of LNCS,pages 472\u2013485. Springer-Verlag, 1998. 264, 265, 275"},{"issue":"3","key":"19_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"D.V. Bailey","year":"2001","unstructured":"D.V. Bailey and C. Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology, 14(3):153\u2013176, 2001. 264, 265, 275, 276","journal-title":"Journal of Cryptology"},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BFb0054025","volume-title":"Public Key Cryptography 98","author":"J.H. Cheon","year":"1998","unstructured":"J.H. Cheon, S. Park, S. Park, and D. Kim. Two efficient algorithms for arithmetic of elliptic curves using Frobenius map. In Public Key Cryptography 98, volume1431 of LNCS, pages 195\u2013202. Springer-Verlag, 1998. 264"},{"key":"19_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology-CRYPTO 2001","author":"R. Gallant","year":"2001","unstructured":"R. Gallant, R. Lambert, and S. Vanstone. Faster point multiplication on elliptic curves with efficient endomorphisms. In Advances in Cryptology-CRYPTO 2001, volume 2139 of LNCS, pages 190\u2013200. Springer-Verlag, 2001. 264, 265, 266, 271, 277"},{"key":"19_CR5","unstructured":"G.H. Hardy and E.M. Wright.An Introduction to the Theory of Numbers. Oxford University Press, 3rd edition, 1954. 267, 279"},{"issue":"4","key":"19_CR6","first-page":"679","volume":"A","author":"T. Kobayashi","year":"2000","unstructured":"T. Kobayashi. Base-\u00f8 method for elliptic curves over OEF. IEICE Trans. Fundamentals, E83-A(4):679\u2013686, 2000. 264, 265, 271, 272, 275","journal-title":"IEICE Trans. Fundamentals"},{"key":"19_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-48910-X_13","volume-title":"Advances in Cryptology-EUROCRYPT 99","author":"T. Kobayashi","year":"1999","unstructured":"T. Kobayashi, H. Morita, K. Kobayashi, and F. Hoshino. Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic. In Advances in Cryptology-EUROCRYPT 99, volume 1592 of LNCS, pages 176\u2013189. Springer-Verlag, 1999. 264, 265, 271, 272, 276"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203\u2013209, 1987. 264","journal-title":"Mathematics of Computation"},{"key":"19_CR9","series-title":"Lect Notes Comput Sci","first-page":"279","volume-title":"Advances in Cryptology-CRYPTO 91","author":"N. Koblitz","year":"1991","unstructured":"N. Koblitz. CM-curves with good cryptographic properties. In Advances in Cryptology-CRYPTO 91, volume 576 of LNCS, pages 279\u2013287. Springer-Verlag, 1991. 264"},{"key":"19_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/10719994_9","volume-title":"Information Security and Cryptology-ICISC 99","author":"C.H. Lim","year":"1999","unstructured":"C.H. Lim and H. S. Hwang. Speeding up elliptic scalar multiplication with precomputation. In Information Security and Cryptology-ICISC 99, volume 1787 of LNCS, pages 102\u2013119. Springer-Verlag, 1999. 264, 265, 271, 273"},{"key":"19_CR11","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 94","author":"C. H. Lim","year":"1994","unstructured":"C. H. Lim and P. J. Lee. More flexible exponentiation with precomputation. In Advances in Cryptology-CRYPTO 94, volume 839 of LNCS, pages 95\u2013107. Springer-Verlag, 1994. 264, 273, 281"},{"key":"19_CR12","series-title":"Lect Notes Comput Sci","first-page":"333","volume-title":"Advances in Cryptology-CRYPTO 92","author":"W. Meier","year":"1992","unstructured":"W. Meier and O. Staffelbach. Efficient multiplication on certain non-supersingular elliptic curves. In Advances in Cryptology-CRYPTO 92, volume 740 of LNCS, pages 333\u2013344. Springer-Verlag, 1992. 264"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"A. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993. 265","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"19_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology-CRYPTO 85","author":"V. Miller","year":"1986","unstructured":"V. Miller. Use of elliptic curves in cryptography. In Advances in Cryptology-CRYPTO 85, volume 218 of LNCS, pages 417\u2013428. Springer-Verlag, 1986. 264"},{"key":"19_CR15","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":"B. M\u00f6ller. Algorithms for multi-exponentiation. In Selected Areas in Cryptography-SAC 2001, volume 2259 of LNCS, pages 165\u2013180. Springer-Verlag, 2001. 277"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"F. Morain","year":"1990","unstructured":"F. Morain and J. Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications, 24:531\u2013543, 1990. 264","journal-title":"Theoretical Informatics and Applications"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s001459900045","volume":"11","author":"V. M\u00fcller","year":"1998","unstructured":"V. M\u00fcller. Fast multiplication on elliptic curves over small fields of characteristic two. Journal of Cryptology, 11:219\u2013234, 1998. 264","journal-title":"Journal of Cryptology"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"J.R. Silverman. The Arithmetic of Elliptic Curves. Springer-Verlag, 1986. 265, 267","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/PL00003820","volume":"12","author":"N.P. Smart","year":"1999","unstructured":"N.P. Smart. Elliptic curve cryptosystems over small fields of odd characteristic. Journal of Cryptology, 12:141\u2013151, 1999. 264, 266, 272, 275","journal-title":"Journal of Cryptology"},{"key":"19_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology-CRYPTO 97","author":"J.A. Solinas","year":"1997","unstructured":"J.A. Solinas. An improved algorithm for arithmetic on a family of elliptic curves. In Advances in Cryptology-CRYPTO 97, volume 1294 of LNCS, pages 357\u2013371. Springer-Verlag, 1997. 264"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"J.A. Solinas","year":"2000","unstructured":"J.A. Solinas. Efficient arithmetic on Koblitz curves. Designs, Codes and Cryptography, 19:195\u2013249, 2000. 264","journal-title":"Designs, Codes and Cryptography"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T00:09:37Z","timestamp":1550362177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36552-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540007166","9783540365525"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-36552-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}