{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:19:20Z","timestamp":1758709160015},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,5,16]],"date-time":"2015-05-16T00:00:00Z","timestamp":1431734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s13389-015-0101-6","type":"journal-article","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T06:32:57Z","timestamp":1431671577000},"page":"289-303","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Some new results on binary polynomial multiplication"],"prefix":"10.1007","volume":"5","author":[{"given":"Murat","family":"Cenk","sequence":"first","affiliation":[]},{"given":"M. Anwar","family":"Hasan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"101_CR1","doi-asserted-by":"crossref","unstructured":"Barbulescu, R., Detrey, J., Estibals, N., Zimmermann, P.: Finding optimal formulae for bilinear maps. In: WAIFI, pp. 168\u2013186 (2012)","DOI":"10.1007\/978-3-642-31662-3_12"},{"key":"101_CR2","unstructured":"Bernstein, D.J.: Minimum number of bit operations for multiplication (2013). http:\/\/binary.cr.yp.to\/m.html . Accessed 25 Jan 2013"},{"key":"101_CR3","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Batch binary edwards. In: Advances in Cryptology\u2014CRYPTO 2009, LNCS, vol. 5677, pp. 317\u2013336 (2009)","DOI":"10.1007\/978-3-642-03356-8_19"},{"key":"101_CR4","doi-asserted-by":"crossref","unstructured":"Bodrato, M.: Towards optimal toom-cook multiplication for univariate and multivariate polynomials in characteristic 2 and 0. In: WAIFI, pp. 116\u2013133 (2007)","DOI":"10.1007\/978-3-540-73074-3_10"},{"key":"101_CR5","doi-asserted-by":"crossref","unstructured":"Bodrato, M., Zanoni, A.: Integer and polynomial multiplication: towards optimal toom-cook matrices. In: ISSAC, pp. 17\u201324 (2007)","DOI":"10.1145\/1277548.1277552"},{"key":"101_CR6","unstructured":"Boyar, J., Dworkin, M., Fischer, M., Peralta, R., Visconti, A., Schiavo, C., Turan, M., Calik, C., Wood, C.: Past collaborators include: M. Bartock, B. Strackbein, C. Baker, J. Svensson, H. Gao, S. Zimmermann, and M. Bocchi. Circuit minimization work. A web page including explicit formulas for multiplication over the binary field by the Circuit Minimization Team at the Yale University (2013). http:\/\/www.cs.yale.edu\/homes\/peralta\/CircuitStuff\/CMT.html . Accessed 25 Nov 2013"},{"key":"101_CR7","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Gaudry, P., Thom\u00e9, E., Zimmermann, P.: Faster multiplication in GF(2) $$[x]$$ [ x ] . In: ANTS, pp. 153\u2013166 (2008)","DOI":"10.1007\/978-3-540-79456-1_10"},{"key":"101_CR8","doi-asserted-by":"crossref","unstructured":"Cenk, M., Ko\u00e7, \u00c7.K., \u00d6zbudak, F.: Polynomial multiplication over finite fields using field extensions and interpolation. In: IEEE Symposium on Computer Arithmetic, pp. 84\u201391 (2009)","DOI":"10.1109\/ARITH.2009.11"},{"issue":"9","key":"101_CR9","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1109\/TC.2013.105","volume":"63","author":"M Cenk","year":"2014","unstructured":"Cenk, M., Hasan, M.A., Negre, C.: Efficient subquadratic space complexity binary polynomial multipliers based on block recombination. IEEE Trans. Comput. 63(9), 2273\u20132287 (2014)","journal-title":"IEEE Trans. Comput."},{"key":"101_CR10","doi-asserted-by":"crossref","unstructured":"Cenk, M., Negre, C., Hasan, M.A.: Improved three-way split formulas for binary polynomial multiplication. In: Selected Areas in Cryptography, pp. 384\u2013398 (2011)","DOI":"10.1007\/978-3-642-28496-0_23"},{"issue":"7","key":"101_CR11","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TC.2012.96","volume":"62","author":"M Cenk","year":"2013","unstructured":"Cenk, M., Negre, C., Hasan, M.A.: Improved three-way split formulas for binary polynomial and toeplitz matrix vector products. IEEE Trans. Comput. 62(7), 1345\u20131361 (2013)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"101_CR12","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TC.2008.207","volume":"58","author":"M Cenk","year":"2009","unstructured":"Cenk, M., \u00d6zbudak, F.: Improved polynomial multiplication formulas over $${\\mathbb{F}}_2$$ F 2 using Chinese remainder theorem. IEEE Trans. Comput. 58(4), 572\u2013576 (2009)","journal-title":"IEEE Trans. Comput."},{"key":"101_CR13","doi-asserted-by":"crossref","unstructured":"Dyka, Z., Langendoerfer, P., Vater, F.: Combining multiplication methods with optimized processing sequence for polynomial multiplier in GF $$(2^k)$$ ( 2 k ) . In: WEWoRC, pp. 137\u2013150 (2011)","DOI":"10.1007\/978-3-642-34159-5_10"},{"key":"101_CR14","doi-asserted-by":"crossref","unstructured":"Dyka, Z., Langendoerfer, P., Vater, F., Peter, S.: Towards strong security in embedded and pervasive systems: energy and area optimized serial polynomial multipliers in GF $$(2^k)$$ ( 2 k ) . In: NTMS, pp. 1\u20136 (2012)","DOI":"10.1109\/NTMS.2012.6208710"},{"key":"101_CR15","doi-asserted-by":"crossref","unstructured":"Erdem, S.S., Ko\u00e7, \u00c7.K.: A less recursive variant of karatsuba-ofman algorithm for multiplying operands of size a power of two. In: IEEE Symposium on Computer Arithmetic, pp. 28\u201335 (2003)","DOI":"10.1109\/ARITH.2003.1207657"},{"issue":"1\u20133","key":"101_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10440-006-9047-0","volume":"93","author":"SS Erdem","year":"2006","unstructured":"Erdem, S.S., Yanik, T., Ko\u00e7, \u00c7.K.: Polynomial basis multiplication over GF $$(2^m)$$ ( 2 m ) . Acta Appl. Math. 93(1\u20133), 33\u201355 (2006)","journal-title":"Acta Appl. Math."},{"issue":"5","key":"101_CR17","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1109\/TC.2007.1024","volume":"56","author":"H Fan","year":"2007","unstructured":"Fan, H., Hasan, M.A.: Comments on \u201cfive, six, and seven-term Karatsuba-like formulae\u201d. IEEE Trans. Comput. 56(5), 716\u2013717 (2007)","journal-title":"IEEE Trans. Comput."},{"key":"101_CR18","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1049\/iet-ifs.2009.0039","volume":"4","author":"H Fan","year":"2010","unstructured":"Fan, H., Sun, J., Gu, M., Lam, K.-Y.: Overlap-free Karatsuba\u2013Ofman polynomial multiplication algorithms. Inf. Secur. IET 4, 8\u201314 (2010)","journal-title":"Inf. Secur. IET"},{"key":"101_CR19","first-page":"595","volume":"7","author":"AA Karatsuba","year":"1963","unstructured":"Karatsuba, A.A., Ofman, Y.: Multiplication of multidigit numbers on automata. Sov. Phys. Dokl. 7, 595\u2013596 (1963)","journal-title":"Sov. Phys. Dokl."},{"issue":"3","key":"101_CR20","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"PL Montgomery","year":"2005","unstructured":"Montgomery, P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Trans. Comput. 54(3), 362\u2013369 (2005)","journal-title":"IEEE Trans. Comput."},{"key":"101_CR21","unstructured":"Negre, C.: Improved three-way split approach for binary polynomial multiplication based on optimized reconstruction. In: Technical Report hal-00788646, Team DALI\/LIRMM, on Hyper Articles en Ligne (HAL) (2013)"},{"issue":"2","key":"101_CR22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s13389-013-0066-2","volume":"4","author":"C Negre","year":"2014","unstructured":"Negre, C.: Efficient binary polynomial multiplication based on optimized Karatsuba reconstruction. J. Cryptogr. Eng. 4(2), 91\u2013106 (2014)","journal-title":"J. Cryptogr. Eng."},{"key":"101_CR23","doi-asserted-by":"crossref","unstructured":"Chang, N.S., Kim, C.H., Park, Y.-H., Lim, J.: A non-redundant and efficient architecture for Karatsuba\u2013Ofman algorithm. In: ISC, pp. 288\u2013299 (2005)","DOI":"10.1007\/11556992_21"},{"key":"101_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1109\/TC.2004.52","volume":"53","author":"B Sunar","year":"2004","unstructured":"Sunar, B.: A generalized method for constructing subquadratic complexity GF( $$2^k$$ 2 k ) multipliers. IEEE Trans. Comput. 53, 1097\u20131105 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"101_CR25","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Shokrollahi, J.: Efficient fpga-based karatsuba multipliers for polynomials over F $$_{\\text{2 }}$$ 2 . In: Selected Areas in Cryptography, pp. 359\u2013369 (2005)","DOI":"10.1007\/11693383_25"},{"key":"101_CR26","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970364","volume-title":"Arithmetic Complexity of Computations","author":"S Winograd","year":"1980","unstructured":"Winograd, S.: Arithmetic Complexity of Computations. Society For Industrial and Applied Mathematics, Philadelphia (1980)"},{"issue":"7","key":"101_CR27","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1109\/TC.2010.46","volume":"59","author":"G Zhou","year":"2010","unstructured":"Zhou, G., Michalik, H.: Comments on \u201ca new architecture for a parallel finite field multiplier with low complexity based on composite field\u201d. IEEE Trans. Comput. 59(7), 1007\u20131008 (2010)","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"101_CR28","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1109\/TVLSI.2009.2020088","volume":"18","author":"G Zhou","year":"2010","unstructured":"Zhou, G., Michalik, H., Hinsenkamp, L.: Complexity analysis and efficient implementations of bit parallel finite field multipliers based on karatsuba-ofman algorithm on fpgas. IEEE Trans. VLSI Syst. 18(7), 1057\u20131066 (2010)","journal-title":"IEEE Trans. VLSI Syst."}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-015-0101-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-015-0101-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-015-0101-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T04:10:47Z","timestamp":1566706247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-015-0101-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,16]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["101"],"URL":"https:\/\/doi.org\/10.1007\/s13389-015-0101-6","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,16]]}}}