{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:40:17Z","timestamp":1732311617713,"version":"3.28.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T00:00:00Z","timestamp":1724716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T00:00:00Z","timestamp":1724716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10623-024-01479-7","type":"journal-article","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T06:02:22Z","timestamp":1724738542000},"page":"4085-4097","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the construction of certain odd degree irreducible polynomials over finite fields"],"prefix":"10.1007","volume":"92","author":[{"given":"Melek","family":"\u00c7il","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bar\u0131\u015f B\u00fclent","family":"K\u0131rlar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,27]]},"reference":[{"key":"1479_CR1","doi-asserted-by":"publisher","unstructured":"Adleman L.M., Lenstra H.W.: Finding irreducible polynomials over finite fields. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 350\u2013355 (1986). https:\/\/doi.org\/10.1145\/12130.12166.","DOI":"10.1145\/12130.12166"},{"key":"1479_CR2","doi-asserted-by":"publisher","unstructured":"Ahn Y., Kim K.: Generating certain quintic irreducible polynomials over finite fields. Korean J. Math. 3(19), 263\u2013272 (2011). https:\/\/doi.org\/10.11568\/kjm.2011.19.3.263","DOI":"10.11568\/kjm.2011.19.3.263"},{"key":"1479_CR3","unstructured":"\u00c7il M., K\u0131rlar B.B.: Some correspondence of certain type of irreducible polynomials over finite fields. In: Proceedings of 9th International Information Security and Cryptology Conference (ISCTURKEY 2016), pp. 143\u2013147 (2016)."},{"issue":"2","key":"1479_CR4","doi-asserted-by":"publisher","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. Math. Proc. Camb. Philos. Soc. 66(2), 335\u2013344 (1969). https:\/\/doi.org\/10.1017\/S0305004100045023.","journal-title":"Math. Proc. Camb. Philos. Soc."},{"issue":"2","key":"1479_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF00124895","volume":"2","author":"SD Cohen","year":"1992","unstructured":"Cohen S.D.: The explicit construction of irreducible polynomials over finite fields. Des. Codes Crypt. 2(2), 169\u2013174 (1992). https:\/\/doi.org\/10.1007\/BF00124895.","journal-title":"Des. Codes Crypt."},{"issue":"12","key":"1479_CR6","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.ffa.2011.09.007","volume":"18","author":"K Kim","year":"2012","unstructured":"Kim K., Yie I.: A correspondence of certain irreducible polynomials over finite fields. Finite Fields Appl. 18(12), 384\u2013395 (2012). https:\/\/doi.org\/10.1016\/j.ffa.2011.09.007.","journal-title":"Finite Fields Appl."},{"issue":"1","key":"1479_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4134\/JKMS.2009.46.1.001","volume":"46","author":"H Kim","year":"2009","unstructured":"Kim H., Kim J., Yie I.: Certain cubic polynomials over finite fields. J. Korean Math. Soc. 46(1), 1\u201312 (2009). https:\/\/doi.org\/10.4134\/JKMS.2009.46.1.001.","journal-title":"J. Korean Math. Soc."},{"issue":"3","key":"1479_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1515\/ms-2016-0294","volume":"67","author":"BB K\u0131rlar","year":"2017","unstructured":"K\u0131rlar B.B., \u00c7il M.: On the k-th order lfsr sequence with public key cryptosystems. Math. Slovaca 67(3), 601\u2013610 (2017). https:\/\/doi.org\/10.1515\/ms-2016-0294.","journal-title":"Math. Slovaca"},{"key":"1479_CR9","doi-asserted-by":"publisher","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\u2013341 (2004). https:\/\/doi.org\/10.1016\/j.ffa.2003.09.002.","journal-title":"Finite Fields Appl."},{"key":"1479_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/S10623-010-9478-5","volume":"61","author":"MK Kyuregyan","year":"2011","unstructured":"Kyuregyan M.K., Kyureghyan G.M.: Irreducible compositions of polynomials over finite fields. Des. Codes Crypt. 61, 301\u2013314 (2011). https:\/\/doi.org\/10.1007\/S10623-010-9478-5.","journal-title":"Des. Codes Crypt."},{"key":"1479_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume":"1880","author":"AK Lenstra","year":"2000","unstructured":"Lenstra A.K., Verheul E.: The XTR public key system. Adv. Cryptol. (CRYPTO 2000) 1880, 1\u201319 (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_1.","journal-title":"Adv. Cryptol. (CRYPTO 2000)"},{"issue":"1","key":"1479_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01810846","volume":"1","author":"H Meyn","year":"1990","unstructured":"Meyn H.: On the construction of irreducible self-reciprical polynomials over finite fields. Appl. Algebra Eng. Commun. Comput. 1(1), 45\u201353 (1990). https:\/\/doi.org\/10.1007\/BF01810846.","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"189","key":"1479_CR13","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1109\/SFCS.1988.21944","volume":"54","author":"V Shoup","year":"1990","unstructured":"Shoup V.: New algorithms for finding irreducible polynomials over finite fields. Math. Comput. 54(189), 435\u2013447 (1990). https:\/\/doi.org\/10.1109\/SFCS.1988.21944.","journal-title":"Math. Comput."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01479-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:23:34Z","timestamp":1732310614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01479-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,27]]},"references-count":13,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1479"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01479-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,8,27]]},"assertion":[{"value":"8 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}