关于有限域上最优正规基的分布(英文)

设E/F_q为q元有限域F_q的扩域.如果α∈E生成E/F_q的一个正规基,则称α∈E为E的一个正规基生成元.本文证明了:对于任何中间域K,E的正规元被E到K的迹映射均匀的映到K的正规元.另一方面,给出了所有这样的中间域K:K中的正规元在E到K的迹映射下的完全原像中的元均为E中的正规元.     

用Dickson多项式构造差集

最近,Dillon和Dobbertin证明了在有限域Fq(q=2m)的乘法群中,多项式(x+1)d+xd+1(其中d=22k-2k+1)的像集是一个新的具有Singer参数的循环差集.利用有限域上的Fourier分析,本文证明了在有限域Fq(q=2m)的乘法群中,一些用Dickson多项式构造的集合是具有Singer参数的循环差集.     

Explicit factors of generalized cyclotomic polynomials and generalized Dickson polynomials of order 2m3 over finite fields

In this paper, we derive explicit factorizations of generalized cyclotomic polynomials and generalized Dickson polynomials of the first kind of order $2^{m}3$, over finite field $F_q$.     

有限域上的本原最优正规元

Let q be a prime or prime power and Fqn the extension of q elements finite field Fq with degree n(n1).Davenport,Lenstra and Schoof proved that there exists a primitive element α∈ Fqn such that α generates a normal basis of Fqn over Fq.Later,Mullin,Gao and Lenstra,etc.,raised the definition of optimal normal bases and constructed such bases.In this paper,we determine all primitive type I optimal normal bases and all finite fields in which there exists a pair of reciprocal elements α and α-1 such that both of them generate optimal normal bases of Fqn over Fq.Furthermore,we obtain a sufficient condition for the existence of primitive type II optimal normal bases over finite fields and prove that all primitive optimal normal elements are conjugate to each other.     

Normal Bases and Their Dual-Bases over Finite Fields

In this paper, we prove the following results： 1） A normal basis N over a finite field is equivalent to its dual basis if and only if the multiplication table of N is symmetric; 2） The normal basis N is self-dual if and only if its multiplication table is symmetric and Tr（α^2） = 1, where α generates N; 3） An optimal normal basis N is self-dual if and only if N is a type-Ⅰ optimal normal basis with q = n = 2 or N is a type-Ⅱ optimal normal basis.     

有限域上最优正规基的乘法表

本文给出了有限域上最优正规基乘法表的一个计算方法,改进了孙琦的相应结果.在有限域上椭圆曲线密码体制的应用中,本文给出的算法是非常有效的.     

Explicit factorizations of generalized Dickson polynomials of order 2m via generalized cyclotomic polynomials over finite fields

We derive explicit factorizations of generalized cyclotomic polynomials of order $2^m$ and generalized Dickson polynomials of the first kind of order $2^m$ over finite field $F_q$.     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

有限域上互反本原正规元的存在性

设q是素数方幂,n是正整数,Fqn是qn个元素的有限域．本文证明了:当正整数n≥32时,对任意的素数方幂q,存在Fqn中的本原元ξ满足ξ和ξ-1都是Fqn 在Fq上的正规元,也即{ξ,ξq,…,ξqn-1}和{ξ-1,ξ-q,…,ξ-qn-1)都构成Fqn在Fq 上的本原正规基．     

An explanation for the similar appearance of two identities involving Dickson polynomials

This article explains the similar appearance of two polynomial identities involving Dickson polynomials in char. 2, one found by Abhyankar, Cohen and Zieve, and the other found by the author.     

有限域上存在弱自对偶正规基的一个充要条件

对于将有限域上的自对偶基概念推广到了更一般的弱自对偶的情形,给出了有限域上存在这类正规基的一个充妥条件:设q为素数幂,E=Fqn为q元域F=Fq的n次扩张,N={αi=αqi|i=0,1,…,n-1}为E在F上的一组正规基．则存在c∈F*及r,0≤r≤n-1,使得β=cαr生成N的对偶基的充要条件是以下三者之一成立: (1)q为偶数且n≠0(mod 4);(2) n与q均为奇数;(3)q为奇数,n为偶数,(-1)为F中的非平方元且r为奇数．     

On Invariants and Strict Systems of Irreducible Polynomials Over Henselian Valued Fields

Let g(x) be a monic irreducible defectless polynomial over a henselian valued field (K, v), i.e., K(θ) is a defectless extension of (K, v) for any root θ of g(x). It is known that a complete distinguished chain for θ with respect to (K, v) gives rise to several invariants associated with g(x). Recently Ron Brown studied certain invariants of defectless polynomials by introducing strict systems of polynomial extensions. In this article, the authors establish a one-to-one correspondence between strict systems of polynomial extensions and conjugacy classes of complete distinguished chains. This correspondence leads to a simple interpretation of various results proved for strict systems. The authors give new characterizations of an invariant γ _g introduced by Brown.     

Bivariate identities related to Chebyshev and Dickson polynomials over Fq

Let ${\mathbb{F}}_q$ be a field of q elements, where q is a power of an odd prime p. The polynomial $f(y)\in {\mathbb{F}}_q[y]$ defined by$f(y):={(1+\sqrt{y})}^{(q+1)/2}+{(1-\sqrt{y})}^{(q+1)/2}$ has the property that$f(1-y)=\rho (2)f(y),$ where ρ is the quadratic character on ${\mathbb{F}}_q$. This univariate identity was applied to prove a recent theorem of N. Katz. We formulate and prove a bivariate extension, and give an application to quadratic residuacity.     

The Identities and Central Polynomials of the Finite Dimensional Unitary Grassmann Algebras Over a Finite Field

We describe the T-ideal of identities and the T-space of central polynomials for the unitary finite dimensional Grassmann algebra over a finite field.     

The Identities and the Central Polynomials of the Infinite Dimensional Unitary Grassmann Algebra Over a Finite Field

We describe the T-ideal of identities and the T-space of central polynomials for the infinite dimensional unitary Grassmann algebra over a finite field.     

Cyclotomic Polynomials and Finite Automorphisms of Groups

We introduce minimal polynomials for finite automorphisms of commutative groups and relate them to the exponent of the fixed points and to the reducibility of the group. Some results can be extended to the noncommutative case.     

Subquadratic-time factoring of polynomials over finite fields

New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of degree over a finite field of constant cardinality in time . Previous algorithms required time . The new algorithms rely on fast matrix multiplication techniques. More generally, to factor a polynomial of degree over the finite field with elements, the algorithms use arithmetic operations in .

The new ``baby step/giant step' techniques used in our algorithms also yield new fast practical algorithms at super-quadratic asymptotic running time, and subquadratic-time methods for manipulating normal bases of finite fields.

     

F_(16)上线性化的正形置换多项式的形式与计数

利用置换多项式理论的有关结果,给出了有限域F16上线性化的正形置换多项式的具体表示形式及计数,其中得出其个数为1604.