{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:32:39Z","timestamp":1761647559297},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,2,28]],"date-time":"2008-02-28T00:00:00Z","timestamp":1204156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst Sign Image Video Technol"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s11265-008-0164-z","type":"journal-article","created":{"date-parts":[[2008,2,29]],"date-time":"2008-02-29T11:16:41Z","timestamp":1204283801000},"page":"313-324","source":"Crossref","is-referenced-by-count":8,"title":["New Bit-Parallel Systolic Architectures for Computing Multiplication, Multiplicative Inversion and Division in GF(2m) Under Polynomial Basis and Normal Basis Representations"],"prefix":"10.1007","volume":"52","author":[{"given":"Chiou-Yng","family":"Lee","sequence":"first","affiliation":[]},{"given":"Che Wun","family":"Chiou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,2,28]]},"reference":[{"key":"164_CR1","volume-title":"Algebraic coding theory","author":"E. R. Berlekamp","year":"1968","unstructured":"Berlekamp, E. R. (1968). Algebraic coding theory. New York: McGraw-Hill."},{"key":"164_CR2","volume-title":"Cryptography and data security","author":"D. E. R. Denning","year":"1983","unstructured":"Denning, D. E. R. (1983). Cryptography and data security. Reading, MA: Addison-Wesley."},{"key":"164_CR3","volume-title":"Cryptography and secure communications","author":"M. Y. Rhee","year":"1994","unstructured":"Rhee, M. Y. (1994). Cryptography and secure communications. Singapore: McGraw-Hill."},{"key":"164_CR4","volume-title":"Handbook of applied cryptography","author":"A. Menezes","year":"1997","unstructured":"Menezes, A., van Oorschot, P., & Vanstone, S. (1997). Handbook of applied cryptography. Boca Raton, FL: CRC."},{"key":"164_CR5","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TC.1984.1676441","volume":"C-33","author":"C. S. Yeh","year":"1984","unstructured":"Yeh, C. S., Reed, S., & Truong, T. K. (1984). Systolic multipliers for finite fields GF(2m). IEEE Transactions on Computers, C-33, 357\u2013360.","journal-title":"IEEE Transactions on Computers"},{"issue":"13","key":"164_CR6","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1049\/el:19910738","volume":"27","author":"M. Diab","year":"1991","unstructured":"Diab, M., & Poli, A. (1991). New bit-serial systolic multiplier for GF(2m) using irreducible trinomials. Electronics Letters, 27(13), 1183\u20131184.","journal-title":"Electronics Letters"},{"key":"164_CR7","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1109\/31.135751","volume":"38","author":"C. L. Wang","year":"1991","unstructured":"Wang, C. L., & Lin, J. L. (1991). Systolic array implementation of multipliers for finite fields GF(2m). IEEE Transactions on Circuits and Systems, 38, 796\u2013800.","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"5","key":"164_CR8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/12.926154","volume":"50","author":"C. Y. Lee","year":"2001","unstructured":"Lee, C. Y., Lu, E. H., & Lee, J. Y. (2001). Bit-parallel systolic multipliers for GF(2m) fields defined by all-one and equally-spaced polynomials. IEEE Transactions on Computers, 50(5), 385\u2013393.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"164_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1049\/ip-cdt:19970660","volume":"144","author":"S. T. J. Fenn","year":"1997","unstructured":"Fenn, S. T. J., Benaissa, M., & Taylor, O. (1997). Dual basis systolic multipliers for GF(2m). IEE Proceedings Computers and Digital Techniques, 144(1), 43\u201346.","journal-title":"IEE Proceedings Computers and Digital Techniques"},{"issue":"3","key":"164_CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1049\/ip-cdt:19981938","volume":"145","author":"J. J. Wozniak","year":"1998","unstructured":"Wozniak, J. J. (1998). Systolic dual basis serial multiplier. Proceedings Computers and Digital Techniques, 145(3), 237\u2013241.","journal-title":"Proceedings Computers and Digital Techniques"},{"issue":"5","key":"164_CR11","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/12.589230","volume":"46","author":"C. C. Lu","year":"1997","unstructured":"Lu, C. C. (1997). A search of minimal key functions for normal basis multipliers. IEEE Transactions on Computers, 46(5), 588\u2013592.","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"164_CR12","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TC.2002.1004590","volume":"51","author":"A. Reyhani-Masoleh","year":"2002","unstructured":"Reyhani-Masoleh, A., & Hasan, M. A. (2002). A new construction of Massey\u2013Omura parallel multiplier over GF(2m). IEEE Transactions on Computers, 51(5), 511\u2013520.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"164_CR13","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/12.660172","volume":"47","author":"C. K. Koc","year":"1998","unstructured":"Koc, C. K., & Sunar, B. (1998). Low complexity bit-parallel canonical and normal basis multipliers for a class of finite fields. IEEE Transactions on Computers, 47(3), 353\u2013356.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"164_CR14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/12.902754","volume":"50","author":"B. Sunar","year":"2001","unstructured":"Sunar, B., & Koc, C. K. (2001). An efficient optimal normal basis type II multiplier. IEEE Transactions on Computers, 50(1), 83\u201387.","journal-title":"IEEE Transactions on Computers"},{"key":"164_CR15","unstructured":"Wang, C. C. (1986). Algorithm to design finite-field normal-basis multipliers,\u201d Tech. Report NPO-17109, NASA\u2019s Jet Propulsion Laboratory, Pasadena, CA."},{"issue":"10","key":"164_CR16","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/12.888047","volume":"49","author":"C. L. Wang","year":"2000","unstructured":"Wang, C. L., & Guo, J. H. (2000). New systolic arrays for C+AB2, inversion, and division in GF(2m). IEEE Transactions on Computers, 49(10), 1120\u20131125.","journal-title":"IEEE Transactions on Computers"},{"key":"164_CR17","unstructured":"Wei, S. W. (1995). VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2m). Proc. 1995 IEEE International Symposium Circuits and Systems, May, pp. 4203\u20134206."},{"key":"164_CR18","unstructured":"Mastrovito, E. D. (1988). VLSI architectures for multiplication over finite field GF(2m). Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes. Proc. Sixth International Conf., AAECC-6, T. Mora, Ed., Rome, July, pp. 297\u2013309."},{"key":"164_CR19","unstructured":"Mastrovito, E. D. (1991). VLSI architectures for computations in Galois fields. PhD thesis, Link\u00f6ping University, Department of Electrical Engineering, Link\u00f6ping, Sweden."},{"issue":"11","key":"164_CR20","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1109\/12.736433","volume":"47","author":"H. Wu","year":"1998","unstructured":"Wu, H., Hasan, M. A., & Blake, I. F. (1998). New low-complexity bit-parallel finite field multipliers using weakly dual bases. IEEE Transactions on Computers, 47(11), 1223\u20131234.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"164_CR21","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/12.485570","volume":"45","author":"S. T. J. Fenn","year":"1996","unstructured":"Fenn, S. T. J., Benaissa, M., & Taylor, D. (1996). GF(2m) multiplication and division over the dual basis. IEEE Transactions on Computers, 45(3), 319\u2013327.","journal-title":"IEEE Transactions on Computers"},{"key":"164_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to finite fields and their applications","author":"R. Lidl","year":"1994","unstructured":"Lidl, R., & Niederreiter, H. (1994). Introduction to finite fields and their applications. New York: Cambridge University Press."},{"key":"164_CR23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R. C. Mullin","year":"1988\/1989","unstructured":"Mullin, R. C., Onyszchuk, I. M., Vanstone, S. A., & Wilson, R. M. (1988\/1989). Optimal normal bases in GF(pn). Discrete Applied Mathemaitcs, 22, 149\u2013161.","journal-title":"Discrete Applied Mathemaitcs"},{"issue":"11","key":"164_CR24","doi-asserted-by":"crossref","first-page":"3169","DOI":"10.1093\/ietfec\/e88-a.11.3169","volume":"E88-A","author":"C. Y. Lee","year":"2005","unstructured":"Lee, C. Y., & Chiou, C. W. (2005). Design of low-complexity bit-parallel systolic Hankel multipliers to implement multiplication in normal and dual bases of GF(2m). IEICE Transactions Fundamentals, E88-A(11), 3169\u20133179.","journal-title":"IEICE Transactions Fundamentals"},{"key":"164_CR25","doi-asserted-by":"crossref","unstructured":"Kwon, S. (2003). A low complexity and a low latency bit parallel systolic multiplier over GF(2m) using an optimal normal basis of Type II. 16th IEEE Symposium Computer Arithmetic, June, pp. 196\u2013202.","DOI":"10.1109\/ARITH.2003.1207679"},{"issue":"No.3","key":"164_CR26","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1049\/ip-e.1992.0036","volume":"139","author":"M. A. Hasan","year":"1992","unstructured":"Hasan, M. A., & Bhargava, V. K. (1992). Division and bit-serial multiplication over GF(pm). IEE Proceedings Computers and Digital Techniques, 139(No.3), 230\u2013236.","journal-title":"IEE Proceedings Computers and Digital Techniques"},{"issue":"No. 6","key":"164_CR27","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"28","author":"E. Berlekamp","year":"1982","unstructured":"Berlekamp, E. (1982). Bit-serial Reed - Solomon encoders. IEEE Transactions on Information Theory, 28(No. 6), 869\u2013874.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-008-0164-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-008-0164-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-008-0164-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T08:19:27Z","timestamp":1559377167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-008-0164-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,28]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["164"],"URL":"https:\/\/doi.org\/10.1007\/s11265-008-0164-z","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,28]]}}}