Normal bases via general Gauss periods

نویسندگان

  • Sandra Feisel
  • Joachim von zur Gathen
  • Amin Shokrollahi
چکیده

Gauss periods have been used successfully as a tool for constructing normal bases in finite fields. Starting from a primitive rth root of unity, one obtains under certain conditions a normal basis for Fqn over Fq, where r is a prime and nk = r− 1 for some integer k. We generalize this construction by allowing arbitrary integers r with nk = φ(r), and find in many cases smaller values of k than is possible with the previously known approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abelian Groups, Gauss Periods, and Normal Bases

A result on finite abelian groups is first proved and then used to solve problems in finite fields. Particularly, all finite fields that have normal bases generated by general Gauss periods are characterized and it is shown how to find normal bases of low complexity. Dedicated to Professor Chao Ko on his 90th birthday.

متن کامل

Gauss periods as constructions of low complexity normal bases

Optimal normal bases are special cases of the so-called Gauss periods (Disquisitiones Arithmeticae, Articles 343-366); in particular, optimal normal bases are Gauss periods of type (n,1) for any characteristic and type (n,2) for characteristic 2. We present the multiplication tables and complexities of Gauss periods of type (n, t) for all n and t = 3,4,5 over any finite field and give a slightl...

متن کامل

Multiplicative Order of Gauss Periods

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.

متن کامل

On Rationally Parametrized Modular Equations

Many rationally parametrized elliptic modular equations are derived. Each comes from a family of elliptic curves attached to a genus-zero congruence subgroup Γ0(N), as an algebraic transformation of elliptic curve periods, parametrized by a Hauptmodul (function field generator). The periods satisfy a Picard–Fuchs equation, of hypergeometric, Heun, or more general type; so the new modular equati...

متن کامل

Gauss periods: orders and cryptographical applications

Experimental results on the multiplicative orders of Gauss periods in finite fields are presented. These results indicate that Gauss periods have high order and are often primitive (self-dual) normal elements in finite fields. It is shown that Gauss periods can be exponentiated in quadratic time. An application is an efficient pseudorandom bit generator.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 68  شماره 

صفحات  -

تاریخ انتشار 1999