{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:07:23Z","timestamp":1758892043601},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"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":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00034-018-0884-7","type":"journal-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T13:54:19Z","timestamp":1529502859000},"page":"774-790","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Analysis of Systolic Penalties and Design of Efficient Digit-Level Systolic-like Multiplier for Binary Extension Fields"],"prefix":"10.1007","volume":"38","author":[{"given":"Bimal K.","family":"Meher","sequence":"first","affiliation":[]},{"given":"Pramod K.","family":"Meher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"issue":"4","key":"884_CR1","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1109\/49.17708","volume":"7","author":"T Beth","year":"1989","unstructured":"T. Beth, D. Gollmann, Algorithm engineering for public key algorithms. IEEE J. Sel. Areas Commun. 7(4), 458\u2013465 (1989)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"884_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1049\/ip-cdt:19981906","volume":"145","author":"JH Guo","year":"1998","unstructured":"J.H. Guo, C.L. Wang, Digit-serial systolic multiplier for finite fields \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                  . IEE Proc. Comput. Digital Tech. 145(2), 143\u2013148 (1998)","journal-title":"IEE Proc. Comput. Digital Tech."},{"key":"884_CR3","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2003","unstructured":"D. Hankerson, A. Menezes, S. Vanstone, Guide to Elliptic Curve Cryptography (Springer, Berlin, Heidelberg, 2003)"},{"issue":"11","key":"884_CR4","doi-asserted-by":"publisher","first-page":"2125","DOI":"10.1109\/TVLSI.2010.2066994","volume":"19","author":"A Hariri","year":"2011","unstructured":"A. Hariri, A.R. Masoleh, Digit-level semi-systolic and systolic structures for the shifted polynomial basis multiplication over binary extension fields. IEEE Trans. Very Large Scale Integr. Syst. (VLSI) 19(11), 2125\u20132129 (2011)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst. (VLSI)"},{"issue":"12","key":"884_CR5","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1109\/TC.2003.1252850","volume":"52","author":"FR Henriguez","year":"2003","unstructured":"F.R. Henriguez, C.K. Koc, Parallel multipliers based on special irreducible pentanomials. IEEE Trans. Comput. 52(12), 1535\u20131542 (2003)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"884_CR6","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/12.2212","volume":"37","author":"IS Hsu","year":"1988","unstructured":"I.S. Hsu, T.K. Truong, L.J. Deutsch, I.S. Reed, A comparison of VLSI architecture of finite field multipliers using dual, normal, or Standard bases. IEEE Trans. Comput. 37(6), 735\u2013739 (1988)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"884_CR7","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/TC.2006.69","volume":"55","author":"JL Imana","year":"2006","unstructured":"J.L. Imana, J.M. Sanchez, F. Tirado, Bit-parallel finite field multipliers for irreducible trinomials. IEEE Trans. Computers. 55(5), 520\u2013533 (2006)","journal-title":"IEEE Trans. Computers."},{"issue":"1","key":"884_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/92.661252","volume":"6","author":"SK Jain","year":"1998","unstructured":"S.K. Jain, L. Song, K.K. Parhi, Efficient semisystolic architectures for finite-field arithmetic. IEEE Trans. Very Large Scale Integr. Syst. (VLSI) 6(1), 101\u2013113 (1998)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst. (VLSI)"},{"issue":"4","key":"884_CR9","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/TVLSI.2004.842923","volume":"13","author":"CH Kim","year":"2005","unstructured":"C.H. Kim, C.P. Hong, S. Kwon, A digit-serial multiplier for finite field \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                  . IEEE Trans. Very Large Scale Integr. Syst. (VLSI) 13(4), 476\u2013483 (2005)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst. (VLSI)"},{"issue":"1","key":"884_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1049\/ip-cdt:20030061","volume":"150","author":"CY Lee","year":"2003","unstructured":"C.Y. Lee, Low complexity bit-parallel systolic multiplier over \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                   using irreducible trinomials. IEE Proc. Comput. Digit. Tech. 150(1), 39\u201342 (2003)","journal-title":"IEE Proc. Comput. Digit. Tech."},{"issue":"9","key":"884_CR11","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1109\/TC.2005.147","volume":"54","author":"CY Lee","year":"2005","unstructured":"C.Y. Lee, J.S. Horng, I.C. Jou, E.H. Lu, Low complexity bit parallel systolic Montgomery multipliers for special class of \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                  . IEEE Trans. Comput. 54(9), 1061\u20131070 (2005)","journal-title":"IEEE Trans. Comput."},{"key":"884_CR12","volume-title":"Introduction to Finite Fields and their Applications","author":"R Lidl","year":"1986","unstructured":"R. Lidl, H. Niederreiter, Introduction to Finite Fields and their Applications (Cambridge University Press, Cambridge, 1986)"},{"key":"884_CR13","unstructured":"J. Lopez, R. Dahab, An Overview of Elliptic Curve Cryptography. Technical Report IC-00-10, State University of Campinas, Brazil (2000)"},{"issue":"8","key":"884_CR14","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TC.2004.47","volume":"53","author":"AR Masoleh","year":"2004","unstructured":"A.R. Masoleh, M.A. Hasan, Low complexity bit parallel architectures for polynomial basis multiplication over \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                  . IEEE Trans. Comput. 53(8), 945\u2013959 (2004)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"884_CR15","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1109\/TCSI.2008.916622","volume":"55","author":"PK Meher","year":"2008","unstructured":"P.K. Meher, Systolic and super-systolic multipliers for finite field \n                    \n                      \n                    \n                    $${GF(2^m)}$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                   based on irreducible trinomials. IEEE Trans. Circuits Syst. I Regul. Pap. 55(4), 1031\u20131040 (2008)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"884_CR16","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1007\/s00034-013-9553-z","volume":"32","author":"BK Meher","year":"2013","unstructured":"B.K. Meher, P.K. Meher, An efficient look-up table-based approach for multiplication over \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                   generated by trinomials. Circuits Signals Signal Process. 32, 2623\u20132638 (2013)","journal-title":"Circuits Signals Signal Process."},{"key":"884_CR17","unstructured":"National Institute of Standards and Technology (NIST). \n                    http:\/\/www.csrc.nist.gov\/publications"},{"issue":"1","key":"884_CR18","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/JSAC.1986.1146305","volume":"4","author":"PA Scott","year":"1986","unstructured":"P.A. Scott, S.E. Tavares, L.E. Peppard, A Fast VLSI multiplier for \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                  . IEEE J. Sel. Areas Commun. 4(1), 62\u201366 (1986)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"884_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008013818413","volume":"19","author":"L Song","year":"1998","unstructured":"L. Song, K.K. Parhi, Low-energy digit-serial\/parallel finite field multipliers. J. VLSI SDignal Process. Syst. Signal Image Video Technol. 19, 149\u2013166 (1998)","journal-title":"J. VLSI SDignal Process. Syst. Signal Image Video Technol."},{"key":"884_CR20","unstructured":"W. Tang, H. Wu, M. Ahmadi, VLSI implementation of bit-parallel word-serial multiplier in \n                    \n                      \n                    \n                    $$GF(2^{233})$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            233\n                          \n                          )\n                        \n                      \n                    \n                  , in Third International IEEE-NEWCAS Conference, 399\u2013402 (2005)"},{"issue":"7","key":"884_CR21","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1109\/31.135751","volume":"38","author":"CL Wang","year":"1991","unstructured":"C.L. Wang, J.L. Lin, Systolic array implementation of multipliers for finite fields \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                  . IEEE Trans. Circuits Syst. 38(7), 796\u2013800 (1991)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"884_CR22","doi-asserted-by":"crossref","unstructured":"H. Wu, Low complexity bit-parallel multiplier for a class of finite fields, in Proceedings of International Conference on Communications, Circuits and Systems, vol. 4, pp. 565\u2013568 (2006)","DOI":"10.1109\/ICCCAS.2006.285197"},{"issue":"5","key":"884_CR23","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/TCSII.2014.2386260","volume":"62","author":"J Xie","year":"2015","unstructured":"J. Xie, P.K. Meher, Z. Mao, High-throughput digit-level systolic multiplier over \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                   based on irreducible trinomials. IEEE Trans. Circuits Syst. II Exp. Briefs 62(5), 481\u2013485 (2015)","journal-title":"IEEE Trans. Circuits Syst. II Exp. Briefs"},{"issue":"4","key":"884_CR24","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/TC.1984.1676441","volume":"C\u201333","author":"CS Yeh","year":"1984","unstructured":"C.S. Yeh, I.S. Reed, T.K. Truong, Systolic multipliers for finite fields \n                    \n                      \n                    \n                    $$GF(2^m)$$\n                    \n                      \n                        \n                          G\n                          F\n                          (\n                          \n                            2\n                            m\n                          \n                          )\n                        \n                      \n                    \n                  . IEEE Trans. Comput. C\u201333(4), 357\u2013360 (1984)","journal-title":"IEEE Trans. Comput."}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-018-0884-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-018-0884-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-018-0884-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T23:08:36Z","timestamp":1560985716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-018-0884-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["884"],"URL":"https:\/\/doi.org\/10.1007\/s00034-018-0884-7","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"10 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}