nach oben

Designs, Codes and Cryptography

Erschienen in:

23.05.2019

Further Results on the Morgan–Mullen Conjecture

verfasst von: Theodoulos Garefalakis, Giorgos Kapetanakis

Erschienen in: Designs, Codes and Cryptography | Ausgabe 11/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Let \(\mathbb {F}_q\) be the finite field of characteristic p with q elements and \(\mathbb {F}_{q^n}\) its extension of degree n. The conjecture of Morgan and Mullen asserts the existence of primitive and completely normal elements (PCN elements) for the extension \(\mathbb {F}_{q^n}/\mathbb {F}_q\) for any q and n. It is known that the conjecture holds for \(n \le q\). In this work we prove the conjecture for a larger range of exponents. In particular, we give sharper bounds for the number of completely normal elements and use them to prove asymptotic and effective existence results for \(q\le n\le O(q^\epsilon )\), where \(\epsilon =2\) for the asymptotic results and \(\epsilon =1.25\) for the effective ones. For n even we need to assume that \(q-1\not \mid n\).

Vorheriger Artikel New theoretical bounds and constructions of permutation codes under block permutation metric

Nächster Artikel Partial geometric designs from group actions

Blessenohl D., Johnsen K.: Eine verschärfung des satzes von der normalbasis. J. Algebra 103(1), 141–159 (1986).MathSciNetCrossRef

Cohen S.D., Hachenberger D.: Primitive normal bases with prescribed trace. Appl. Algebra Eng. Commun. Comput. 9(5), 383–403 (1999).MathSciNetCrossRef

Cohen S.D., Huczynska S.: The primitive normal basis theorem—without a computer. J. London Math. Soc. 67(1), 41–56 (2003).MathSciNetCrossRef

Cohen S.D., Huczynska S.: The strong primitive normal basis theorem. Acta Arith. 143(4), 299–332 (2010).MathSciNetCrossRef

Diffie W., Hellman M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976).MathSciNetCrossRef

Gao, S.: Normal Basis over Finite Fields. PhD thesis, University of Waterloo (1993)

Garefalakis T., Kapetanakis G.: On the existence of primitive completely normal bases of finite fields. J. Pure Appl. Algebra 223(3), 909–921 (2019).MathSciNetCrossRef

Hachenberger D.: Finite Fields: Normal Bases and Completely Free Elements, Kluwer International Series in Engineering and Computer Science, vol. 390. Kluwer Academic Publishers, Boston, MA (1997).CrossRef

Hachenberger D.: Primitive complete normal bases: existence in certain 2-power extensions and lower bounds. Discret. Math. 310(22), 3246–3250 (2010).MathSciNetCrossRef

10.

Hachenberger D.: Completely normal bases. In: Mullen G.L., Panario D. (eds.) Handbook of Finite Fields, pp. 128–138. CRC Press, Boca Raton (2013).MATH

11.

Hachenberger D.: Asymptotic existence results for primitive completely normal elements in extensions of Galois fields. Des. Codes Cryptogr. 80(3), 577–586 (2016).MathSciNetCrossRef

12.

Hsu C., Nan T.: A generalization of the primitive normal basis theorem. J. Number Theory 131(1), 146–157 (2011).MathSciNetCrossRef

13.

Kapetanakis G.: An extension of the (strong) primitive normal basis theorem. Appl. Algebra Eng. Commun. Comput. 25(5), 311–337 (2014).MathSciNetCrossRef

14.

Kapetanakis G.: Normal bases and primitive elements over finite fields. Finite Fields Appl. 26, 123–143 (2014).MathSciNetCrossRef

15.

Lenstra Jr. H.W., Schoof R.J.: Primitive normal bases for finite fields. Math. Comput. 48(177), 217–231 (1987).MathSciNetCrossRef

16.

Lidl R., Niederreiter H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997).MATH

17.

Morgan I.H., Mullen G.L.: Completely normal primitive basis generators of finite fields. Util. Math. 49, 21–43 (1996).MathSciNetMATH

18.

Robin G.: Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann. J. Math. Pures Appl. 63(2), 187–213 (1984).MathSciNetMATH

Titel: Further Results on the Morgan–Mullen Conjecture
verfasst von: Theodoulos Garefalakis
Giorgos Kapetanakis
Publikationsdatum: 23.05.2019
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 11/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-019-00643-8

Springer Professional

Further Results on the Morgan–Mullen Conjecture

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 11/2019

A general private information retrieval scheme for MDS coded databases with colluding servers

New theoretical bounds and constructions of permutation codes under block permutation metric

Hamming correlation properties of the array structure of Sidelnikov sequences

Further study on the maximum number of bent components of vectorial functions

Partitioned difference families versus zero-difference balanced functions

A new Gaussian sampling for trapdoor lattices with arbitrary modulus

Premium Partner