This paper presents some structure results for Gaussian normal bases of , and uses the results to devise faster multiplication algorithms for Boneh-Franklin and Sakai-Kasahara identity-based encryption schemes.Expand

An algorithm that by using the and 1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algorithm for Koblitz elliptic curves and suitable irreducible polynomials that lead to efficient implementations of both and 1 are reported, showing that this algorithm can be effectively applied on all the NIST-recommended curves.Expand

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 von zur Gathen and Shparlinski.

One of the important interventions to increase job satisfaction among nurses maybe improvement in the workplace by reducing the level of workload and minimizing role conflict through reducing conflicting demands are recommended.Expand

This paper investigates the number of trace-one elements in a polynomial basis for F with trinomial or pentanomial case, in which case field multiplication can also be efficiently implemented.Expand

A simple deterministic test for deciding whether or not a non-zero element in F 2 n or F 3 n is a zero of the corresponding Kloosterman sum over these fields is proposed, and its complexity is analysed.Expand

In this note, first we show that there is no stable quadratic polynomial over finite fields of characteristic two and then show that there exist stable quadratic polynomials over function fields ofâ€¦ Expand