{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:42:08Z","timestamp":1725478928616},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540687993"},{"type":"electronic","value":"9783540688006"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11958239_10","type":"book-chapter","created":{"date-parts":[[2007,1,25]],"date-time":"2007-01-25T06:17:36Z","timestamp":1169705856000},"page":"147-156","source":"Crossref","is-referenced-by-count":0,"title":["Compressed Jacobian Coordinates for OEF"],"prefix":"10.1007","author":[{"given":"Fumitaka","family":"Hoshino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsutaro","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazumaro","family":"Aoki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_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 fields for fast arithmetic in public-key algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 472\u2013485. Springer, Heidelberg (1998)"},{"key":"10_CR2","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":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-45600-7_8","volume-title":"Information and Communications Security","author":"K. Aoki","year":"2001","unstructured":"Aoki, K., Hoshino, F., Kobayashi, T.: A cyclic window algorithm for ECC defined over extension fields. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol.\u00a02229, pp. 62\u201373. Springer, Heidelberg (2001)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1093\/ietfec\/e89-a.1.134","volume":"E89-A","author":"T. Kobayashi","year":"2006","unstructured":"Kobayashi, T., Aoki, K., Imai, H.: Efficient algorithms for Tate pairing. IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences (Japan)\u00a0E89-A, 134\u2013143 (2006)","journal-title":"IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences (Japan)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2\n                    m\n                  ) using normal bases. Information and Computation\u00a078, 171\u2013177 (1988)","journal-title":"Information and Computation"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"D.J. Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 207\u2013228. Springer, Heidelberg (2006)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44499-8_1","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"D. Hankerson","year":"2000","unstructured":"Hankerson, D., Hernandez, J.L., Menezes, A.: Software implementation of elliptic curve cryptography over binary fields. In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 1\u201324. Springer, Heidelberg (2000)"},{"key":"10_CR8","unstructured":"Kumagai, M.: Efficient implementation of Hessian-form elliptic curve cryptosystem with SIMD instructions. In: The 2005 Symposium on Cryptography and Information Security (SCIS 2005), The Institute of Electronics, Information and Communication Engineers, Maiko, Kobe, Japan, pp. 1651\u20131656 (2005) (in Japanese)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - VIETCRYPT 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11958239_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:50:55Z","timestamp":1558284655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11958239_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540687993","9783540688006"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11958239_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}