{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:29:05Z","timestamp":1762032545031,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/fpl.2005.1515793","type":"proceedings-article","created":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T17:27:51Z","timestamp":1129138071000},"page":"594-597","source":"Crossref","is-referenced-by-count":5,"title":["FPGA implementation of a GF(2\/sup 4M\/) multiplier for use in pairing based cryptosystems"],"prefix":"10.1109","author":[{"given":"M.","family":"Keller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kerins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Marnane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","article-title":"Implementing the tate pairing","author":"galbraith","year":"2002","journal-title":"Proc Fifth Algorithmic Number Theory Symp (ANTS-V)"},{"key":"2","first-page":"354","article-title":"Efficient algorithms for pairing-based cryptosystems","author":"barretto","year":"2002","journal-title":"Proc CRYPTO '02"},{"key":"10","first-page":"595","article-title":"Multiplication on many-digital numbers by automatic computers","volume":"7","author":"karatsuba","year":"1963","journal-title":"Translation in Physics-Doklady"},{"key":"1","article-title":"Pairing-based cryptographic protocols: A survey","author":"dutta","year":"2004","journal-title":"Cryptology ePrint Archive"},{"key":"7","first-page":"111","article-title":"Tate pairing implementation for hyperelliptic curves y2 = xp - x + d","author":"duursma","year":"2003","journal-title":"Proc ASIACRYPT 03"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/12.805153"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/12.663762"},{"journal-title":"VLSI architectures for computation in Galois fields","year":"1991","author":"mastrovito","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008013818413"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9033-6"},{"key":"11","article-title":"From Euclid's GCD to montgomery multiplication to the great divide","volume":"tr 2001 95","author":"shantz","year":"2001","journal-title":"Technical Report of Sun Microsystems"}],"event":{"name":"International Conference on Field Programmable Logic and Applications, 2005.","location":"Tampere, Finland"},"container-title":["International Conference on Field Programmable Logic and Applications, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10158\/32467\/01515793.pdf?arnumber=1515793","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T00:02:58Z","timestamp":1497657778000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1515793\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/fpl.2005.1515793","relation":{},"subject":[]}}