2,147 research outputs found

    Multiplicative Order of Gauss Periods

    Full text link
    We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of J. von zur Gathen and I. E. Shparlinski.Comment: 9 page

    Construction of self-dual normal bases and their complexity

    Get PDF
    Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer search, to identify the lowest complexity of self-dual normal bases for extensions of low degree. Comparisons to similar searches amongst normal bases show that the lowest complexity is often achieved from a self-dual normal basis

    The Gaussian normal basis and its trace basis over finite fields

    Get PDF
    AbstractIt is well known that normal bases are useful for implementations of finite fields in various applications including coding theory, cryptography, signal processing, and so on. In particular, optimal normal bases are desirable. When no optimal normal basis exists, it is useful to have normal bases with low complexity. In this paper, we study the type k(⩾1) Gaussian normal basis N of the finite field extension Fqn/Fq, which is a classical normal basis with low complexity. By studying the multiplication table of N, we obtain the dual basis of N and the trace basis of N via arbitrary medium subfields Fqm/Fq with m|n and 1⩽m⩽n. And then we determine all self-dual Gaussian normal bases. As an application, we obtain the precise multiplication table and the complexity of the type 2 Gaussian normal basis and then determine all optimal type 2 Gaussian normal bases

    Part I:

    Get PDF
    • …
    corecore