{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T05:56:12Z","timestamp":1718344572667},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,10]],"date-time":"2011-03-10T00:00:00Z","timestamp":1299715200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10623-011-9490-4","type":"journal-article","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T04:51:58Z","timestamp":1299646318000},"page":"43-62","source":"Crossref","is-referenced-by-count":11,"title":["Gauss periods as constructions of low complexity normal bases"],"prefix":"10.1007","volume":"62","author":[{"given":"M.","family":"Christopoulou","sequence":"first","affiliation":[]},{"given":"T.","family":"Garefalakis","sequence":"additional","affiliation":[]},{"given":"D.","family":"Panario","sequence":"additional","affiliation":[]},{"given":"D.","family":"Thomson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,10]]},"reference":[{"issue":"4","key":"9490_CR1","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1142\/S1793042110003290","volume":"5","author":"O. Ahmadi","year":"2010","unstructured":"Ahmadi O., Shparlinski I., Voloch J.F.: On multiplicative order of Gauss periods. Int. J. Number Theory. 5(4), 877\u2013882 (2010)","journal-title":"Int. J. Number Theory."},{"key":"9490_CR2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(89)90001-2","volume":"25","author":"D.W. Ash","year":"1989","unstructured":"Ash D.W., Blake I.F., Vanstone S.A.: Low complexity normal bases. Discrete Appl. Math. 25, 191\u2013210 (1989)","journal-title":"Discrete Appl. Math."},{"key":"9490_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10623-008-9195-5","volume":"49","author":"M. Christopoulou","year":"2008","unstructured":"Christopoulou M., Garefalakis T., Panario D., Thomson D.: The trace of an optimal normal element and low complexity normal bases. Des. Codes Cryptogr. 49, 199\u2013215 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"9490_CR4","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1109\/TC.2006.132","volume":"55","author":"R. Dahab","year":"2006","unstructured":"Dahab R., Hankerson D., Hu F., Long M., L\u00f3pez J., Menezes A.: Software multiplication using Gaussian normal bases. IEEE Trans. Comput. 55, 974\u2013984 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"9490_CR5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00125200","volume":"2","author":"S. Gao","year":"1992","unstructured":"Gao S., Lenstra H.W.: Optimal normal bases. Des. Codes Cryptogr. 2, 315\u2013323 (1992)","journal-title":"Des. Codes Cryptogr."},{"key":"9490_CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1090\/S0025-5718-98-00935-1","volume":"67","author":"S. Gao","year":"1998","unstructured":"Gao S., von zur Gathen J., Panario D.: Gauss periods: orders and cryptographical applications. Math. Comput. 67, 343\u2013352 (1998)","journal-title":"Math. Comput."},{"key":"9490_CR7","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1006\/jsco.1999.0309","volume":"29","author":"S. Gao","year":"2000","unstructured":"Gao S., von zur Gathen J., Panario D., Shoup V.: Algorithms for exponentiation in finite fields. J. Symbol. Comput. 29, 879\u2013889 (2000)","journal-title":"J. Symbol. Comput."},{"key":"9490_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4939-7560-0","volume-title":"Disquisitiones Arithmeticae, English edition","author":"C.F. Gauss","year":"1986","unstructured":"Gauss C.F.: Disquisitiones Arithmeticae, English edition. Springer-Verlag, New York (1986)"},{"key":"9490_CR9","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. Comput. 42, 1278\u20131280 (1993)","journal-title":"IEEE Trans. Comput."},{"key":"9490_CR10","unstructured":"Jungnickel D.: Finite Fields: Structure and Arithmetic. Wissenschaftsverlag, Mannheim (1993)."},{"key":"9490_CR11","unstructured":"Massey J.L., Omura J.K.: Computation method and apparatus for finite field arithmetic. U.S Patent no.:4587627, Issued: 6 (May 1986)."},{"key":"9490_CR12","unstructured":"Masuda A., Moura L., Panario D., Thomson D.: Low complexity normal elements over finite fields of characteristic two. IEEE Trans. Comput. 57, 990\u20131001 (2008)."},{"key":"9490_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R.C. Mullin","year":"1989","unstructured":"Mullin R.C., Onyszchuk I.M., Vanstone S.A., Wilson R.M.: Optimal normal bases in GF(p n ). Discrete Appl. Math. 22, 149\u2013161 (1989)","journal-title":"Discrete Appl. Math."},{"key":"9490_CR14","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/TC.2003.1190584","volume":"52","author":"A. Reyhani-Masoleh","year":"2003","unstructured":"Reyhani-Masoleh A., Hasan M.A.: Efficient multiplication beyond optimal normal bases. IEEE Trans. Comput. 52, 428\u2013439 (2003)","journal-title":"IEEE Trans. Comput."},{"key":"9490_CR15","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/TC.2005.29","volume":"54","author":"A. Reyhani-Masoleh","year":"2005","unstructured":"Reyhani-Masoleh A., Hasan M.A.: Low complexity word-level sequential normal-basis multipliers. IEEE Trans. Comput. 54, 98\u2013110 (2005)","journal-title":"IEEE Trans. Comput."},{"key":"9490_CR16","unstructured":"Silva D., Kschischang F.R.: Fast encoding and decoding of Gabidulin codes. In: Proceedings of the IEEE International Symposium of Information Theory, Seoul, Korea, 2858\u20132862 (2009)."},{"key":"9490_CR17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/12.902754","volume":"50","author":"B. Sunar","year":"2001","unstructured":"Sunar B., Ko\u00e7 C.K.: An efficient optimal normal basis type II multiplier. IEEE Trans. Comput. 50, 83\u201387 (2001)","journal-title":"IEEE Trans. Comput."},{"key":"9490_CR18","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.tcs.2004.01.012","volume":"315","author":"J. zur Gathen von","year":"2004","unstructured":"von zur Gathen J., N\u00f6cker M.: Fast arithmetic with general Gauss periods. Theor. Comput. Sci. 315, 419\u2013452 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9490_CR19","first-page":"33","volume":"20","author":"J. zur Gathen von","year":"2001","unstructured":"von zur Gathen J., Pappalardi F.: Density estimates related to Gauss periods. Prog. Comput. Sci. Appl. Log. 20, 33\u201341 (2001)","journal-title":"Prog. Comput. Sci. Appl. Log."},{"key":"9490_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s002000050093","volume":"9","author":"J. zur Gathen von","year":"1997","unstructured":"von zur Gathen J., Shparlinski I.: Orders of Gauss periods in finite fields. Appl. Algebra Eng. Commun. Comput. 9, 15\u201324 (1997)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"9490_CR21","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.ffa.2005.10.007","volume":"13","author":"Z. Wan","year":"2007","unstructured":"Wan Z., Zhou K.: On the complexity of the dual basis of a type I optimal normal basis. Finite Fields Appl. 13, 411\u2013417 (2007)","journal-title":"Finite Fields Appl."},{"key":"9490_CR22","first-page":"155","volume":"31","author":"A. Wassermann","year":"1990","unstructured":"Wassermann A.: Konstruktion von Normalbasen. Bayreuther Mathematische Scriften 31, 155\u2013164 (1990)","journal-title":"Bayreuther Mathematische Scriften"},{"key":"9490_CR23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S1071-5797(03)00040-6","volume":"10","author":"B. Young","year":"2004","unstructured":"Young B., Panario D.: Low complexity normal bases in $${{{\\mathbb F}_{2^n}}}$$ . Finite Fields Appl. 10, 53\u201364 (2004)","journal-title":"Finite Fields Appl."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9490-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9490-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9490-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T04:58:51Z","timestamp":1560056331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9490-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,10]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9490"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9490-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,10]]}}}