{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:54:32Z","timestamp":1761580472118},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007,1]]},"DOI":"10.1007\/s11390-007-9003-0","type":"journal-article","created":{"date-parts":[[2007,2,9]],"date-time":"2007-02-09T18:31:12Z","timestamp":1171045872000},"page":"28-38","source":"Crossref","is-referenced-by-count":15,"title":["Unified Parallel Systolic Multiplier Over ${\\it GF}(2^{m})$"],"prefix":"10.1007","volume":"22","author":[{"given":"Chiou-Yng","family":"Lee","sequence":"first","affiliation":[]},{"given":"Yung-Hui","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Che-Wun","family":"Chiou","sequence":"additional","affiliation":[]},{"given":"Jim-Min","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,2,14]]},"reference":[{"key":"9003_CR1","volume-title":"Cryptography and Data Security","author":"D E R Denning","year":"1983","unstructured":"Denning D E R. Cryptography and Data Security. Reading, MA: Addison-Wesley, 1983."},{"key":"9003_CR2","volume-title":"Cryptography and Secure Communications","author":"M Y Rhee","year":"1994","unstructured":"Rhee M Y. Cryptography and Secure Communications. Singapore: McGraw-Hill, 1994."},{"key":"9003_CR3","volume-title":"Handbook of Applied Cryptography","author":"A Menezes","year":"1997","unstructured":"Menezes A, Oorschot P V, Vanstone S. Handbook of Applied Cryptography. Boca Raton, FL: CRC Press, 1997."},{"key":"9003_CR4","unstructured":"Massey J L, Omura J K. Computational method and apparatus for finite field arithmetic. U.S. Patent Number 4.587.627, May 1986."},{"key":"9003_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0890-5401(89)90045-X","volume":"83","author":"T Itoh","year":"1989","unstructured":"Itoh T, Tsujii S. Structure of parallel multipliers for a class of fields ${\\it GF}(2^{m})$ . Information and Computation, 1989, 83: 21\u201340.","journal-title":"Information and Computation"},{"issue":"8","key":"9003_CR6","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1109\/12.707588","volume":"47","author":"H Wu","year":"1998","unstructured":"Wu H, Hasan M A. Low complexity bit-parallel multipliers for a class of finite fields. IEEE Trans. Computers, 1998, 47(8): 883\u2013887.","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"9003_CR7","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. Low complexity bit-parallel canonical and normal basis multipliers for a class of finite fields. IEEE Trans. Computers, 1998, 47(3): 353\u2013356.","journal-title":"IEEE Trans. Computers"},{"issue":"10","key":"9003_CR8","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1109\/12.257715","volume":"42","author":"M A Hasan","year":"1993","unstructured":"Hasan M A, Wang M Z, Bhargava V K. A modified Massey-Omura parallel multiplier for a class of finite fields. IEEE Trans. Computers, 1993, 42(10): 1278\u20131280.","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"9003_CR9","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. An efficient optimal normal basis type II multiplier. IEEE Trans. Computers, 2001, 50(1): 83\u201387.","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"9003_CR10","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. Systolic multipliers for finite fields ${\\it GF}(2^{m})$ . IEEE Trans. Computers, 1984, C-33(4): 357\u2013360.","journal-title":"IEEE Trans. Computers"},{"issue":"7","key":"9003_CR11","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 finite fields ${\\it GF}(2^{m})$ . IEEE Trans. Circuits and Systems, 1991, 38(7): 796\u2013800.","journal-title":"IEEE Trans. Circuits and Systems"},{"issue":"2","key":"9003_CR12","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 ${\\it GF}(2^{m})$ . IEEE Trans. Computers, 1994, 43(2): 226\u2013229.","journal-title":"IEEE Trans. Computers"},{"issue":"7","key":"9003_CR13","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/12.293263","volume":"43","author":"C L Wang","year":"1994","unstructured":"Wang C L. Bit-level systolic array for fast exponentiation in ${\\it GF}(2^{m})$ . IEEE Trans. Computers, 1994, 43(7): 838\u2013841.","journal-title":"IEEE Trans. Computers"},{"issue":"11","key":"9003_CR14","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":"5","key":"9003_CR15","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 ${\\it 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"},{"key":"9003_CR16","unstructured":"Kwon S. A low complexity and a low latency bit parallel systolic multiplier over ${\\it GF} (2^{m})$ using an optimal normal basis of type II. In Proc. 16th IEEE Symp. Computer Arithmetic, Santiago de Compostela, Spain, 2003, 16: 196\u2013202."},{"key":"9003_CR17","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"28","author":"E R Belekamp","year":"1982","unstructured":"Belekamp E R. Bit-serial Reed-Solomon encoders. IEEE Information Theory, 1982, 28: 869\u2013974.","journal-title":"IEEE Information Theory"},{"key":"9003_CR18","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1109\/18.45274","volume":"35","author":"M Morii","year":"1989","unstructured":"Morii M, Kasahara K, Whiting D L. Efficient bit-serial multiplication and discrete-time Wiener-Hoph equation over finite fields. IEEE Trans. Information Theory, 1989, 35: 1177\u20131184.","journal-title":"IEEE Trans. Information Theory"},{"issue":"1","key":"9003_CR19","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 Discrete Math., 1990, 3(1): 140\u2013148.","journal-title":"SIAM Discrete Math."},{"issue":"10","key":"9003_CR20","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":"11","key":"9003_CR21","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 L F. New low-complexity bit-parallel finite field multipliers using weakly dual bases. IEEE Trans. Computers, 1998, 47(11): 1223\u20131234.","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"9003_CR22","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. ${\\it GF}(2^{m})$ Multiplication and division over the dual basis. IEEE Trans. Computers, 1996, 45(3): 319\u2013327.","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"9003_CR23","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 D. A dual basis systolic multipliers for ${\\it GF}(2^{m})$ . IEE Proc-Comp. Digit. Tech., 1997, 144(1): 43\u201346.","journal-title":"IEE Proc-Comp. Digit. Tech."},{"key":"9003_CR24","unstructured":"Weisstein E W. Hankel Matrix. Mathworld \u2014 A wolfram web resource, http:\/\/mathworld.com\/HankelMatrix.html ."},{"key":"9003_CR25","unstructured":"Parhi K. VLSI Signal Processing Systems: Design and Implementation. John Wiley & Sons, 1999."},{"key":"9003_CR26","unstructured":"Seroussi G. Table of low-weight binary irreducible polynomials. Visual Computing Dept., Hewlett Packard Laboratories, Aug. 1998, Available at: http:\/\/www.hpl.hp.com\/techreports\/98\/HPL-98-135.html ."},{"key":"9003_CR27","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1215\/S0012-7094-42-00938-4","volume":"9","author":"S Perlis","year":"1942","unstructured":"Perlis S. Normal bases of cyclic fields of prime power degree. Duke Math. J., 1942, 9: 507\u2013517.","journal-title":"Duke Math. J."},{"key":"9003_CR28","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. Optimal normal bases in ${\\it GF}(p^{n})$ . Discrete Applied Math., 1988\/1989, 22: 149\u2013161.","journal-title":"Discrete Applied Math."},{"key":"9003_CR29","doi-asserted-by":"crossref","unstructured":"Brent R P, Zimmermann P. Algorithms for finding almost irreducible and almost primitive trinomials. In Primes and Misdemeeanours: Lectures in Honour of the Sixtieth Birthday of Hugh Cowie Williams, Fields Institute Communication FIC\/41, The Fields Institute, Toronto, 2004, pp.91\u2013102.","DOI":"10.1090\/fic\/041\/08"},{"issue":"1","key":"9003_CR30","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 ${\\it GF}(2^{m})$ using irreducible trinomials. IEE Proc.-Comput. and Digit. Tech., 2003, 150(1): 39\u201342.","journal-title":"IEE Proc.-Comput. and Digit. Tech."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9003-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9003-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9003-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:32:38Z","timestamp":1559399558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9003-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["9003"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9003-0","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}