乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T09:26:31Z","timestamp":1724491591208},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T00:00:00Z","timestamp":1143849600000},"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":[[2006,4]]},"DOI":"10.1007\/s10836-006-7446-9","type":"journal-article","created":{"date-parts":[[2006,5,15]],"date-time":"2006-05-15T06:49:00Z","timestamp":1147675740000},"page":"143-150","source":"Crossref","is-referenced-by-count":28,"title":["Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)"],"prefix":"10.1007","volume":"22","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":"7446_CR1","unstructured":"F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, Amsterdam, North-Holland, 1977."},{"key":"7446_CR2","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; Cambridge Univ. Press, New York 1994."},{"key":"7446_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, Addison-Wesley, Reading, Mass., 1985."},{"issue":"2","key":"7446_CR4","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TIT.1975.1055352","volume":"IT-21","author":"I.S. Reed","year":"March 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":"7446_CR5","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TC.1976.5009207","volume":"C-25","author":"B. Benjauthrit","year":"Jan. 1976","unstructured":"B. Benjauthrit and I.S. Reed, \u201cGalois Switching Functions and Their Applications,\u201d IEEE Trans. Computers, Vol. C-25, pp. 78\u201386, Jan. 1976.","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"7446_CR6","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/12.45211","volume":"39","author":"C.C. Wang","year":"Feb.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, Feb. 1990.","journal-title":"IEEE Trans. Computers"},{"key":"7446_CR7","first-page":"79","volume":"6","author":"T.C. Bartee","year":"Mar. 1963","unstructured":"T.C. Bartee and D.J. Schneider, \u201cComputation with Finite Fields,\u201d Information and Computing, Vol. 6, pp. 79\u201398, Mar. 1963.","journal-title":"Information and Computing"},{"key":"7446_CR8","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, Proc. Sixth Int\u2019l Conf., AAECC-6, T. Mora, (Ed.), Rome, July 1988, pp. 297\u2013309.","DOI":"10.1007\/3-540-51083-4_67"},{"issue":"3","key":"7446_CR9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/12.660172","volume":"47","author":"\u00c7.K. Ko\u00e7","year":"March 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"},{"issue":"1","key":"7446_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1049\/ip-cdt:20030061","volume":"150","author":"C.Y. Lee","year":"Jan. 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, Jan. 2003.","journal-title":"IEE Proc.-Comput. Digit. Tech."},{"key":"7446_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0890-5401(89)90045-X","volume":"83","author":"T. Itoh","year":"1989","unstructured":"T. Itoh and S. Tsujii, \u201cStructure of Parallel Multipliers for a Class of Fields GF(2m),\u201d Information and Computation, Vol. 83, pp. 21\u201340, 1989.","journal-title":"Information and Computation"},{"issue":"8","key":"7446_CR12","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/12.156539","volume":"41","author":"M.A. Hasan","year":"August 1992","unstructured":"M.A. Hasan, M. Wang, and V.K. Bhargava, \u201cModular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2m),\u201d IEEE Trans. Computers, Vol. 41, No. 8, pp. 962\u2013971, 1992.","journal-title":"IEEE Trans. Computers"},{"issue":"5","key":"7446_CR13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/12.926154","volume":"50","author":"C.Y. Lee","year":"May 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"},{"issue":"7","key":"7446_CR14","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1109\/12.508323","volume":"45","author":"C. Paar","year":"July 1996","unstructured":"C. Paar, \u201cA New Architecture For a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields,\u201d IEEE Trans. Computers, Vol. 45, No. 7, pp. 856\u2013861, 1996.","journal-title":"IEEE Trans. Computers"},{"issue":"24","key":"7446_CR15","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1049\/el:20031050","volume":"39","author":"C.W. Chiou","year":"27th Nov. 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"},{"key":"7446_CR16","unstructured":"J.L. Massey and J.K. Omura, \u201cComputational method and apparatus for finite field arithmetic,\u201d U.S. Patent Number 4,587,627, May 1986."},{"issue":"5","key":"7446_CR17","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TC.2002.1004590","volume":"51","author":"A. Reyhani-Masoleh","year":"May 2002","unstructured":"A. Reyhani-Masoleh and M.A. Hasan, \u201cA New Construction of Massey-Omura Parallel Multiplier Over GF(2m),\u201d IEEE Trans. Computers, Vol. 51, No. 5, pp. 511\u2013520, 2002.","journal-title":"IEEE Trans. Computers"},{"key":"7446_CR18","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"IT-28","author":"E.R. Berlekamp","year":"1982","unstructured":"E.R. Berlekamp, \u201cBit-Serial Reed-Solomon Encoders,\u201d IEEE Trans. Information Theory, Vol. IT-28, pp. 869\u2013874, 1982.","journal-title":"IEEE Trans. Information Theory"},{"issue":"11","key":"7446_CR19","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1109\/12.736433","volume":"47","author":"H. Wu","year":"November 1998","unstructured":"H. Wu, M.A. Hasan, and I.F. Blake, \u201cNew Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases,\u201d IEEE Trans. Computers, Vol. 47, No. 11, pp. 1223\u20131234, November 1998.","journal-title":"IEEE Trans. Computers"},{"key":"7446_CR20","doi-asserted-by":"crossref","unstructured":"J. Kelsey, B. Schneier, D. Wagner, and C. Hall, \u201cSide-Channel Cryptanalysis of Product Ciphers,\u201d Proc. of ESORICS, Springer, Sep.1998., pp. 97\u2013110","DOI":"10.1007\/BFb0055858"},{"key":"7446_CR21","doi-asserted-by":"crossref","unstructured":"E. Biham and A. Shamir, \u201cDifferential Fault Analysis of Secret Key Cryptosystems,\u201d Proceedings of Crypto, Springer LNCS 1294, 1997, pp. 513\u2013525","DOI":"10.1007\/BFb0052259"},{"key":"7446_CR22","doi-asserted-by":"crossref","unstructured":"D. Boneh, R. DeMillo, and R. Lipton, \u201cOn the Importance of Checking Cryptographic Protocols for Faults,\u201d Proc. of Eurocrypt, Springer LNCS 1233, pp. 37\u201351, 1997.","DOI":"10.1007\/3-540-69053-0_4"},{"key":"7446_CR23","doi-asserted-by":"crossref","unstructured":"R. Karri, G. Kuznetsov, and M. Goessel, \u201cParity-Based Concurrent Error Detection of Substitution-Permutation Network Block Ciphers,\u201d Proc. of CHES 2003, Springer LNCS 2779, 2003, pp. 113\u2013124.","DOI":"10.1007\/978-3-540-45238-6_10"},{"issue":"4","key":"7446_CR24","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1109\/TC.2003.1190590","volume":"52","author":"G. Bertoni","year":"April 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":"7446_CR25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s001459900055","volume":"12","author":"M. Joye","year":"1999","unstructured":"M. Joye, A. 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":"7446_CR26","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s001450010016","volume":"14","author":"D. Boneh","year":"2001","unstructured":"D. Boneh, R. DeMillo, and 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"},{"key":"7446_CR27","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":"7446_CR28","doi-asserted-by":"crossref","unstructured":"A. Reyhani-Masoleh and M.A. Hasan, \u201cError Detection in Polynomial Basis Multipliers Over Binary Extension Fields,\u201d Proc. of Cryptographic Hardware and Embedded Systems-CHES 2002, LNCS 2523, pp. 515\u2013528, 2003.","DOI":"10.1007\/3-540-36400-5_37"},{"issue":"5","key":"7446_CR29","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10836-005-1053-z","volume":"21","author":"C.-Y. Lee","year":"2005","unstructured":"C.-Y. Lee, C.W. Chiou, and J.-L. Lin, \u201cConcurrent Error Detection in A Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m),\u201d Journal of Electronic Testing: Theory and Applications, Vol. 21, No. 5, pp. 539\u2013549, 2005.","journal-title":"Journal of Electronic Testing: Theory and Applications"},{"issue":"14","key":"7446_CR30","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, 4th July 2002.","journal-title":"IEE Electronics Letters"},{"issue":"7","key":"7446_CR31","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/TC.1982.1676055","volume":"C-31","author":"J.H. Patel","year":"July 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":"7446_CR32","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TC.1983.1676246","volume":"C-32","author":"J.H. Patel","year":"April 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"},{"key":"7446_CR33","unstructured":"R.H. Minero, A.J. Anello, R.G. Furey, and L.R. Palounek, \u201cChecking by Pseuduplication,\u201d U.S. Patent 3660646, May 1972."},{"key":"7446_CR34","unstructured":"Applications of Finite Fields, A.J. Menezes, (Ed.), Kluwer Academic, Boston, 1993."},{"key":"7446_CR35","volume-title":"Fault tolerant & fault testable hardware design","author":"P.K. Lala","year":"1985","unstructured":"P.K. Lala, Fault tolerant & Fault Testable Hardware Design, London, Prentice-Hall International, Inc., 1985."},{"issue":"1","key":"7446_CR36","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/12.743408","volume":"48","author":"K.Z. Pekmestzi","year":"Jan. 1999","unstructured":"K.Z. Pekmestzi, \u201cMultiplexer-Based Array Multipliers,\u201d IEEE Trans. Computers, Vol. 48, No. 1, pp. 15\u201323, 1999.","journal-title":"IEEE Trans. Computers"},{"key":"7446_CR37","volume-title":"CMOS-Circuit, Design, Layout, and Simulation","author":"R.J. Baker","year":"1998","unstructured":"R.J. Baker, H.W. Li, and D.E. Boyce, CMOS-Circuit, Design, Layout, and Simulation, IEEE Press, New York, 1998."},{"key":"7446_CR38","unstructured":"S.M. Kang and Y. Leblebici, CMOS Digital Integrated Circuits-Analysis and Design, McGraw-Hill, 1999."},{"issue":"12","key":"7446_CR39","first-page":"2684","volume":"E86-D","author":"G.-Y. Byun","year":"Dec. 2003","unstructured":"G.-Y. Byun and H.-S. Kim, \u201cLow-Complexity Multiplexer-Based Multiplier of GF(2m),\u201d IEICE Trans. Infor. & Syst., Vol. E86-D, No. 12, pp. 2684\u20132690, 2003.","journal-title":"IEICE Trans. Infor. & Syst."}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-006-7446-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10836-006-7446-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-006-7446-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T01:57:40Z","timestamp":1559267860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10836-006-7446-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["7446"],"URL":"https:\/\/doi.org\/10.1007\/s10836-006-7446-9","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"value":"0923-8174","type":"print"},{"value":"1573-0727","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}