{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:23:31Z","timestamp":1729617811133,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/arith.2009.11","type":"proceedings-article","created":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T10:37:39Z","timestamp":1251455859000},"page":"84-91","source":"Crossref","is-referenced-by-count":12,"title":["Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation"],"prefix":"10.1109","author":[{"given":"Murat","family":"Cenk","sequence":"first","affiliation":[]},{"given":"Cetin Kaya","family":"Koc","sequence":"additional","affiliation":[]},{"given":"Ferruh","family":"Ozbudak","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","author":"bu?rgisser","year":"1997","journal-title":"Algebraic Complexity Theory"},{"key":"2","first-page":"116","article-title":"towards optimal toom-cook multiplication for univariate and multivariated polynomials in characteristic 2 and 0","author":"bodrato","year":"2007","journal-title":"Proc WAIFI 2007 LNCS 4547"},{"journal-title":"Generalizations of the Karatsuba Algorithm for Polynomial Multiplication","year":"0","author":"weimerskirch","key":"10"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277552"},{"key":"7","volume":"2","author":"knuth","year":"1981","journal-title":"The Art of Computer Programming Seminumerical Algorithms"},{"key":"6","first-page":"595","article-title":"multiplication of multidigit numbers by automata","volume":"7","author":"karatsuba","year":"1963","journal-title":"Soviet Physics-Doklady"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1024"},{"key":"4","first-page":"51","author":"cook","year":"1966","journal-title":"On the Minimum Computation Time of Functions"},{"key":"9","first-page":"714","article-title":"the complexity scheme of functional elements realizing the multiplication of integers","volume":"3","author":"toom","year":"1963","journal-title":"Journal of Soviet Mathematics"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.49"}],"event":{"name":"2009 IEEE 19th IEEE Symposium on Computer Arithmetic (ARITH)","start":{"date-parts":[[2009,6,8]]},"location":"Portland, OR, USA","end":{"date-parts":[[2009,6,10]]}},"container-title":["2009 19th IEEE Symposium on Computer Arithmetic"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5223291\/5223292\/05223351.pdf?arnumber=5223351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T19:16:20Z","timestamp":1497813380000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5223351\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/arith.2009.11","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}