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 13 of 13 for “"Primitive polynomials"”.
-
Existence problems of primitive polynomials over finite fields
This thesis concerns existence of primitive polynomials over finite fields with one coefficient arbitrarily prescribed. It completes the proof of a fundamental conjecture of Hansen and Mullen (1992), which asserts that, with some explicable general exceptions, there always exists a primitive …
-
Testing Primitive Polynomials for Generalized Feedback Shift Register Random Number Generators
… The poor performance may be due to the choice of primitive polynomials used in the generators, rather than inherent flaws in the method. The original GFSR generators were all based on primitive trinomials. This project examines several alternative choices of primitive polynomials with more than …
-
M-Sequences Related to the Multifocal Electroretinogram: Identification of Appropriate Primitive Polynomials to Avoid Cross-Contamination in Multifocal Electroretinogram Responses
… the effects of cross contamination a series of primitive polynomials were found by constructing finite fields. The first order ERG response is formed by cross correlating the m-sequence with the physiological response. A second order response is formed by investigating particular flash sequences …
-
Pascal polynomials over GF(2)
… Problem (DLP) is a fundamental cryptographic primitive. The DLP is defined for any cyclic group, specifically finite fields, whether the integers modulo a prime p or a polynomial field of characteristic p modulo some irreducible polynomial f(x). For polynomial fields over a finite field, also …
-
The selection of better polynomials to reduce aliasing in signature analysis
… thesis is based on a search of better performing polynomials for signature analysis when used for the testing of digital circuits. Primitive polynomials are classified based on a number of different criteria and the evaluation of the performances of the polynomials of different classes is …
-
One-dimensional cellular automata and shrinking generators for pseudorandom sequence generation
Linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). These pseudorandom sequences demonstrate desirable randomness properties such as balance, run, and autocorrelation while exhibiting low linear complexity. …
-
Two dimensional cellular automata and pseudorandom sequence generation
… linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). An m-sequence is a pseudorandom sequence that exhibits ideal randomness properties like balance, run and autocorrelation but has low linear complexity. …
-
Exploring fields with shift registers
… implementation, and efficient attacks. Different polynomials can be used to generate the fields, and we explore the set of polynomials x^ 2 + x + a^J over GF(2^n) where a is a primitive element of GF(2^n). The results of this work are the first steps towards a full understanding of the field that …
-
Novel Algorithms and Hardware Architectures for Computational Subsystems Used in Cryptography and Error Correction Coding
… its syndrome is also of particular interest. Primitive polynomials play a crucial role in the hardware realizations for error-correcting codes. This research describes an implementation of a scalable primitive polynomial circuit with coefficients in GF(2). The standard cell area and power …
-
Implementation of OFDM Encryption and a New Frequency Hopping System
… the collision properties of two distinct binary primitive polynomials of the same degree for the new FH system have been analysed and simulated.
-
Variable Strength Covering Arrays
… using linear feedback shift registers from primitive polynomials of degree 3 over arbitrary finite fields to find variable strength covering arrays, which we extend to strength-3 covering arrays whose sizes are smaller than many of the best known sizes of covering arrays. We then give an …
-
A security coprocessor for next generation IP telephony: architecture, abstraction, and strategies
… for any irreducible polynomial, not only the primitive polynomials, is proposed. Moreover, the modified algorithm is used to find the optimum matrix that gives the minimum delay. The matrix is then used to implement the SubBytes/InvSubBytes transformation using composite fields, which in turn …