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 20 of 270 for “"finite fields"”.

  1. Constructing polynomials over finite fields

    In this paper we present an algorithm for constructing a polynomial system corresponding to a given directed labeled graph. Three specific classes of polynomial systems are considered in detail. Then we briefly consider some desirable properties for output sequences and we show how to construct a …

    ttu Repository record for Constructing polynomials over finite fields (opens in a new tab)

  2. Permutation Polynomials of Finite Fields

    <p>A permutation polynomial of a finite field K is one for which the associated polynomial function is a one-to-one map from K onto itself. The purpose of this paper is to explain and demonstrate how algebraic geometry can be employed in determining permutation polynomials of finite fields of …

    ut-knoxville Repository record for Permutation Polynomials of Finite Fields (opens in a new tab)

  3. Random Polynomials Over Finite Fields

    … is to take some questions about polynomials over finite fields and 'answer' them using probability theory; that is, we give the average behaviour of certain properties of polynomials. We tend to deal with multivariate polynomials, so questions about factorisation are not considered. Questions …

    glasgow Download PDF for Random Polynomials Over Finite Fields (opens in a new tab)

  4. Interleaved Sequences Over Finite Fields

    We study cryptographic properties such as correlation, correlation measure and linear complexity profile of the sequences defined by characters with interleaved structure. Families of pseudorandom sequences with low cross correlation have important applications in communications and cryptography. …

    carleton Repository record for Interleaved Sequences Over Finite Fields (opens in a new tab)

  5. Discrete Dynamics over Finite Fields

    … on dynamics of certain nonlinear maps over finite fields. First we study monomial dynamics over finite fields. We show that determining the number of fixed points of a boolean monomial dynamics is #P–complete problem and consider various cases in which the dynamics can be explained …

    clemson Repository record for Discrete Dynamics over Finite Fields (opens in a new tab)

  6. Random Vectors Over Finite Fields

    The study of random objects is a useful one in many applications and areas of mathematics. The Probabilistic Method, introduced by Paul Erdos and his many collaborators, was first used to study the behavior of random graphs and later to study properties of random objects. It has developed as a …

    clemson Repository record for Random Vectors Over Finite Fields (opens in a new tab)

  7. Primitive Elements in Finite Fields

    Made available in DSpace on 2015-09-28T15:19:48Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3153400.pdf: 2638455 bytes, checksum: f36c631d1df9b18c8543057bd2169071 (MD5) Previous issue date: 2004

    uiuc Repository record for Primitive Elements in Finite Fields (opens in a new tab)

  8. Elliptic Curves Over Finite Fields

    … on the the theory of elliptic curves over finite fields. In Chapter 1, affine and projective planes are introduced. Chapter 2 introduces the theory of algebraic curves and the Weierstrass Normal Form of a cubic curve is derived. In Chapter 3 we define derivations on arbitrary polynomial …

    maynooth Download PDF for Elliptic Curves Over Finite Fields (opens in a new tab)

  9. Certain Diagonal Equations over Finite Fields

    Let Fqt be the finite field with qt elements and let F*qt be its multiplicative group. We study the diagonal equation axq−1 + byq−1 = c, where a,b and c ∈ F*qt. This equation can be written as xq−1+αyq−1 = β, where α, β ∈ F ∗ q t . Let Nt(α, β) denote the number of solutions (x,y) ∈ F*qt × F*qt of …

    usf Repository record for Certain Diagonal Equations over Finite Fields (opens in a new tab)

  10. Representations of quivers over finite fields

    … by counting the representations of quivers over finite fields. A classical result states that the dimension vectors of the absolutely indecomposable representations of a quiver Γ are in one-to-one correspondence with the positive roots of a root system Δ, which is infinite in general. For a given …

    unsw Repository record for Representations of quivers over finite fields (opens in a new tab)

  11. Monomial Dynamical Systems over Finite Fields

    … is an important problem in the theory of finite dynamical systems. For monomial dynamical systems, that is, a system that can be described by monomials, information about the limit cycles can be obtained from the monomials themselves. In particular, this work contains sufficient and …

    vt Repository record for Monomial Dynamical Systems over Finite Fields (opens in a new tab)

  12. Counting Artin-Schreier curves over finite fields

    … types of curves of a certain genus g over a finite field k := Fq of characteristic p where p is a prime and q = pm for some positive integer m. These include elliptic curves (Howe), hyperelliptic curves (Brock and Granville), supersingular curves when p = 2 and g = 2 (Van der Geer and Van der …

    colostate Repository record for Counting Artin-Schreier curves over finite fields (opens in a new tab)

  13. The Minimum Rank Problem Over Finite Fields

    … graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs and show that many of these are minimal forbidden subgraphs for any field. Our second main result is a structural characterization of all graphs having minimum rank at …

    byu Repository record for The Minimum Rank Problem Over Finite Fields (opens in a new tab) Download PDF for The Minimum Rank Problem Over Finite Fields (opens in a new tab)

  14. Deterministic Factorization of Polynomials over Finite Fields

    … and unconditionally factoring polynomials over finite fields. We give efficient algorithms for the factorization of some odd degree polynomials over finite fields. We remove the assumption of the Extended Riemann Hypothesis from a well known algorithm for factoring polynomials over finite fields …

    carleton Repository record for Deterministic Factorization of Polynomials over Finite Fields (opens in a new tab)

  15. Polynomials with special properties over finite fields

    … of polynomials with special properties over finite fields. In Chapter 2 some background material is presented. We present some basic concepts of characters of finite abelian groups and we prove some basic results. Next, we focus on Dirichlet characters and on the characters of the additive …

    greece Repository record for Polynomials with special properties over finite fields (opens in a new tab)

  16. Character Sum Estimates in Finite Fields and Applications

    … estimates for sums ofvarious types occurring in finite fields. The sums in question generally have anarithmetic combinatorial flavour and we give applications of suchestimates to problems in arithmetic combinatorics and analytic number theory.Conversely, we demonstrate ways in which the theory of …

    toronto-retro Repository record for Character Sum Estimates in Finite Fields and Applications (opens in a new tab)

  17. Extension theorems in vector spaces over finite fields

    … paraboloids, and cones in vector spaces over finite fields. We obtain the best possible result for the extension theorems related to nondegenerate quadratic curves in two dimensional vector spaces over finite fields. In higher even dimensions, we improve upon the Tomas-Stein exponents which …

    missouri Repository record for Extension theorems in vector spaces over finite fields (opens in a new tab)

  18. Trace Forms Over Finite Fields of Characteristic Two

    … provides elementary facts about trace forms over finite fields of characteristic two in order to generalize some results concerning Gold functions. Then determines new set of maximal Artin-Schreier curves with possible pair of invariants, finds possible trace forms with specific co-dimemntion and …

    siu-theses Repository record for Trace Forms Over Finite Fields of Characteristic Two (opens in a new tab)

  19. Multiple bit error correcting architectures over finite fields

    This thesis proposes techniques to mitigate multiple bit errors in GF arithmetic circuits. As GF arithmetic circuits such as multipliers constitute the complex and important functional unit of a crypto-processor, making them fault tolerant will improve the reliability of circuits that are employed …

    oxford-brookes Repository record for Multiple bit error correcting architectures over finite fields (opens in a new tab) Download PDF for Multiple bit error correcting architectures over finite fields (opens in a new tab)

Page 1 of 14