{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T05:42:54Z","timestamp":1776231774589,"version":"3.50.1"},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Electron. Express"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/elex.14.20170458","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T18:14:04Z","timestamp":1496254444000},"page":"20170458-20170458","source":"Crossref","is-referenced-by-count":21,"title":["Efficient unified semi-systolic arrays for multiplication and squaring over &lt;i&gt;GF&lt;\/i&gt;(2&lt;i&gt;&lt;sup&gt;m&lt;\/sup&gt;&lt;\/i&gt;)"],"prefix":"10.1587","volume":"14","author":[{"given":"Kee-Won","family":"Kim","sequence":"first","affiliation":[{"name":"Department of Applied Computer Engineering, Dankook University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jae-Dong","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Software Science, Dankook University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] R. E. Blahut: <i>Theory and Practice of Error Control Codes<\/i> (Addison-Wesley, Reading, MA, 1983)."},{"key":"2","unstructured":"[2] A. J. Menezes, <i>et al.<\/i>: <i>Handbook of Applied Cryptography<\/i> (CRC Press, Boca Raton, FL, 1996)."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] C. W. Chiouet al.: \u201cConcurrent error detection in Montgomery multiplication over <i>GF<\/i>(2<i><sup>m<\/sup><\/i>),\u201d IEICE Trans. Fundamentals <b>E89-A<\/b> (2006) 566 (DOI: 10.1093\/ietfec\/e89-a.2.566).","DOI":"10.1093\/ietfec\/e89-a.2.566"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] W. T. Huanget al.: \u201cConcurrent error detection and correction in a polynomial basis multiplier over <i>GF<\/i>(2<i><sup>m<\/sup><\/i>),\u201d IET Inf. Secur. <b>4<\/b> (2010) 111 (DOI: 10.1049\/iet-ifs.2009.0160).","DOI":"10.1049\/iet-ifs.2009.0160"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] K. W. Kim and J. C. Jeon: \u201cPolynomial basis multiplier using cellular systolic architecture,\u201d J. Inst. Electron. Telecommun. Eng. <b>60<\/b> (2014) 194 (DOI: 10.1080\/03772063.2014.914699).","DOI":"10.1080\/03772063.2014.914699"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] S. H. Choi and K. J. Lee: \u201cEfficient systolic modular multiplier\/squarer for fast exponentiation over <i>GF<\/i>(2<i><sup>m<\/sup><\/i>),\u201d IEICE Electron. Express <b>12<\/b> (2015) 20150222 (DOI: 10.1587\/elex.12.20150222).","DOI":"10.1587\/elex.12.20150222"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] K. W. Kim and J. C. Jeon: \u201cA semi-systolic Montgomery multiplier over <i>GF<\/i>(2<i><sup>m<\/sup><\/i>),\u201d IEICE Electron. Express <b>12<\/b> (2015) 20150769 (DOI: 10.1587\/elex.12.20150769).","DOI":"10.1587\/elex.12.20150769"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] P. Montgomery: \u201cModular multiplication without trial division,\u201d Math. Comput. <b>44<\/b> (1985) 519 (DOI: 10.1090\/S0025-5718-1985-0777282-X).","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"9","unstructured":"[9] C. Koc and T. Acar: \u201cMontgomery multiplication in <i>GF<\/i>(2<i><sup>k<\/sup><\/i>),\u201d Des. Codes Cryptogr. <b>14<\/b> (1998) 57 (DOI: 10.1023\/A:1008208521515)."},{"key":"10","unstructured":"[10] M. E. Kaihara and N. Takagi: \u201cBipartite modular multiplication,\u201d CHES <b>3659<\/b> (2005) 201 (DOI: 10.1007\/11545262_15)."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] M. E. Kaihara and N. Takagi: \u201cBipartite modular multiplication method,\u201d IEEE Trans. Comput. <b>57<\/b> (2008) 157 (DOI: 10.1109\/TC.2007.70793).","DOI":"10.1109\/TC.2007.70793"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] P. A. Scottet al.: \u201cArchitectures for exponentiation in <i>GF<\/i>(2<i><sup>m<\/sup><\/i>),\u201d IEEE J. Sel. Areas Commun. <b>6<\/b> (1988) 578 (DOI: 10.1109\/49.1927).","DOI":"10.1109\/49.1927"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] K. J. Lee and K. Y. Yoo: \u201cLinear systolic multiplier\/squarer for fast exponentiation,\u201d Inf. Process. Lett. <b>76<\/b> (2000) 105 (DOI: 10.1016\/S0020-0190(00)00131-9).","DOI":"10.1016\/S0020-0190(00)00131-9"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] J. C. Ha and S. J. Moon: \u201cA common-multiplicand method to the Montgomery algorithm for speeding up exponentiation,\u201d Inf. Process. Lett. <b>66<\/b> (1998) 105 (DOI: 10.1016\/S0020-0190(98)00031-3).","DOI":"10.1016\/S0020-0190(98)00031-3"},{"key":"15","unstructured":"[15] D. E. Knuth: <i>The Art of Computer Programming, Seminumerical Algorithms<\/i>, vol. II (Addison-Wesley, MA, 1997)."}],"container-title":["IEICE Electronics Express"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/elex\/14\/12\/14_14.20170458\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T23:35:20Z","timestamp":1498865720000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/elex\/14\/12\/14_14.20170458\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":15,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/elex.14.20170458","relation":{},"ISSN":["1349-2543"],"issn-type":[{"value":"1349-2543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}