{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:19:14Z","timestamp":1742390354837},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8355,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0166-218x(90)90012-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"309-312","source":"Crossref","is-referenced-by-count":10,"title":["Low complexity normal bases for F2mn"],"prefix":"10.1016","volume":"28","author":[{"given":"G\u00e9rald E.","family":"S\u00e9guin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90012-2_BIB1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(89)90001-2","article-title":"Low complexity normal bases","volume":"25","author":"Ash","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(90)90012-2_BIB2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0890-5401(89)90045-X","article-title":"Structure of parallel multipliers for a class of fields GF(2m)","volume":"83","author":"Itoh","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0166-218X(90)90012-2_BIB3","unstructured":"J.L. Massey and J.K. Omura, Computational method and apparatus for finite field arithmetic, U.S. Patent Application, Submitted."},{"key":"10.1016\/0166-218X(90)90012-2_BIB4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","article-title":"Optimal normal bases in GF(pn)","volume":"22","author":"Mullin","year":"1989","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/0166-218X(90)90012-2_BIB5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","article-title":"An improved algorithm for computing logarithms over GF(p) and its cryptographic significance","volume":"24","author":"Pohlig","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(90)90012-2_BIB6","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/TC.1985.1676616","article-title":"VLSI architectures for computing multiplications and inverses in GF(2m)","volume":"34","author":"Wang","year":"1985","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X90900122?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X90900122?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:50:47Z","timestamp":1555116647000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X90900122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0166218X90900122"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90012-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}