{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:28:12Z","timestamp":1753889292070},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540658894"},{"type":"electronic","value":"9783540489108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48910-x_13","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T13:57:35Z","timestamp":1192024655000},"page":"176-189","source":"Crossref","is-referenced-by-count":23,"title":["Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic"],"prefix":"10.1007","author":[{"given":"Tetsutaro","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hikaru","family":"Morita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunio","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fumitaka","family":"Hoshino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,15]]},"reference":[{"key":"13_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 98","author":"D. V. Bailey","year":"1998","unstructured":"D. V. Bailey and C. Paar, \u201cOptimal Extension Fields for Fast Arithmetic in Public-Key Algorithms,\u201d Advances in Cryptology \u2014 CRYPTO\u2019 98, Lecture Notes in Computer Science 1462, pp.472\u2013485, Springer, 1998."},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201991","author":"N. Koblitz","year":"1992","unstructured":"N. Koblitz, \u201cCM-Curves with Good Cryptographic Properties,\u201d Advances in Cryptology \u2014 CRYPTO\u201991, Lecture Notes in Computer Science 576, pp.279\u2013287, Springer-Verlag, 1992."},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BFb0055739","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201998","author":"N. Koblitz","year":"1998","unstructured":"N. Koblitz, \u201cAn Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm,\u201d Advances in Cryptology \u2014 CRYPTO\u201998, Lecture Notes in Computer Science 1462, pp.327\u2013337, Springer-Verlag, 1998."},{"key":"13_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201997","author":"J. A. Solinas","year":"1997","unstructured":"J. A. Solinas \u201cAn Improved Algorithm for Arithmetic on a Family of Elliptic Curves,\u201d Advances in Cryptology \u2014 CRYPTO\u201997, Lecture Notes in Computer Science 1294, pp.357\u2013371, Springer, 1997."},{"key":"13_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BFb0054025","volume-title":"Public Key Cryptography: Proceedings of the First international workshop, PKC\u2019 98","author":"J. H. Cheon","year":"1998","unstructured":"J. H. Cheon, S. Park and S. Park, D. Kim, \u201cTwo Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map,\u201d Public Key Cryptography: Proceedings of the First international workshop, PKC\u2019 98, Lecture Notes in Computer Science 1431, pp.195\u2013202, Springer, 1998."},{"key":"13_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201992","author":"E. F. Brickell","year":"1993","unstructured":"E. F. Brickell, D. M. Gordon, K. S. McCurley and D. B. Wilson, \u201cFast Exponentiation with Precomputation,\u201d Advances in Cryptology \u2014 EUROCRYPT\u201992, Lecture Notes in Computer Science 658, pp.200\u2013207, Springer, 1993."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s001459900045","volume":"11","author":"V. M\u00fcller","year":"1998","unstructured":"V. M\u00fcller, \u201cFast Multiplication on Elliptic Curves over Small Fields of Characteristic Two,\u201d Journal of Cryptology (1998) 11, pp.219\u2013234, 1998.","journal-title":"Journal of Cryptology"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"J. H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, New York, 1986.","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R. Mullin","year":"1988","unstructured":"R. Mullin, I. Onyszchuk, S. Vanstone, and R. Wilson, \u201cOptimal Normal Basis in GF(pn),\u201d Discrete Applied Mathematics, 22:149\u2013161, 1988.","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR10","unstructured":"M. J. Wiener and R. J. Zuccherato, \u201cFaster Attacks on Elliptic Curve Cryptosystems,\u201d Fifth Annual Workshop on Selected Areas in Cryptography \u2014 SAC\u201998 pp.196\u2013207, Workshop Record, 1998."},{"key":"13_CR11","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 \u2014 ASIACRYPT\u201998","author":"H. Cohen","year":"1998","unstructured":"H. Cohen, A. Miyaji and T. Ono, \u201cEfficient Elliptic Curve Exponentiation Using Mixed Coordinates,\u201d Advances in Cryptology \u2014 ASIACRYPT\u201998, Lecture Notes in Computer Science 1514, pp.51\u201365, Springer-Verlag, 1998."},{"key":"13_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BFb0034836","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u201996","author":"E. Win De","year":"1996","unstructured":"E. De Win, A. Bosselaers and S. Vandenberghe, \u201cA Fast Software Implementation for Arithmetic Operations in GF(2n),\u201d Advances in Cryptology \u2014 ASIACRYPT\u201996, Lecture Notes in Computer Science 1163, pp.65\u201376, Springer-Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48910-X_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T04:12:29Z","timestamp":1550981549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48910-X_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658894","9783540489108"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48910-x_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}