{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:56:04Z","timestamp":1725566164163},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229896"},{"type":"electronic","value":"9783540301172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30117-2_98","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T09:01:02Z","timestamp":1284800462000},"page":"911-916","source":"Crossref","is-referenced-by-count":0,"title":["Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[]},{"given":"Yuichiro","family":"Shibata","sequence":"additional","affiliation":[]},{"given":"Kiyoshi","family":"Oguri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"98_CR1","doi-asserted-by":"crossref","unstructured":"Bednara, M., Daldrup, M., Gathen, J., Shokrollashi, J., Teich, J.: Reconfigurable implementation of elliptic curve crypto algorithms. In: Proc. RAW, p. 0157b (2002)","DOI":"10.1109\/IPDPS.2002.1016557"},{"issue":"206","key":"98_CR2","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp.\u00a062(206), 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"98_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"S. Galbraith","year":"2002","unstructured":"Galbraith, S., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 324\u2013337. Springer, Heidelberg (2002)"},{"key":"98_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-36552-4_20","volume-title":"Information Security and Cryptology - ICISC 2002","author":"T. Izu","year":"2003","unstructured":"Izu, T., Takagi, T.: Efficient computations of the Tate pairing for the large MOV degrees. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 283\u2013297. Springer, Heidelberg (2003)"},{"issue":"170","key":"98_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P. Montgomery","year":"1985","unstructured":"Montgomery, P.: Modular multiplication without trial division. Math. Comp.\u00a044(170), 519\u2013521 (1985)","journal-title":"Math. Comp."},{"key":"98_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-44709-1_29","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"G. Orlando","year":"2001","unstructured":"Orlando, G., Parr, C.: A scalable GF(p) elliptic curve processor architecture for programmable hardware. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 349\u2013363. Springer, Heidelberg (2001)"},{"issue":"4","key":"98_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/TC.2003.1190586","volume":"52","author":"A. Satoh","year":"2003","unstructured":"Satoh, A., Takano, K.: A scalable dual-field elliptic curve cryptographic processor. IEEE Trans. Computers\u00a052(4), 449\u2013460 (2003)","journal-title":"IEEE Trans. Computers"},{"key":"98_CR8","doi-asserted-by":"crossref","unstructured":"Silverman, J.: The arithmetic of elliptic curves, p. 106. Springer GTM (1986)","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"98_CR9","first-page":"81","volume":"1","author":"D. Suzuki","year":"2003","unstructured":"Suzuki, D., Ichikawa, T., Kasuya, T.: Montgomery multiplier on FPGA using embedded multiplier and memory. Tech. IEICE Reconf.\u00a01, 81\u201387 (2003) (in Japanese)","journal-title":"Tech. IEICE Reconf."}],"container-title":["Lecture Notes in Computer Science","Field Programmable Logic and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30117-2_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:47:14Z","timestamp":1620013634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30117-2_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229896","9783540301172"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30117-2_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}