{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:01:29Z","timestamp":1725512489578},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540714309"},{"type":"electronic","value":"9783540714316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71431-6_20","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T21:06:50Z","timestamp":1180904810000},"page":"214-225","source":"Crossref","is-referenced-by-count":4,"title":["Multiplication over $\\mathbb{F}_{{p}^{m}}$ on FPGA: A Survey"],"prefix":"10.1007","author":[{"given":"Jean-Luc","family":"Beuchat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takanori","family":"Miyoshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshihito","family":"Oyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Okamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Barreto, P.S.L.M.: A note on efficient computation of cube roots in characteristic 3. Cryptology ePrint Archive, Report 2004\/305 (2004)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-36563-X_11","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"G. Bertoni","year":"2003","unstructured":"Bertoni, G., et al.: Efficient GF(p m ) arithmetic architectures for cryptographic applications. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 158\u2013175. Springer, Heidelberg (2003)"},{"key":"20_CR3","unstructured":"Beuchat, J.-L., et al.: An algorithm for the \u03b7 T pairing calculation in characteristic three and its hardware implementation. Cryptology ePrint Archive, Report 2006\/327 (2006)"},{"issue":"1\u20133","key":"20_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10440-006-9047-0","volume":"93","author":"S.E. Erdem","year":"2006","unstructured":"Erdem, S.E., Yamk, T., Ko\u00e7, \u00c7.K.: Polynomial basis multiplication over GF(2 m ). Acta Applicandae Mathematicae\u00a093(1\u20133), 33\u201355 (2006)","journal-title":"Acta Applicandae Mathematicae"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11545262_29","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"P. Grabher","year":"2005","unstructured":"Grabher, P., Page, D.: Hardware acceleration of the Tate Pairing in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 398\u2013411. Springer, Heidelberg (2005)"},{"issue":"1\u20133","key":"20_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10440-006-9072-z","volume":"93","author":"J. Guajardo","year":"2006","unstructured":"Guajardo, J., et al.: Efficient hardware implementation of finite fields with applications to cryptography. Acta Applicandae Mathematicae\u00a093(1\u20133), 75\u2013118 (2006)","journal-title":"Acta Applicandae Mathematicae"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/11545262_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"T. Kerins","year":"2005","unstructured":"Kerins, T., et al.: Efficient hardware for the Tate Pairing calculation in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 412\u2013426. Springer, Heidelberg (2005)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-540-30117-2_10","volume-title":"Field Programmable Logic and Application","author":"T. Kerins","year":"2004","unstructured":"Kerins, T., Popovici, E., Marnane, W.: Algorithms and architectures for use in FPGA implementations of identity based encryption schemes. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol.\u00a03203, pp. 74\u201383. Springer, Heidelberg (2004)"},{"issue":"10","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TC.2006.165","volume":"55","author":"S. Kumar","year":"2006","unstructured":"Kumar, S., Wollinger, T., Paar, C.: Optimum digit serial GF(2 m ) multipliers for curve-based cryptography. IEEE Transactions on Computers\u00a055(10), 1306\u20131311 (2006)","journal-title":"IEEE Transactions on Computers"},{"key":"20_CR10","volume-title":"Proceedings of the Third International Conference on Information Technology: New Generations (ITNG\u201906)","author":"R. Ronan","year":"2006","unstructured":"Ronan, R., et al.: An embedded processor for a pairing-based cryptosystem. In: Proceedings of the Third International Conference on Information Technology: New Generations (ITNG\u201906), IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Shu, C., Kwon, S., Gaj, K.: FPGA accelerated Tate pairing based cryptosystem over binary fields. Cryptology ePrint Archive, Report 2006\/179 (2006)","DOI":"10.1109\/FPT.2006.270309"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008013818413","volume":"19","author":"L. Song","year":"1998","unstructured":"Song, L., Parhi, K.K.: Low energy digit-serial\/parallel finite field multipliers. Journal of VLSI Signal Processing\u00a019(2), 149\u2013166 (1998)","journal-title":"Journal of VLSI Signal Processing"}],"container-title":["Lecture Notes in Computer Science","Reconfigurable Computing: Architectures, Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71431-6_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:19:58Z","timestamp":1605763198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71431-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540714309","9783540714316"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71431-6_20","relation":{},"subject":[]}}