{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:21:51Z","timestamp":1761578511809},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Electron Test"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s10836-005-1053-z","type":"journal-article","created":{"date-parts":[[2005,8,25]],"date-time":"2005-08-25T11:04:45Z","timestamp":1124967885000},"page":"539-549","source":"Crossref","is-referenced-by-count":32,"title":["Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m)"],"prefix":"10.1007","volume":"21","author":[{"given":"Chiou-Yng","family":"Lee","sequence":"first","affiliation":[]},{"given":"Che Wun","family":"Chiou","sequence":"additional","affiliation":[]},{"given":"Jim-Min","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1053_CR1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TC.1976.5009207","volume":"C-25","author":"B. Benjauthrit","year":"1976","unstructured":"B. Benjauthrit and I.S. Reed, \u201cGalois Switching Functions and Their Applications,\u201d IEEE Trans. Computers, vol. C-25, pp. 78\u201386, 1976.","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"1053_CR2","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1109\/TC.2003.1190590","volume":"52","author":"G. Bertoni","year":"2003","unstructured":"G. Bertoni, L. Breveglieri, I. Koren, P. Maistri, and V. Piuri, \u201cError Analysis and Detection Procedures for a Hardware Implementation of the Advanced Encryption Standard,\u201d IEEE Trans. Computers, vol. 52, no. 4, pp. 492\u2013505, 2003.","journal-title":"IEEE Trans. Computers"},{"key":"1053_CR3","volume-title":"Fast Algorithms for Digital Signal Processing","author":"R.E. Blahut","year":"1985","unstructured":"R.E. Blahut, Fast Algorithms for Digital Signal Processing, Reading, Mass.: Addison-Wesley, 1985."},{"key":"1053_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s001450010016","volume":"14","author":"D. Boneh","year":"2001","unstructured":"D. Boneh, R.A. DeMillo, R.J. Lipton, \u201cOn the Importance of Eliminating Errors in Cryptographic Computations,\u201d Journal of Cryptology, vol. 14, pp. 101\u2013119, 2001.","journal-title":"Journal of Cryptology"},{"issue":"14","key":"1053_CR5","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1049\/el:20020468","volume":"38","author":"C.W. Chiou","year":"2002","unstructured":"C.W. Chiou, \u201cConcurrent Error Detection in Array Multipliers for GF(2m) Fields,\u201d IEE Electronics Letters, vol. 38, no. 14, pp. 688\u2013689, 2002.","journal-title":"IEE Electronics Letters"},{"issue":"24","key":"1053_CR6","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1049\/el:20031050","volume":"39","author":"C.W. Chiou","year":"2003","unstructured":"C.W. Chiou, L.C. Lin, F.H. Chou, and S.F. Shu, \u201cLow Complexity Finite Field Multiplier Using Irreducible Trinomials,\u201d Electronics Letters, vol. 39, no. 24, pp. 1709\u20131711, 2003.","journal-title":"Electronics Letters"},{"issue":"1","key":"1053_CR7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1049\/ip-cdt:19970660","volume":"144","author":"S.T.J. Fenn","year":"1997","unstructured":"S.T.J. Fenn, M. Benaissa, and O. Taylor, \u201cDual Basis Systolic Multipliers for GF(2m),\u201d IEE Computers and Digital Techniques, vol. 144, no. 1, pp. 43\u201346, 1997.","journal-title":"IEE Computers and Digital Techniques"},{"key":"1053_CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1008333132366","volume":"13","author":"S. Fenn","year":"1998","unstructured":"S. Fenn, M. Gossel, M. Benaissa, and D. Taylor, \u201cOn-Line Error Detection for Bit-Serial Multipliers in GF(2m),\u201d Journal of Electronic Testing: Theory and Applications, vol. 13, pp. 29\u201340, 1998.","journal-title":"Journal of Electronic Testing: Theory and Applications"},{"key":"1053_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s001459900055","volume":"12","author":"M. Joye","year":"1999","unstructured":"M. Joye, A.K. Lenstra, J.-J. Quisquater, \u201cChinese Remaindering Based Cryptosystems in the Presence of Faults,\u201d Journal of Cryptology, vol. 12, pp. 241\u2013245, 1999.","journal-title":"Journal of Cryptology"},{"key":"1053_CR10","doi-asserted-by":"crossref","unstructured":"R. Karri, G. Kuznetsov, and M. Goessel, \u201cParity-Based Concurrent Error Detection of Substitution-Permutation Network Block Ciphers,\u201d in Proc. of CHES 2003, Springer LNCS 2779, pp. 113\u2013124, 2003.","DOI":"10.1007\/978-3-540-45238-6_10"},{"issue":"3","key":"1053_CR11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/12.660172","volume":"47","author":"\u00c7.K. Ko\u00e7","year":"1998","unstructured":"\u00c7.K. Ko\u00e7 and B. Sunar, \u201cLow-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields,\u201d IEEE Trans. Computers, vol. 47, no. 3, pp. 353\u2013356, 1998.","journal-title":"IEEE Trans. Computers"},{"key":"1053_CR12","unstructured":"P.K. Lala, Fault Tolerant and Fault Testable Hardware Design. Prentice Hall, 1985."},{"issue":"1","key":"1053_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1049\/ip-cdt:20030061","volume":"150","author":"C.Y. Lee","year":"2003","unstructured":"C.Y. Lee, \u201cLow Complexity Bit-Parallel Systolic Multiplier Over GF(2m) Using Irreducible Trinomials,\u201d IEE Proc.-Comput. Digit. Tech., vol. 150, no. 1, pp. 39\u201342, 2003.","journal-title":"IEE Proc.-Comput. Digit. Tech."},{"issue":"11","key":"1053_CR14","first-page":"2844","volume":"E86-A","author":"C.Y. Lee","year":"2003","unstructured":"C.Y. Lee, \u201cLow-Latency Bit-Parallel Systolic Multiplier for Irreducible xm+xn+1 with gcd(m,n) = 1,\u201d IEICE Transactions on Fundamentals, vol. E86-A, no. 11, pp. 2844\u20132852, 2003.","journal-title":"IEICE Transactions on Fundamentals"},{"key":"1053_CR15","doi-asserted-by":"crossref","unstructured":"C.Y. Lee, E.H. Lu, and L.F. Sun, \u201cLow-Complexity Bit-Parallel Systolic Architecture for Computing AB2 + C in a Class of Finite Field GF(2m),\u201d IEEE Trans. Circuits and Systems II, pp. 519\u2013523, 2001.","DOI":"10.1109\/82.938363"},{"issue":"5","key":"1053_CR16","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/12.926154","volume":"50","author":"C.Y. Lee","year":"2001","unstructured":"C.Y. Lee, E.H. Lu, and J.Y. Lee, \u201cBit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally-Spaced Polynomials,\u201d IEEE Trans. Computers, vol. 50, no. 5, pp. 385\u2013393, 2001.","journal-title":"IEEE Trans. Computers"},{"key":"1053_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to Finite Fields and Their Applications","author":"R. Lidl","year":"1994","unstructured":"R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, New York: Cambridge Univ. Press, 1994."},{"key":"1053_CR18","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977."},{"key":"1053_CR19","doi-asserted-by":"crossref","unstructured":"E.D. Mastrovito, \u201cVLSI Architectures for Multiplication Over Finite Field GF(2m),\u201d Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, in Proc. Sixth Int\u2019l Conf., AAECC-6, T. Mora (ed.), Rome, pp. 297\u2013309, July 1988.","DOI":"10.1007\/3-540-51083-4_67"},{"key":"1053_CR20","volume-title":"Applications of Finite Fields","year":"1993","unstructured":"A.J. Menezes (ed.), Applications of Finite Fields, Boston: Kluwer Academic, 1993."},{"issue":"7","key":"1053_CR21","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/TC.1982.1676055","volume":"C-31","author":"J.H. Patel","year":"1982","unstructured":"J.H. Patel and L.Y. Fung, \u201cConcurrent Error Detection in ALU\u2019s by Recomputing with Shifted Operands,\u201d IEEE Trans. Computers, vol. C-31, no. 7, pp. 589\u2013595, 1982.","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"1053_CR22","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TC.1983.1676246","volume":"C-32","author":"J.H. Patel","year":"1983","unstructured":"J.H. Patel and L.Y. Fung, \u201cConcurrent Error Detection in Multiply and Divide Arrays,\u201d IEEE Trans. Computers, vol. C-32, no. 4, pp. 417\u2013422, 1983.","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"1053_CR23","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1975.1055352","volume":"IT-21","author":"I.S. Reed","year":"1975","unstructured":"I.S. Reed and T.K. Truong, \u201cThe Use of Finite Fields to Compute Convolutions,\u201d IEEE Trans. Information Theory, vol. IT-21, no. 2, pp. 208\u2013213, 1975.","journal-title":"IEEE Trans. Information Theory"},{"key":"1053_CR24","doi-asserted-by":"crossref","unstructured":"A. Reyhani-Masoleh and M.A. Hasan, \u201cError Detection in Polynomial Basis Multipliers Over Binary Extension Fields,\u201d in Proc. of Cryptographic Hardware and Embedded Systems-CHES 2002, LNCS 2523, pp. 515\u2013528, 2003.","DOI":"10.1007\/3-540-36400-5_37"},{"key":"1053_CR25","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1109\/31.135751","volume":"38","author":"C.L. Wang","year":"1991","unstructured":"C.L. Wang and J.L. Lin, \u201cSystolic Array Implementation of Multipliers for GF(2m),\u201d IEEE Trans. Circuits and Systems II, vol. 38, pp. 796\u2013800, 1991.","journal-title":"IEEE Trans. Circuits and Systems II"},{"issue":"2","key":"1053_CR26","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/12.45211","volume":"39","author":"C.C. Wang","year":"1990","unstructured":"C.C. Wang and D. Pei, \u201cA VLSI Design for Computing Exponentiation in GF(2m) and its Application to Generate Pseudorandom Number Sequences,\u201d IEEE Trans. Computers, vol. 39, no. 2, pp. 258\u2013262, 1990.","journal-title":"IEEE Trans. Computers"},{"key":"1053_CR27","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TC.1984.1676441","volume":"C-33","author":"C.S. Yeh","year":"1984","unstructured":"C.S. Yeh, S. Reed, and T.K. Truong, \u201cSystolic Multipliers for Finite Fields GF(2m),\u201d IEEE Trans. Computers, vol. C-33, pp. 357\u2013360, 1984.","journal-title":"IEEE Trans. Computers"}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-005-1053-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10836-005-1053-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-005-1053-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T06:16:43Z","timestamp":1586413003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10836-005-1053-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["1053"],"URL":"https:\/\/doi.org\/10.1007\/s10836-005-1053-z","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"value":"0923-8174","type":"print"},{"value":"1573-0727","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}