{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:32:49Z","timestamp":1743147169285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319017952"},{"type":"electronic","value":"9783319017969"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-01796-9_39","type":"book-chapter","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T11:32:19Z","timestamp":1375356739000},"page":"359-368","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Digit-Serial Multiplier for Shifted Polynomial Basis of GF(2 m )"],"prefix":"10.1007","author":[{"given":"Chiou-Yng","family":"Lee","sequence":"first","affiliation":[]},{"given":"Wen-Yo","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Che Wun","family":"Chiou","sequence":"additional","affiliation":[]},{"given":"Jeng-Shyang","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Cheng-Huai","family":"Ni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Digital Signature Standard, National Institute of Standards and Technology, 186-2 (January 2000)"},{"key":"39_CR2","unstructured":"IEEE Std 1363-2000, IEEE Standard Specifications for Public-Key Cryptography (January 2000)"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Adikari, J., Dimitrov, V., Cintra, R.: A New algorithm for double scalar multiplication over Koblitz curves. In: IEEE Intl Symp. Circuits and Systems (ISCAS 2011), pp. 709\u2013712 (2011)","DOI":"10.1109\/ISCAS.2011.5937664"},{"issue":"3","key":"39_CR4","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. SIAM Journal on Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-27954-6_7","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"D.F. Aranha","year":"2012","unstructured":"Aranha, D.F., Beuchat, J.-L., Detrey, J., Estibals, N.: Optimal eta pairing on supersingular genus-2 binary hyperelliptic curves. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol.\u00a07178, pp. 98\u2013115. Springer, Heidelberg (2012)"},{"issue":"2","key":"39_CR6","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/TC.2010.163","volume":"60","author":"J.-L. Beuchat","year":"2011","unstructured":"Beuchat, J.-L., Detrey, J., Estibals, N., Okamoto, E., Rodriguez-Henriquez, F.: Fast architectures for the T\n                        \n                  \u03b7\n                 pairing over smallcharacteristic supersingular elliptic curves. computers. IEEE Trans. Computers\u00a060(2), 266\u2013281 (2011)","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"39_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/TC.2005.64","volume":"54","author":"H. Fan","year":"2005","unstructured":"Fan, H., Dai, Y.: Fast bit-parallel GF(2\n                  n\n                 ) multiplier for all trinomials. IEEE Trans. Computers\u00a054(4), 485\u2013490 (2005)","journal-title":"IEEE Trans. Computers"},{"issue":"12","key":"39_CR8","doi-asserted-by":"publisher","first-page":"2606","DOI":"10.1109\/TCSI.2006.883855","volume":"53","author":"Fan","year":"2006","unstructured":"Fan, Hasan, M.: Fast bit parallel shifted polynomial basis multipliers in GF(2\n                  n\n                ). IEEE Trans. Circuits and Systems I: Regular Papers\u00a053(12), 2606\u20132615 (2006)","journal-title":"IEEE Trans. Circuits and Systems I: Regular Papers"},{"issue":"10","key":"39_CR9","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/TC.2007.1076","volume":"56","author":"Fan","year":"2007","unstructured":"Fan, Hasan, M.: Subquadratic computational complexity schemes for extended binary field multiplication using optimal normal bases. IEEE Trans. Computers\u00a056(10), 1435 (2007)","journal-title":"IEEE Trans. Computers"},{"issue":"12","key":"39_CR10","doi-asserted-by":"publisher","first-page":"2317","DOI":"10.1109\/TVLSI.2010.2075946","volume":"19","author":"S.-M. Park","year":"2011","unstructured":"Park, S.-M., Chang, K.-Y.: Fast bit-parallel shifted polynomial basis multiplier using weakly dual basis over GF(2\n                  m\n                ). IEEE Trans. Very Large Scale Integration (VLSI) Systems\u00a019(12), 2317\u20132321 (2011)","journal-title":"IEEE Trans. Very Large Scale Integration (VLSI) Systems"},{"issue":"2-3","key":"39_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.sysarc.2006.09.004","volume":"53","author":"C. Negre","year":"2007","unstructured":"Negre, C.: Efficient parallel multiplier in shifted polynomial basis. Journal of Systems Architecture\u00a053(2-3), 109\u2013116 (2007)","journal-title":"Journal of Systems Architecture"},{"issue":"2","key":"39_CR12","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1049\/iet-cdt.2010.0021","volume":"5","author":"M. Morales-Sandoval","year":"2011","unstructured":"Morales-Sandoval, M., Feregrino-Uribe, C., Kitsos, P.: Bit-serial and digit-serial GF(2\n                  m\n                ) Montgomery multipliers using linear feedback shift registers. IET Computers and Digital Techniques\u00a05(2), 86\u201394 (2011)","journal-title":"IET Computers and Digital Techniques"},{"issue":"10","key":"39_CR13","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TC.2006.165","volume":"55","author":"S. Kumar","year":"2006","unstructured":"Kumar, S., Wollinger, T., Paar, C.: Optimum digit serial GF(2\n                  m\n                ) multipliers for curve-based cryptography. IEEE Trans. Computers\u00a055(10), 1306\u20131311 (2006)","journal-title":"IEEE Trans. Computers"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-69499-1_9","volume-title":"Arithmetic of Finite Fields","author":"A. Hariri","year":"2008","unstructured":"Hariri, A., Reyhani-Masoleh, A.: Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields. In: von zur Gathen, J., Ima\u00f1a, J.L., Ko\u00e7, \u00c7.K. (eds.) WAIFI 2008. LNCS, vol.\u00a05130, pp. 103\u2013116. Springer, Heidelberg (2008)"},{"issue":"5","key":"39_CR15","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1109\/TVLSI.2009.2016753","volume":"18","author":"S. Talapatra","year":"2010","unstructured":"Talapatra, S., Rahaman, H., Mathew, J.: Low complexity digit serial systolic Montgomery multipliers for special class of GF(2\n                  m\n                ). IEEE Trans. Very Large Scale Integration (VLSI) Systems\u00a018(5), 487\u2013852 (2010)","journal-title":"IEEE Trans. Very Large Scale Integration (VLSI) Systems"},{"issue":"11","key":"39_CR16","doi-asserted-by":"publisher","first-page":"2125","DOI":"10.1109\/TVLSI.2010.2066994","volume":"19","author":"A. Hariri","year":"2011","unstructured":"Hariri, A., Reyhani-Masoleh, A.: Digit-level semi-systolic and systolic structures for the shifted polynomial basis multiplication over binary extension fields. IEEE Trans. VLSI, 8 Transaction\u00a019(11), 2125\u20132129 (2011)","journal-title":"IEEE Trans. VLSI, 8 Transaction"},{"issue":"7","key":"39_CR17","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/12.508323","volume":"45","author":"C. Paar","year":"1996","unstructured":"Paar, C.: A new architecture for a parallel finite field multiplier with low complexity based on composite fields. IEEE Trans. Computers\u00a045(7), 856\u2013861 (1996)","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"39_CR18","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"P. Montgomery","year":"2005","unstructured":"Montgomery, P.: Five, six, and seven-term karatsuba-like formulae. IEEE Trans. Computers\u00a054(3), 362\u2013369 (2005)","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"39_CR19","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1049\/iet-ifs.2010.0114","volume":"6","author":"H. Fan","year":"2012","unstructured":"Fan, H., Gu, M., Sun, J., Lam, K.-Y.: Obtaining more karatsuba-like formulae over the binary field. IET Information Security\u00a06(1), 434\u2013437 (2012)","journal-title":"IET Information Security"},{"issue":"7","key":"39_CR20","doi-asserted-by":"publisher","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. Very Large Scale Integr.\u00a018(7), 1057\u20131066 (2010)","journal-title":"IEEE Trans. Very Large Scale Integr."},{"key":"39_CR21","unstructured":"Juliano, D.P., Lima, B., Wang, Q.: A karatsuba-based algorithm for polynomial multiplication in chebyshev form. To appear in IEEE Trans. Computers (2013)"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Fan, H., Sun, J., Gu, M., Lam, K.-Y.: Overlap-free karatsuba-ofman polynomial multiplication algorithms. In: 3rd International Conference on Design and Technology of Integrated Systems in Nanoscale Era, DTIS 2008, vol.\u00a04(1), pp. 8\u201314 (2010)","DOI":"10.1049\/iet-ifs.2009.0039"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Lee, C.-Y.: Digit-serial Gaussian normal basis multiplier over GF(2\n                  m\n                ) using Toeplitz matrix-approach. In: The 20th VLSI Design\/CAD Symposium 2009, Hualien, Taiwan, August 4-7, pp. 1\u20134 (2009)","DOI":"10.1109\/CISE.2009.5366111"},{"key":"39_CR24","unstructured":"Nangate standard cell library, \n                    http:\/\/www.si2.org\/openeda.si2.org\/projects\/nangatelib\/"}],"container-title":["Advances in Intelligent Systems and Computing","Genetic and Evolutionary Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-01796-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T14:45:57Z","timestamp":1674830757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-01796-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319017952","9783319017969"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01796-9_39","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}