{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:10:34Z","timestamp":1725570634956},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174001"},{"type":"electronic","value":"9783642174018"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17401-8_17","type":"book-chapter","created":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T11:36:50Z","timestamp":1291203410000},"page":"227-237","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity"],"prefix":"10.1007","author":[{"given":"Sedat","family":"Akleylek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murat","family":"Cenk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferruh","family":"\u00d6zbudak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45353-9_19","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Brown","year":"2001","unstructured":"Brown, M., Hankerson, D., Lopez, J., Menezes, A.: Software Implementation of the NIST Elliptic Curves over Prime Fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 250\u2013265. Springer, Heidelberg (2001)"},{"key":"17_CR2","volume-title":"Algebraic Combinatorics","author":"C.D. Godsil","year":"1993","unstructured":"Godsil, C.D.: Algebraic Combinatorics. Chapman Hall\/CRC Mathematics Series, Boca Raton (1993)"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TC.2007.19","volume":"56-2","author":"H. Fan","year":"2007","unstructured":"Fan, H., Hasan, M.A.: A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields. IEEE Trans. on Computers\u00a056-2, 224\u2013233 (2007)","journal-title":"IEEE Trans. on Computers"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-69499-1_8","volume-title":"Arithmetic of Finite Fields","author":"M.A. Hasan","year":"2008","unstructured":"Hasan, M.A., Negre, C.: Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. In: von zur Gathen, J., Ima\u00f1a, J.L., Ko\u00e7, \u00c7.K. (eds.) WAIFI 2008. LNCS, vol.\u00a05130, pp. 88\u2013102. Springer, Heidelberg (2008)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Hasan, M.A., Negre, C.: Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. IEEE Trans. on Computers (2010) (to appear) doi: 10.1109\/TC.2010.132","DOI":"10.1109\/TC.2010.132"},{"key":"17_CR6","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"17_CR7","volume-title":"Introduction to Finite Fields and Their Applications","author":"R. Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University, Cambridge (1997)"},{"key":"17_CR8","volume-title":"Applications of Finite Fields","author":"A. Menezes","year":"1993","unstructured":"Menezes, A., Blake, I., Gao, X., Mullen, R., Vanstone, S., Yaghobian, T.: Applications of Finite Fields. Kluwer Academic, Boston (1993)"},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/041","volume-title":"Finite Fields and Applications","author":"G. Mullen","year":"2007","unstructured":"Mullen, G., Mummert, C.: Finite Fields and Applications. American Mathematical Society, Providence (2007)"},{"key":"17_CR10","unstructured":"National Institute of Standards and Technology, Recommended Elliptic curves for Federal Government Use (1999)"},{"key":"17_CR11","unstructured":"Sage: Open Source Mathematics Software, The Sage Group, \n                    \n                      http:\/\/www.sagemath.org"},{"key":"17_CR12","unstructured":"Standards for Efficient Cryptography Group (SECG), SEC 2: Recommended Elliptic Curve Domain Parameters (2010)"},{"key":"17_CR13","unstructured":"Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba Algorithm for Efficient Implementations (2006), \n                    \n                      http:\/\/eprint.iacr.org\/2006\/224"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17401-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T14:50:42Z","timestamp":1547909442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17401-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174001","9783642174018"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17401-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}