{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:49:50Z","timestamp":1649083790673},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1007\/s11390-006-0887-x","type":"journal-article","created":{"date-parts":[[2006,12,22]],"date-time":"2006-12-22T06:26:24Z","timestamp":1166768784000},"page":"887-892","source":"Crossref","is-referenced-by-count":6,"title":["Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation"],"prefix":"10.1007","volume":"21","author":[{"given":"Chiou-Yng","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jenn-Shyong","family":"Horng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I-Chang","family":"Jou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"887_CR1","volume-title":"The Theory of Error-Correcting Codes","author":"F J Macwilliams","year":"1977","unstructured":"Macwilliams F J, Sloane N J A. The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977."},{"key":"887_CR2","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. Introduction to Finite Fields and Their Applications. New York: Cambridge Univ. Press, 1994."},{"issue":"4","key":"887_CR3","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TC.1984.1676441","volume":"33","author":"C S Yeh","year":"1984","unstructured":"Yeh C S, Reed S, Truong T K. Systolic multipliers for finite fields GF(2 m ). IEEE Trans. Computers, 1984, 33(4): 357\u2013360.","journal-title":"IEEE Trans. Computers"},{"issue":"5","key":"887_CR4","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. Bit-parallel systolic multipliers for GF(2 m ) fields defined by all-one and equally-spaced polynomials. IEEE Trans. Computers, 2001, 50(5): 385\u2013393.","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"887_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1049\/ip-cdt:20030061","volume":"150","author":"C Y Lee","year":"2003","unstructured":"Lee C Y. Low complexity bit-parallel systolic multiplier over GF(2 m ) using irreducible trinomials. IEE Computers and Digital Techniques, 2003, 150(1): 39\u201342.","journal-title":"IEE Computers and Digital Techniques"},{"issue":"11","key":"887_CR6","first-page":"2844","volume":"E86-A","author":"C Y Lee","year":"2003","unstructured":"Lee C Y. Low-latency bit-parallel systolic multiplier for irreducible x m +x n +1 with gcd(m, n) = 1. IEICE Trans. Fundamentals, 2003, E86-A(11): 2844\u20132852.","journal-title":"IEICE Trans. Fundamentals"},{"issue":"7","key":"887_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. Systolic array implementation of multipliers for GF(2 m ). IEEE Trans. Circuits and Systems II, 1991, 38(7): 796\u2013800.","journal-title":"IEEE Trans. Circuits and Systems II"},{"issue":"1","key":"887_CR8","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. Dual basis systolic multipliers for GF(2 m ). IEE Computers and Digital Techniques, 1997, 144(1): 43\u201346.","journal-title":"IEE Computers and Digital Techniques"},{"key":"887_CR9","unstructured":"Massey J L, Omura J K. Computational method and apparatus for finite field arithmetic. U.S. Patent Number 4.587.627, 1986."},{"issue":"8","key":"887_CR10","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/TC.1985.1676616","volume":"34","author":"C C Wang","year":"1985","unstructured":"Wang C C, Truong T K, Shao H M et al. VLSI architectures for computing multiplications and inverses in GF(2 m ). IEEE Trans. Computers, 1985, 34(8): 709\u2013717.","journal-title":"IEEE Trans. Computers"},{"issue":"10","key":"887_CR11","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/12.888054","volume":"49","author":"S Oh","year":"2000","unstructured":"Oh S, Kim C H, Lim J, Cheon D H. Efficient normal basis multipliers in composite fields. IEEE Trans. Computers, 2000, 49(10): 1133\u20131138.","journal-title":"IEEE Trans. Computers"},{"issue":"23","key":"887_CR12","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1049\/el:20020960","volume":"38","author":"H Fan","year":"2002","unstructured":"Fan H, Dai Y. Key function of normal basis multipliers in GF(2 n ). Electronics Letters, 2002, 38(23): 1431\u20131432.","journal-title":"Electronics Letters"},{"issue":"11","key":"887_CR13","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"28","author":"E R Berlekamp","year":"1982","unstructured":"Berlekamp E R. Bit-serial Reed-Solomon encoder. IEEE Trans. Inform. Theory, 1982, 28(11): 869\u2013874.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"887_CR14","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1109\/18.45274","volume":"35","author":"M Morii","year":"1989","unstructured":"Morii M, Kasahara M, Whiting D L. Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields. IEEE Trans. Inform. Theory, 1989, 35(6): 1177\u20131183.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"887_CR15","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. GF(2 m ) multiplication and division over the dual basis. IEEE Trans. Computers, 1996, 45(3): 319\u2013327.","journal-title":"IEEE Trans. Computers"},{"issue":"10","key":"887_CR16","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/12.35840","volume":"38","author":"C C Wang","year":"1989","unstructured":"Wang C C. An algorithm to design finite field multipliers using a self-dual normal basis. IEEE Trans. Computers, 1989, 38(10): 1457\u20131459.","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"887_CR17","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1137\/0403012","volume":"3","author":"M Wang","year":"1990","unstructured":"Wang M, Blake I F. Bit serial multiplication in finite fields. SIAM J. Disc. Math., 1990, 3(1): 140\u2013148.","journal-title":"SIAM J. Disc. Math."},{"issue":"13","key":"887_CR18","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1049\/el:19910738","volume":"27","author":"M Diab","year":"1991","unstructured":"Diab M, Poli A. New bit-serial systolic multiplier for GF(2 m ) using irreducible trinomials. Electronics Letters, 1991, 27(13): 1183\u20131184.","journal-title":"Electronics Letters"},{"issue":"2","key":"887_CR19","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/12.262128","volume":"43","author":"S W Wei","year":"1994","unstructured":"Wei S W. A systolic power-sum circuit for GF(2 m ). IEEE Trans. Computers, 1994, 43(2): 226\u2013229.","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"887_CR20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1049\/ip-cds:20030337","volume":"150","author":"N Y Kim","year":"2003","unstructured":"Kim N Y, Kim H S, Yoo K Y. Computation of AB 2 multiplication in GF(2 m ) using low-complexity systolic architecture. IEE Proc. Circuits Devices Syst., 2003, 150(2): 119\u2013123.","journal-title":"IEE Proc. Circuits Devices Syst."},{"issue":"9","key":"887_CR21","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1109\/TC.2005.147","volume":"54","author":"C Y Lee","year":"2005","unstructured":"Lee C Y, Horng J S, Jou I C. Low-complexity bit-parallel systolic montgomery multipliers for special classes of GF(2 m ). IEEE Trans. Computers, 2005, 54(9): 1061\u20131070.","journal-title":"IEEE Trans. Computers"},{"issue":"5","key":"887_CR22","first-page":"519","volume":"50","author":"C Y Lee","year":"2001","unstructured":"Lee C Y, Lu E H, Sun L F. Low-complexity bit-parallel systolic architecture for computing AB 2+C in a class of finite field GF(2 m ). IEEE Trans. Circuits and Systems II, 2001, 50(5): 519\u2013523.","journal-title":"IEEE Trans. Circuits and Systems II"},{"issue":"1","key":"887_CR23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/12.743408","volume":"48","author":"K Z Pekmestzi","year":"1999","unstructured":"Pekmestzi K Z. Multiplexer-based array multipliers. IEEE Trans. Computers, 1999, 48(1): 15\u201323.","journal-title":"IEEE Trans. Computers"},{"key":"887_CR24","unstructured":"Seroussi G. Table of low-weight binary irreducible polynomials. Technical Report HPL-98-135, Hewlett-Packard Laboratories, Palo Alto, Calif., Aug. 1998, Available at http:\/\/www.hpl.hp.com\/techreports\/98\/HPL-98-135.html ."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-006-0887-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-006-0887-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-006-0887-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:32:37Z","timestamp":1559399557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-006-0887-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["887"],"URL":"https:\/\/doi.org\/10.1007\/s11390-006-0887-x","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11]]}}}