{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T11:03:33Z","timestamp":1730286213043,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/ntms.2012.6208710","type":"proceedings-article","created":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T21:14:34Z","timestamp":1339017274000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Towards Strong Security in Embedded and Pervasive Systems: Energy and Area Optimized Serial Polynomial Multipliers in GF(2k)"],"prefix":"10.1109","author":[{"given":"Zoya","family":"Dyka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Langendoerfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Vater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steffen","family":"Peter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"15"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2007.364469"},{"year":"0","key":"14"},{"key":"11","article-title":"Algorithmically determining the optimum polynomial multiplier in GF(2k)","author":"dyka","year":"0","journal-title":"WEWORC 2011"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.67"},{"key":"3","first-page":"595","volume":"7","year":"1963","journal-title":"Physics-doklady"},{"key":"2","first-page":"293","article-title":"Multiplication of Many-Digital Numbers by Automatic Computers","volume":"145","author":"karatsuba","year":"0","journal-title":"Doklady Akad Nauk SSSR"},{"key":"1","article-title":"Generalizations of the Karatsuba Algorithm for Efficient Implementations","author":"weimerskirch","year":"2006","journal-title":"Cryptology"},{"key":"10","first-page":"359","article-title":"Efficient FPGA-based Karatsuba multipliers for polynomials over F2","volume":"3897","author":"von zur gathen","year":"2006","journal-title":"LNCS"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1024"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.49"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.52"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970364"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.233"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2009.11"}],"event":{"name":"2012 5th International Conference on New Technologies, Mobility and Security (NTMS)","start":{"date-parts":[[2012,5,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2012,5,10]]}},"container-title":["2012 5th International Conference on New Technologies, Mobility and Security (NTMS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6203453\/6203739\/06208710.pdf?arnumber=6208710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T14:15:02Z","timestamp":1490105702000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6208710\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ntms.2012.6208710","relation":{},"subject":[],"published":{"date-parts":[[2012,5]]}}}