Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"Normal basis"”.
-
Polynomials with special properties over finite fields
… problem. In Chapter 4 we extend the primitive normal basis theorem and its strong version. Namely, we consider the existence of polynomials whose roots are simultaneously primitive, produce a normal basis and some given Möbius transformation of those roots also produce a normal basis. First, we …
-
Primitive free elements of Galois fields
… structure of a finite field is the Primitive Normal Basis Theorem; this was established by Lenstra and Schoof in 1987 in a proof which was heavily computational in nature. In this thesis, a new, theoretical proof of the theorem is given, and new estimates (in some cases, exact values) are …
-
Hardware Implementations of the WG-16 Stream Cipher with Composite Field Arithmetic
… elements were analyzed, namely the polynomial basis representation, the normal basis representation and three isomorphic tower field constructions of F216: F(((22)2)2)2, F(24)4 and F(28)2. Each design option begins with an in-depth description of different field constructions and their impact …
-
Logic cell array designs for a (31,k) Reed-Solomon Codec
… a (31, k) Reed-Solomon Codec are examined. The normal basis and a power basis representation for GF(25) are considered with respect to the number of clock cycles and number of logical gates or configurable logic blocks required to implement Galois field addition, multiplication and inversion. …
-
Galois Module Structure Of Lubin-Tate Modules
… new Galois module we find an analogue of the normal basis theorem. When K is a proper unramified extension of Q p , we show that some eigenspaces for the Teichmüller character are not free. We also adapt certain cases of E. Noether’s result on normal integral bases for tame extensions. …
-
A Study of Permutation Polynomials over Finite Fields
Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigmaa isin Fq (x+a)n = gn,q(xq- x) gives rise to many permutation polynomials over finite fields. We are interested in triples (n,e;q) for which gn,q is a permutation polynomial of Fqe. In Chapters 2, 3, …
-
Efficient Hardware Constructions for Error Detection of Post-Quantum Cryptographic Schemes
… for finite field arithmetic with polynomial and normal basis, applicable to any classical or post-quantum cryptographic algorithms that use finite field block in their designs.
-
Low-Resource and Fast Elliptic Curve Implementations over Binary Edwards Curves
… performed in the small and efficient Gaussian normal basis. The recently presented formulas for mixed point addition by K. Kim, C. Lee, and C. Negre at Indocrypt 2014 were found to be invalid, but were corrected such that the speed and register usage were maintained. We utilize corrected mixed …
-
Concurrent Error Detection in Finite Field Arithmetic Operations
… bases, including polynomial, dual and/or normal basis, and implemented in various architectures, including bit-serial, bit-parallel and/or systolic arrays.
-
Σχεδιασμός κρυπτογραφικών συστημάτων δημοσίου κλειδιού
… versatile design and inversion when polynomial basis representation of the GF(2ᵏ) is employed. Also, a multiplication design methodology is proposed along with resulting sequential (SMPO) and parallel hardware architectures when normal basis representation of the GF(2ᵏ) is chosen. Finally, on …