{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:55:27Z","timestamp":1761580527785},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425212"},{"type":"electronic","value":"9783540447092"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44709-1_15","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:04:18Z","timestamp":1186826658000},"page":"160-170","source":"Crossref","is-referenced-by-count":11,"title":["A New Low Complexity Parallel Multiplier for a Class of Finite Fields"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Leone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"15_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1975","unstructured":"Aho A.V., Hopcroft J.E., Ullman J.D., \u201cThe Design and Analysis of Computer Algorithms\u201d, Addison-Wesley, Reading, Mass., 1975."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1109\/12.713313","volume":"47","author":"G. Drolet","year":"1998","unstructured":"Drolet G., \u201cA New Representation of Elements of Finite Fields GF(2m) Yelding Small Complexity Arithmetic Circuit\u201d, IEEE Trans. on Computers, vol. 47, pp. 938\u2013946, 1998.","journal-title":"IEEE Trans. on Computers"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Ko\u00e7 C.K., Sunar B., \u201cLow Complexity Bit-Parallel Canonical and Normal Basis Mutipliers for a Class of Finite Fields\u201d, IEEE Trans. on Computers, vol. 47, pp. 353\u2013356, March 1998.","DOI":"10.1109\/12.660172"},{"key":"15_CR4","unstructured":"Omura J., Massey J., \u201cComputational method and apparatus for finite field arithmetic\u201d, U.S. Patent Number 4,587,627, May 1986."},{"issue":"8","key":"15_CR5","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/12.156539","volume":"41","author":"M.H. Hasan","year":"1992","unstructured":"Hasan M.H., Wang M.Z., Bhargava V.K., \u201cModular construction of low complexity parallel multipliers for a class of finite fields GF(2m)\u201d, IEEE Trans. on Computers, vol. 41, no. 8, pp. 962\u2013971, August 1992.","journal-title":"IEEE Trans. on Computers"},{"issue":"10","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/12.257715","volume":"42","author":"M.H. Hasan","year":"1993","unstructured":"Hasan M.H., Wang M.Z., Bhargava V.K., \u201cA modified Massey-Omura Multiplier for a class of finite fields\u201d, IEEE Trans. on Computers, vol. 42, no. 10, pp. 1278\u20131280, October 1993.","journal-title":"IEEE Trans. on Computers"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0890-5401(89)90045-X","volume":"83","author":"T. Itho","year":"1989","unstructured":"Itho T., Tsujii S., \u201cStructure of parallel multipliers for a class of Finite Fields GF(2m)\u201d, Information and Computation, vol. 83, pp. 21\u201340, 1989.","journal-title":"Information and Computation"},{"issue":"7","key":"15_CR8","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1109\/12.508323","volume":"45","author":"C. Paar","year":"1996","unstructured":"Paar C., \u201cA new architecture for a parallel finite field multiplier with low complexity based on composite fields\u201d, IEEE Trans. on Computers, vol. 45, no. 7, pp. 846\u2013861, July 1996.","journal-title":"IEEE Trans. on Computers"},{"key":"15_CR9","volume-title":"Applications of Finite Fields","author":"A.J. Menezes","year":"1993","unstructured":"Menezes A.J., Blake I., Gao X., Mullin R. Vanstone S. and Yaghoobian T., \u201cApplications of Finite Fields\u201d, Boston, MA: Kluwer Academic Publisher, 1993."},{"key":"15_CR10","first-page":"297","volume-title":"Applied Algebra Algebraic Algorithms, and Error-Correcting Codes","author":"E.D. Mastrovito","year":"1988","unstructured":"Mastrovito E.D., \u201cVLSI Architectures for multiplication over finite field GF(2m)\u201d, In T. Mora, editor, Applied Algebra Algebraic Algorithms, and Error-Correcting Codes, 6-th International Conference, AAECC-6, pp. 297\u2013309, Roma, Italy, July 1988. New York, NY: Springer-Verlag."},{"key":"15_CR11","volume-title":"Seminumerical algorithms","author":"D.E. Knuth","year":"1969","unstructured":"Knuth D.E., \u201cThe art of the computing programming\u201d, Vol. 2: Seminumerical algorithms, Adison-Wilsey, Reading, MA., 1969."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Elia M., Leone M. and Visentin C., \u201cLow Complexity bit-parallel multipliers for GF(2m) with generator polynomial x\n                  \n                    m\n                  +x\n                  \n                    k\n                   + 1\u201d, Electronics Letters, Vol. 35, No. 7, April 1999.","DOI":"10.1049\/el:19990407"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems \u2014 CHES 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44709-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T05:58:40Z","timestamp":1550728720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44709-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425212","9783540447092"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44709-1_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}