{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:06:37Z","timestamp":1769972797024,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2012,9,27]],"date-time":"2012-09-27T00:00:00Z","timestamp":1348704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s00200-012-0175-7","type":"journal-article","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T21:03:01Z","timestamp":1348693381000},"page":"207-220","source":"Crossref","is-referenced-by-count":1,"title":["Irreducible compositions of polynomials over finite fields of even characteristic"],"prefix":"10.1007","volume":"23","author":[{"given":"Saeid","family":"Mehrabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Melsik K.","family":"Kyuregyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,27]]},"reference":[{"key":"175_CR1","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)"},{"key":"175_CR2","doi-asserted-by":"crossref","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (2000, reprinted)","DOI":"10.1017\/CBO9781107360211"},{"key":"175_CR3","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1109\/18.21214","volume":"34","author":"B Chor","year":"1988","unstructured":"Chor, B., Rivest, R.: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inform. Theory 34, 901\u2013909 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"175_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(85)90017-2","volume":"56","author":"J Calmet","year":"1985","unstructured":"Calmet, J.: Algebraic algorithms in GF (q). Discrete Math. 56, 101\u2013109 (1985)","journal-title":"Discrete Math."},{"key":"175_CR5","first-page":"3","volume":"3","author":"R Chapman","year":"1997","unstructured":"Chapman, R.: Completely normal elements in iterated quadratic extensions of finite fields. Finite Fields Appl 3, 3\u201310 (1997)","journal-title":"Finite Fields Appl"},{"key":"175_CR6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1017\/S0305004100045023","volume":"66","author":"SD Cohen","year":"1969","unstructured":"Cohen, S.D.: On irreducible polynomials of certain types in finite fields. Proc. Camb. Philos. Soc 66, 335\u2013344 (1969)","journal-title":"Proc. Camb. Philos. Soc"},{"key":"175_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, S.D.: The explicit construction of irreducible polynomials over finite fields. Des. Codes Cryptogr. 2, 169\u2013173 (1992)","DOI":"10.1007\/BF00124895"},{"key":"175_CR8","doi-asserted-by":"crossref","unstructured":"Eberly, W.: Very fast parallel matrix and polynomial arithmetic. In: 25th Annual Symposium on Foundations of Computer Science, pp. 21\u201330 (1984)","DOI":"10.1109\/SFCS.1984.715897"},{"key":"175_CR9","unstructured":"Gao, S.: Normal bases over finite fields, Ph.D Thesis, Waterloo (1993)"},{"key":"175_CR10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1006\/ffta.2001.0323","volume":"8","author":"MK Kyuregyan","year":"2002","unstructured":"Kyuregyan, M.K.: Recurrent methods for constructing irreducible polynomials over GF( $$2^{s}$$ ). Finite Fields Appl. 8, 52\u201368 (2002)","journal-title":"Finite Fields Appl."},{"key":"175_CR11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.ffa.2003.09.002","volume":"10","author":"MK Kyuregyan","year":"2004","unstructured":"Kyuregyan, M.K.: Iterated constructions of irreducible polynomials over finite fields with linearly independent roots. Finite Fields Appl. 10, 323\u2013431 (2004)","journal-title":"Finite Fields Appl."},{"key":"175_CR12","doi-asserted-by":"crossref","unstructured":"Kyuregyan, M.K.: Recurrent methods for constructing irreducible polynomials over $$F_{q}$$ of odd characteristics. Finite Fields Appl. 9, 39\u201358 (2003)","DOI":"10.1016\/S1071-5797(02)00005-9"},{"key":"175_CR13","doi-asserted-by":"crossref","unstructured":"Kyuregyan, M.K.: Recurrent methods for constructing irreducible polynomials over $$F_{q}$$ of odd characteristics II. Finite Fields and their Application 12, 357\u2013378 (2006)","DOI":"10.1016\/j.ffa.2005.07.002"},{"key":"175_CR14","unstructured":"Kyuregyan, M.K.: Quadratic transformations and synthesis of irreducible polynomials over finite fields. Dokl. Akad. Nauk. Arm. SSR 84(2), 67\u201371 (1987) (in Russian)"},{"key":"175_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03642-6","volume-title":"Algebraic Aspects of Cryptography","author":"N Koblitz","year":"1998","unstructured":"Koblitz, N.: Algebraic Aspects of Cryptography. Springer, Berlin (1998)"},{"key":"175_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to Finite Fields and Their Applications, (2nd edn)","author":"R Lidl","year":"1994","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications, (2nd edn). Cambridge University Press, Cambridge (1994)"},{"key":"175_CR17","volume-title":"Applications of Finite Fields","author":"A Menezes","year":"1993","unstructured":"Menezes, A., Blake, I.F., Gao, X., Mullin, R.C., Vanstone, S.A., Yaghoobian, T.: Applications of Finite Fields. Kluwer, Boston (1993)"},{"key":"175_CR18","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"175_CR19","unstructured":"McNay, G.: Topics in finite fields, Ph.D. Thesis, University of Glasgow (1995)"},{"key":"175_CR20","doi-asserted-by":"crossref","unstructured":"Meyn, H.: Explicit N-polynomials of 2-power degree over finite fields. Des. Codes Cryptogr. 6, 107\u2013116 (1995)","DOI":"10.1007\/BF01398009"},{"key":"175_CR21","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1215\/S0012-7094-42-00938-4","volume":"9","author":"S Perlis","year":"1942","unstructured":"Perlis, S.: Normal bases of cyclic fields of prime-power degree. Duke Math. J. 9, 507\u2013517 (1942)","journal-title":"Duke Math. J."},{"key":"175_CR22","first-page":"334","volume":"29","author":"RR Varshamov","year":"1984","unstructured":"Varshamov, R.R.: A general method of synthesizing irreducible polynomials over Galois fields. Sov. Math. Dokl. 29, 334\u2013336 (1984)","journal-title":"Sov. Math. Dokl."},{"key":"175_CR23","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1090\/S0025-5718-1985-0790658-X","volume":"45","author":"J von zur Gathen","year":"1985","unstructured":"von zur Gathen, J., Kaltofen, E.: Factorization of multivariate polynomials over finite fields. Math. Comput. 45, 251\u2013261 (1985)","journal-title":"Math. Comput."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-012-0175-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-012-0175-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-012-0175-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T15:58:46Z","timestamp":1744214326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-012-0175-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,27]]},"references-count":23,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s00200-012-0175-7","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,27]]}}}