Low latency systolic multipliers for finite field GF（2m） based on irreducible polynomials

Systolic implementation of multiplication over GF(2m) is usually very efficient in area-time complexity,but its latency is usually very large.Thus,two low latency systolic multipliers over GF(2m) based on general irreducible polynomials and irreducible pentanomials are presented.First,a signal flow graph(SFG) is used to represent the algorithm for multiplication over GF(2m).Then,the two low latency systolic structures for multiplications over GF(2m) based on general irreducible polynomials and pentanomials are presented from the SFG by suitable cut-set retiming,respectively.Analysis indicates that the proposed two low latency designs involve at least one-third less area-delay product when compared with the existing designs,To the authors' knowledge,the time-complexity of the structures is the lowest found in literature for systolic GF(2m) multipliers based on general irreducible polynomials and pentanomials.The proposed low latency designs are regular and modular,and therefore they are suitable for many time critical applications.

Fault Attacks on Hyperelliptic Curve Discrete Logarithm Problem over Finite Fields

In this paper, we present two explicit invalid-curve attacks on the genus 2 hyperelliptic curve over a finite field. First, we propose two explicit attack models by injecting a one-bit fault in a given divisor. Then, we discuss the construction of an invalid curve based on the faulted divisor. Our attacks are based on the fact that the Hyperelliptic Curve Scalar Multiplication (HECSM) algorithm does not utilize the curve parameters and We consider three hyperelliptic curves as the attack targets. For curve with security level 186 (in bits), our attack method can get the weakest invalid curve with security level 42 (in bits); there are 93 invalid curves with security level less than 50. We also estimate the theoretical probability of getting a weak hyperelliptic curve whose cardinality is a smooth integer. Finally, we show that the complexity of the fault attack is subexponential if the attacker can freely inject a fault in the input divisor. Cryptosystems based on the genus 2 hyperelliptic curves cannot work against our attack algorithm in practice.

Using Normal Form of Nilpotent Matrices over Finite Fields to Construct Cartesian Authentication Codes

Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.

AN ANZAHL THEOREM IN SINGULAR PSEUDO-SYMPLECTIC GEOMETRY OVER FINITE FIELDS

This paper obtains formulas for the number of subspaces of a given type contained in a given subspace in singular pseudo-symplectic geometry.

Carter subgroups of singular classical groups over finite fields

Let F q be a finite field with qelements where q=p~α. In the present paper, the authors study the existence and structure of Carter subgroups of singular symplectic group Sp (n+t,n)(F q), singular unitary group U (n+t,n)(F (q^2)) and singular orthogonal group O (n+t,n)(F q)(n is even) over finite fields F q.

The Construction of Symplectic Involutions Over Finite Field with CharF=2 and Its Applications

In the present paper, we compute the number of the symplectic involaLions over the finite field F with chafF = 2, and also one Cartesian authentication code is obtained.Furthermore, its size parameters are computed completely. If assume that the coding rules are chosen according to a uniform probability, PI and Ps denote the largest probabilities of a successful impersonation attack and a successful substitution attack respectively, then PI and Ps are also computed.

SOME PRIMITIVE POLYNOMIALS OVER FINITE FIELDS

This paper proves that if qn is large enough, for each element a and primitive element b of Fq, there etists a primitive polynomial of degree n ≥5 over the finite field Fq having a as the coefficient of xn-1 and b as the constant term. This proves that if qn is large enongh, for each element a ∈Fq, there exists a primitive polynomial of degree n ≥ 5 over Fq having a as the coefficient of x.

On the Number of Solutions of Some Type Equations in Finite Fields

By establishing the connection between graph colouring and the solution of some equation systems in finite fields, we obtain some formulas to the number of solutions of some equation systems in finite fields, in terms of chromatic polynomial of a graph.

Some Secret Sharing Schemes Based on the Finite Fields

A （t, n）--secret sharing scheme is a method of distribution of information among n participants such that t 〉 1 can reconstruct the secret but （t - 1） cannot. We explore some （k, n）--secret sharing schemes based on the finite fields.

Construction of PBIB Desings by Using Subspace of Vector Space over Finite Fields

A new transitivity theorem of the general linear group GLn(Fq)is proved. A kind of new PBIB desings is constructed.

Some New Results about Trigonometry in Finite Fields

In this paper, we study about trigonometry in finite field, we know that , the field with p elements, where p is a prime number if and only if p = 8k + 1 or p = 8k -1. Let F and K be two fields, we say that F is an extension of K, if K⊆F or there exists a monomorphism f: K→F. Recall that , F[x] is the ring of polynomial over F. If (means that F is an extension of K), an element is algebraic over K if there exists such that f(u) = 0 (see [1]-[4]). The algebraic closure of K in F is , which is the set of all algebraic elements in F over K.

Zeros of Complete Symmetric Polynomials over Finite Fields

Wan and Zhang(2021) obtained a nontrivial lower bound for the number of zeros of complete symmetric polynomials over finite fields,and proposed a problem whether their bound can be improved.In this paper,the author improves Wan-Zhang's bound from three aspects.The proposed results are based on the estimates related to the number of certain permutations and the value sets of non-permutation polynomials associated to the complete symmetric polynomial.And the author believes that there are still possibilities to improve the bounds and hence Wan-Zhang's bound.

Approximate Synchronization of Multi-Agent Systems over Finite Fields

In this paper,the approximate synchronization of leader-follower multiagent systems(MASs) over finite fields is studied in regard to local and global synchronization.First,the approximately synchronous state set(ASSS) is obtained.Second,combined with ASSS and transient periods,some criteria for the local and global approximate synchronization of systems are given.Moreover,the algorithms for calculating the maximum approximately synchronous basin(MASB) and the maximum control invariant set(MCIS) are presented.Third,the global approximate synchronization of the system is achieved by designing the state feedback control,and a design algorithm of the controller using the truth matrix method is proposed.Moreover,the results of approximate synchronization are degenerated to complete synchronization.Last,two examples are shown to demonstrate the results of this paper.

Dielectric Constant Calculation of Poly(vinylidene fluoride)Based on Finite Field and Density Functional Theory

In this study,we proposed a novel method that integrates density functional theory(DFT)with the finite field method to accurately estimate the polarizability and dielectric constant of polymers.Our approach effectively accounts for the influence of electronic and geometric conformation changed on the dielectric constant.We validated our method using polyethylene(PE)and polytetrafluoroethylene(PTFE)as benchmark materials,and found that it reliably predicted their dielectric constants.Furthermore,we explored the impact of conformation variations in poly(vinylidene fluoride)(PVDF)on its dielectric constant and polarizability.The resulting dielectric constants ofα-andγ-PVDF(3.0)showed excellent agreement with crystalline PVDF in experiments.Our findings illuminate the relationship between PVDF’s structural properties and its electrical behavior,offering valuable insights for material design and applications.

Effect of Types and Orders of Electromagnetic Field Finite Element Meshes on Power Communication Harmonic Parameters Calculation Results of Tubular Hydrogenerators

In generator design field,waveform total harmonic distortion(THD)and telephone harmonic factor(THF)are parameters commonly used to measure the impact of generator no-load voltage harmonics on the power communication quality.Tubular hydrogenerators are considered the optimal generator for exploiting low-head,high-flow hydro resources,and they have seen increasingly widespread application in China's power systems recent years.However,owing to the compact and constrained internal space of such generators,their internal magnetic-field harmonics are pronounced.Therefore,accurate calculation of their THD and THF is crucial during the analysis and design stages to ensure the quality of power communication.Especially in the electromagnetic field finite element modeling analysis of such generators,the type and order of the finite element meshes may have a significant impact on the THD and THF calculation results,which warrants in-depth research.To address this,this study takes a real 34 MW large tubular hydrogenerator as an example,and establishes its electromagnetic field finite element model under no-load conditions.Two types of meshes,five mesh densities,and two mesh orders are analyzed to reveal the effect of electromagnetic field finite element mesh types and orders on the calculation results of THD and THF for such generators.

Using Normal Form of Matrices over Finite Fields to Construct Cartesian Authentication Codes

In this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the P I and P S , which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack respectively, of these codes are also computed.

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.

On the differential uniformities of functions over finite fields

In this paper, the possible value of the differential uniformity of a function over finite fields is discussed. It is proved that, the differential uniformity of a function over Fq can be any even integer between 2 and q when q is even; and it can be any integer between 1 and q except q-1 when q is odd. Moreover, for any possible differential uniformity t, an explicit construction of a differentially t-uniform function is given.

Note on the Number of Solutions of Cubic Diagonal Equations over Finite Fields

Let Fqbe the finite field,q=p^(k),with p being a prime and k being a positive integer.Let F_(q)^(*)be the multiplicative group of Fq,that is F_(q)^(*)=F_(q){0}.In this paper,by using the Jacobi sums and an analog of Hasse-Davenport theorem,an explicit formula for the number of solutions of cubic diagonal equation x_(1)^(3)+x_(2)^(3)+…+x_(n)^(3)=c over Fqis given,where c∈F_(q)^(*)and p≡1(mod 3).This extends earlier results.

Remarks on the Number of Rational Points on a Class of Hypersurfaces over Finite Fields

Let Fq be the finite field of q elements and f be a nonzero polynomial over Fq. For each b ∈ Fq, let Nq（f = b） denote the number of Fq-rational points on the affine hypersurface f = b. We obtain the formula of Nq（f= b） for a class of hypersurfaces over Fq by using the greatest invariant factors of degree matrices under certain cases, which generalizes the previously known results. We also give another simple direct proof to the known results.