Low-complexity multiplexer-based normal basis multiplier over GF（2^m）

We present a new normal basis multiplication scheme using a multiplexer-based algorithm. In this algorithm, the proposed multiplier processes in parallel and has a multiplexer-based structure that uses MUX and XOR gates instead of AND and XOR gates. We show that our multiplier for type-1 and type-2 normal bases saves about 8% and 16%, respectively, in space complexity as compared to existing normal basis multipliers. Finally, the proposed architecture has regular and modular con-figurations and is well suited to VLSI implementations.

Two Normal Basis Multiplication Algorithms for GF（2^n）

For software implementations, word-level normal basis multiplication algorithms utilize the full data-path of the processor, and hence are more efficient than the bit-level multiplication algorithm presented in the IEEE standard P1363-2000. In this paper, two word-level normal basis multiplication algorithms are proposed for GF（2^n）. The first algorithm is suitable for high complexity normal bases, while the second algorithm is fast for type-I optimal normal bases and low complexity normal bases. Theoretical analyses and experimental results both indicate that the presented algorithms are efficient in GF（2^233）, GF（2^283）, GF（2^409）, and GF（2^571）, which are four of the five binary fields recommended by the National Institute of Standards and Technology （NIST） for the elliptic curve digital signature algorithm （ECDSA） applications.

A new adaptive state space construction method for the mobile robot navigation

In order to solve the combinative explosion problems in a continuous and high dimensional statespace,a function approximation approach is usually used to represent the state space.The normalized ra-dial basis function(NRBF)was adopted as the local function approximator and a kind of adaptive statespace construction strategy based on the NRBF(ASC-NRBF)was proposed,which enables the system toallocate appropriate number and size of the basis functions automatically.Combined with the reinforce-ment learning method,the proposed ASC-NRBF method was applied to the robot navigation problem.Simulation results illustrate the performance of the proposed method.

A novel robust adaptive controller for EAF electrode regulator system based on approximate model method

The electrode regulator system is a complex system with many variables, strong coupling and strong nonlinearity, while conventional control methods such as proportional integral derivative （PID） can not meet the requirements. A robust adaptive neural network controller （RANNC） for electrode regulator system was proposed. Artificial neural networks were established to learn the system dynamics. The nonlinear control law was derived directly based on an input-output approximating method via the Taylor expansion, which avoids complex control development and intensive computation. The stability of the closed-loop system was established by the Lyapunov method. The current fluctuation relative percentage is less than ±8% and heating rate is up to 6.32 ℃/min when the proposed controller is used. The experiment results show that the proposed control scheme is better than inverse neural network controller （INNC） and PID controller （PIDC）.

ON THE COMPLEXITY OF THE NORMAL BASES VIA PRIME GAUSS PERIOD OVER FINITE FIELDS

A formula on the complexity of the normal bases generated by prime Gauss period overfinite fields is presented in terms of cyclotomic numbers.Then,the authors determine explicitly thecomplexity of such normal bases and their dual bases in several cases where the related cyclotomicnumbers have been calculated.Particularly,the authors find several series of such normal bases withlow complexity.

A New Criterion on k-Normal Elements over Finite Fields

The notion of normal elements for finite fields extension was generalized as k-normal elements by Huczynska et al.(2013).Several methods to construct k-normal elements were presented by Alizadah et al.(2016)and Huczynska et al.(2013),and the criteria on k-normal elements were given by Alizadah et al.(2016)and Antonio et al.(2018).In the paper by Huczynska,S.,Mullen,G.,Panario,D.and Thomson,D.(2013),the number of k-normal elements for a fixed finite field extension was calculated and estimated.In this paper the authors present a new criterion on k-normal elements by using idempotents and show some examples.Such criterion was given for usual normal elements before by Zhang et al.(2015).

On Existence of Primitive Normal Elements of Cubic Form over Finite Fields

For a prime p and a positive integer k,let q=p^(k) and F_(q)^(n) be the extension field of F_(q).We derive a sufficient condition for the existence of a primitive element α in F_(q)^(n) such that α^(3)-α+1 is also a primitive element of F_(q)^(n) ,a sufficient condition for the existence of a primitive normal element a in F_(q)^(n) over F_(q) such that α(3)-α+1 is a primitive element of F_(q)^(n) ,and a suficient condition for the existence of a primitive normal element a in F_(q)^(n) over F_(q) such that а^(3)-а+1 is also a primitive normal element of F_(q)^(n) over F_(q).

F[x]-lattice basis reduction algorithm and multisequence synthesis

By means of F[x]-lattice basis reduction algorithm, a new algorithm is presented for synthesizing minimum length linear feedback shift registers (or minimal polynomials) for the given mul-tiple sequences over a field F. Its computational complexity is O(N2) operations in F where N is the length of each sequence. A necessary and sufficient condition for the uniqueness of minimal polynomi-als is given. The set and exact number of all minimal polynomials are also described when F is a finite field.

On the Existence for Some Special Primitive Elements in Finite Fields

Let F_q be a finite field of characteristic p. In this paper, by using the index sum method the authors obtain a sufficient condition for the existence of a primitive elementα∈ F_(q^n) such that α + α^(-1)is also primitive or α + α^(-1)is primitive and α is a normal element of F_(q^n) over F_q.

An algorithm for computing the factor ring of an ideal in a Dedekind domain with finite rank

We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial time. We provide two applications of the algorithm:judging whether a given ideal is prime or prime power. The main algorithm is based on basis representation of finite rings which is computed via Hermite and Smith normal forms.