{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:09:33Z","timestamp":1768421373895,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T00:00:00Z","timestamp":1650499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T00:00:00Z","timestamp":1650499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,6]]},"abstract":"Abstract<\/jats:title>We illustrate a general technique to construct towers of fields producing high order elements in $$\\mathbb {F}_{q^{2^n}}$$<\/jats:tex-math>\n \n F<\/mml:mi>\n \n q<\/mml:mi>\n \n 2<\/mml:mn>\n n<\/mml:mi>\n <\/mml:msup>\n <\/mml:msup>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for odd q<\/jats:italic>, and in $$\\mathbb {F}_{2^{2 \\cdot 3^n}}$$<\/jats:tex-math>\n \n F<\/mml:mi>\n \n 2<\/mml:mn>\n \n 2<\/mml:mn>\n \u00b7<\/mml:mo>\n \n 3<\/mml:mn>\n n<\/mml:mi>\n <\/mml:msup>\n <\/mml:mrow>\n <\/mml:msup>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for $$n \\ge 1$$<\/jats:tex-math>\n \n n<\/mml:mi>\n \u2265<\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. These towers are obtained recursively by $$x_{n}^2 + x_{n} = v(x_{n - 1})$$<\/jats:tex-math>\n \n \n x<\/mml:mi>\n \n n<\/mml:mi>\n <\/mml:mrow>\n 2<\/mml:mn>\n <\/mml:msubsup>\n +<\/mml:mo>\n \n x<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n =<\/mml:mo>\n v<\/mml:mi>\n \n (<\/mml:mo>\n \n x<\/mml:mi>\n \n n<\/mml:mi>\n -<\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for odd q<\/jats:italic>, or $$x_{n}^3 + x_{n} = v(x_{n - 1})$$<\/jats:tex-math>\n \n \n x<\/mml:mi>\n \n n<\/mml:mi>\n <\/mml:mrow>\n 3<\/mml:mn>\n <\/mml:msubsup>\n +<\/mml:mo>\n \n x<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n =<\/mml:mo>\n v<\/mml:mi>\n \n (<\/mml:mo>\n \n x<\/mml:mi>\n \n n<\/mml:mi>\n -<\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for $$q=2$$<\/jats:tex-math>\n \n q<\/mml:mi>\n =<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where v<\/jats:italic>(x<\/jats:italic>) is a polynomial of small degree over the prime field $$\\mathbb {F}_{q}$$<\/jats:tex-math>\n \n F<\/mml:mi>\n q<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$x_n$$<\/jats:tex-math>\n \n x<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> belongs to the finite field extension $$\\mathbb {F}_{q^{2^n}}$$<\/jats:tex-math>\n \n F<\/mml:mi>\n \n q<\/mml:mi>\n \n 2<\/mml:mn>\n n<\/mml:mi>\n <\/mml:msup>\n <\/mml:msup>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for an odd q<\/jats:italic>, or to $$\\mathbb {F}_{2^{2\\cdot 3^n}}$$<\/jats:tex-math>\n \n F<\/mml:mi>\n \n 2<\/mml:mn>\n \n 2<\/mml:mn>\n \u00b7<\/mml:mo>\n \n 3<\/mml:mn>\n n<\/mml:mi>\n <\/mml:msup>\n <\/mml:mrow>\n <\/mml:msup>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Several examples are provided to show the numerical efficacy of our method. Using the techniques of Burkhart et al. (Des Codes Cryptogr 51(3):301\u2013314, 2009) we prove similar lower bounds on the orders of the groups generated by $$x_n$$<\/jats:tex-math>\n \n x<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, or by the discriminant $$\\delta _n$$<\/jats:tex-math>\n \n \u03b4<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> of the polynomial. We also provide a general framework which can be used to produce many different examples, with the numerical performance of our best examples being slightly better than in the cases analyzed in Burkhart et al. (2009).<\/jats:p>","DOI":"10.1007\/s10623-022-01041-3","type":"journal-article","created":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T18:05:57Z","timestamp":1650564357000},"page":"1347-1368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["High order elements in finite fields arising from recursive towers"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8186-0023","authenticated-orcid":false,"given":"Valerio","family":"Dose","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4402-6432","authenticated-orcid":false,"given":"Pietro","family":"Mercuri","sequence":"additional","affiliation":[]},{"given":"Ankan","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Stirpe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,21]]},"reference":[{"issue":"4","key":"1041_CR1","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1142\/S1793042110003290","volume":"6","author":"O Ahmadi","year":"2010","unstructured":"Ahmadi O., Shparlinski I.E., Voloch J.F.: Multiplicative order of Gauss periods. Int. J. Number Theory 6(4), 877\u2013882 (2010).","journal-title":"Int. J. Number Theory"},{"key":"1041_CR2","unstructured":"Bosma W., Cannon J.J., Fieker C., Steel A.: Handbook of Magma Functions. http:\/\/magma.maths.usyd.edu.au\/magma\/handbook\/."},{"issue":"3","key":"1041_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10623-008-9262-y","volume":"51","author":"JF Burkhart","year":"2009","unstructured":"Burkhart J.F., Calkin N.J., Gao S., Hyde-Volpe J.C., James K., Maharaj H., Manber S., Ruiz J., Smith E.: Finite field elements of high order arising from modular curves. Des. Codes Cryptogr. 51(3), 301\u2013314 (2009).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1041_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1017\/S0004972712000810","volume":"88","author":"M-C Chang","year":"2013","unstructured":"Chang M.-C.: Elements of large order in prime finite fields. Bull. Aust. Math. Soc. 88(1), 169\u2013176 (2013).","journal-title":"Bull. Aust. Math. Soc."},{"issue":"2","key":"1041_CR5","first-page":"621","volume":"17","author":"M-C Chang","year":"2013","unstructured":"Chang M.-C.: Order of Gauss periods in large characteristic. Taiwanese J. Math. 17(2), 621\u2013628 (2013).","journal-title":"Taiwanese J. Math."},{"issue":"1","key":"1041_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/ffta.1996.0167","volume":"3","author":"R Chapman","year":"1997","unstructured":"Chapman R.: Completely normal elements in iterated quadratic extensions of finite fields. Finite Fields Their Appl. 3(1), 1\u201310 (1997).","journal-title":"Finite Fields Their Appl."},{"issue":"2","key":"1041_CR7","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 Cryptogr. 2(2), 169\u2013174 (1992).","journal-title":"Des. Codes Cryptogr."},{"key":"1041_CR8","doi-asserted-by":"crossref","unstructured":"Conflitti A.: On elements of high order in finite fields. In: Cryptography and Computational Number Theory (Singapore, 1999). Progress in Computer Science and Applied Logic, vol. 20, pp. 11\u201314. Birkh\u00e4user, Basel (2001).","DOI":"10.1007\/978-3-0348-8295-8_2"},{"key":"1041_CR9","unstructured":"Dose V., Mercuri P., Pal A., Stirpe C.: Sample code for recursive tower $$q = 11$$ in MAGMA (2020). https:\/\/www.dropbox.com\/sh\/qsq6iw9oh0lsvql\/AACEV9ZGEL587IDDQSjirHfza?dl=0."},{"key":"1041_CR10","unstructured":"Elkies N.D.: Explicit modular towers (2001). arXiv:math\/0103107."},{"issue":"6","key":"1041_CR11","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1090\/S0002-9939-99-04795-4","volume":"127","author":"S Gao","year":"1999","unstructured":"Gao S.: Elements of provable high orders in finite fields. Proc. Am. Math. Soc. 127(6), 1615\u20131623 (1999).","journal-title":"Proc. Am. Math. Soc."},{"key":"1041_CR12","doi-asserted-by":"crossref","unstructured":"Huang M.-D., Narayanan A.K.: Finding primitive elements in finite fields of small characteristic. In: Topics in Finite Fields. Contemporary Mathematics, vol.632, pp. 215\u2013228. American Mathematical Society, Providence, RI (2015).","DOI":"10.1090\/conm\/632\/12630"},{"key":"1041_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ffa.2016.05.002","volume":"41","author":"FEB Mart\u00ednez","year":"2016","unstructured":"Mart\u00ednez F.E.B., Reis L.: Elements of high order: in Artin-Schreier extensions of finite fields $${\\mathbb{F}}_{q}$$. Finite Fields Appl. 41, 24\u201333 (2016).","journal-title":"Finite Fields Appl."},{"key":"1041_CR14","volume-title":"Topics in Finite Fields","author":"G McNay","year":"1995","unstructured":"McNay G.: Topics in Finite Fields. PhD, University of Glasgow, Glasgow, UK (1995)."},{"issue":"2","key":"1041_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF01398009","volume":"6","author":"H Meyn","year":"1995","unstructured":"Meyn H.: Explicit n-polynomials of 2-power degree over finite fields, I. Des. Codes Cryptogr. 6(2), 107\u2013116 (1995).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1041_CR16","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.ffa.2012.01.003","volume":"18","author":"R Popovych","year":"2012","unstructured":"Popovych R.: Elements of high order in finite fields of the form $$F_q[x]\/\\Phi _r(x)$$. Finite Fields Appl. 18(4), 700\u2013710 (2012).","journal-title":"Finite Fields Appl."},{"key":"1041_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ffa.2012.10.006","volume":"19","author":"R Popovych","year":"2013","unstructured":"Popovych R.: Elements of high order in finite fields of the form $$F_q[x]\/(x^m-a)$$. Finite Fields Appl. 19, 86\u201392 (2013).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"1041_CR18","first-page":"295","volume":"18","author":"R Popovych","year":"2014","unstructured":"Popovych R.: On elements of high order in general finite fields. Algebra Discret. Math. 18(2), 295\u2013300 (2014).","journal-title":"Algebra Discret. Math."},{"key":"1041_CR19","doi-asserted-by":"crossref","unstructured":"Popovych R.: Sharpening of the explicit lower bounds for the order of elements in finite field extensions based on cyclotomic polynomials. Ukrainian Math. J. 66(6):916\u2013927 (2014). Reprint of Ukra\u00efn. Mat. Zh. 66, 815\u2013825 (2014).","DOI":"10.1007\/s11253-014-0981-0"},{"issue":"2","key":"1041_CR20","doi-asserted-by":"publisher","first-page":"220","DOI":"10.15330\/cmp.7.2.220-225","volume":"7","author":"R Popovych","year":"2015","unstructured":"Popovych R.: On the multiplicative order of elements in Wiedemann\u2019s towers of finite fields. Carpathian Math. Publ. 7(2), 220\u2013225 (2015).","journal-title":"Carpathian Math. Publ."},{"key":"1041_CR21","doi-asserted-by":"crossref","unstructured":"Popovych R.: Some primitive elements for the Artin-Schreier extensions of finite fields. J. Math. Sci. (N.Y.) 210(1), 67\u201375 (2015). Translation of Ukr. Mat. Visn. 12, 86\u201396 (2015).","DOI":"10.1007\/s10958-015-2548-5"},{"issue":"1","key":"1041_CR22","first-page":"137","volume":"25","author":"R Popovych","year":"2018","unstructured":"Popovych R.: Multiplicative orders of elements in Conway\u2019s towers of finite fields. Algebra Discret. Math. 25(1), 137\u2013146 (2018).","journal-title":"Algebra Discret. Math."},{"key":"1041_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth H.: Algebraic Function Fields and Codes, vol. 254, 2nd edn Springer, Berlin (2009).","edition":"2"},{"issue":"A49","key":"1041_CR24","first-page":"4","volume":"7","author":"JF Voloch","year":"2007","unstructured":"Voloch J.F.: On the order of points on curves over finite fields. Integers 7(A49), 4 (2007).","journal-title":"Integers"},{"issue":"3","key":"1041_CR25","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1017\/S0004972709001075","volume":"81","author":"JF Voloch","year":"2010","unstructured":"Voloch J.F.: Elements of high order on finite fields from elliptic curves. Bull. Aust. Math. Soc. 81(3), 425\u2013429 (2010).","journal-title":"Bull. Aust. Math. Soc."},{"key":"1041_CR26","doi-asserted-by":"crossref","unstructured":"von zur Gathen J., Shparlinski I.: Gau\u00dfperiods in finite fields. In: Finite Fields and Applications (Augsburg, 1999), pp. 162\u2013177. Springer, Berlin (2001).","DOI":"10.1007\/978-3-642-56755-1_14"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01041-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01041-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01041-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T09:06:16Z","timestamp":1659171976000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01041-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,21]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1041"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01041-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,21]]},"assertion":[{"value":"11 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Missing Open Access funding information has been added in the Funding Note.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All Authors declare that they have no competing interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}