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 319 for “"finite field"”.
-
The finite field restriction problem
… studies the extension problem for subsets of finite fields. This remains an important unsolved problem in harmonic analysis, in both the Euclidean and finite field setting. We survey the partial results obtained to date, common techniques, and open conjectures. In the case of a homogeneous …
-
Hardware Obfuscation for Finite Field Algorithms
… obfuscation design through reconfigurable finite field arithmetic units, which can be employed in various error correction and cryptographic algorithms. The effectiveness and efficiency of the proposed methods are verified by an obfuscated Reformulated Inversion-less Berlekamp-Massey (RiBM) …
-
Finite Field Multiplier Architectures for Cryptographic Applications
… curve cryptosystems which use the arithmetic of finite fields. Furthermore, fields of characteristic two are preferred since they provide carry-free arithmetic and at the same time a simple way to represent field elements on current processor architectures. Multiplication is a very crucial …
-
Efficient finite field arithmetic with cryptographic applications
Finite field multiplication is one of the most useful arithmetic operations and has applications in many areas such as signal processing, coding theory and cryptography. However, it is also one of the most time consuming operations in both software and hardware, which makes it pertinent to develop …
-
Computation in a finite field using rational operands
… is presented for using residue arithmetic in a finite field for doing error-free computation when the operands are rational numbers.</p> <p>Rational operands are mapped onto integers in the finite field (I<sub>p</sub>, +, •). Multiple-precision integer computation is performed in that field. An …
-
Concurrent Error Detection in Finite Field Arithmetic Operations
… and digital signal processors usually contain finite field operations. Therefore, error detection and correction of such operations have become an important issue recently. In most of the work reported so far, error detection and correction are applied using redundancies in space (hardware), …
-
Finite Field Extensions of the p-adic Numbers
… so-called p-adic absolute value, we get a new field, Qp. In this paper, we demonstrate a method for finding finite field extensions of Qp by determining all extensions of Qp of degree five in the case p = 5.
-
Polynomial Isomorphisms of Cayley Objects Over a Finite Field
In this dissertation the Bays-Lambossy theorem is generalized to GF(pn). The Bays-Lambossy theorem states that if two Cayley objects each based on GF(p) are isomorphic then they are isomorphic by a multiplier map. We use this characterization to show that under certain conditions two isomorphic …
-
Solving multi-variate polynomial equations in a finite field
… research, as these polynomials are used in many fields of science. The objective of this research is to advance the development of algebraic methods to attack the mathematical foundations of modern-day encryption methods, which can be modeled as a system of multivariate polynomial equations over …
-
Accurate Calculations of Nonlinear Optical Properties Using Finite Field Methods
… the NLO properties of molecules using the finite field (FF) approach. The first chapter provides a background for the finite field and electronic structure methods used in this dissertation. Chapter two is a thorough investigation of the finite field method. The limitations of the method …
-
Scalar polynomial functions on the nxn matrices over a finite field
<p>Let f(x) ε F[x] where F is a field. Then f(x) defines via substitution a function from the set of n x n matrices, F<sub>n×n</sub>, to itself. Any function from F<sub>n×n</sub> to F<sub>n×n</sub> which can be represented by a polynomial in F[x] is called a scalar …
-
Quiver of Affine Monoid of a Vector Space Over Finite Field
… algebra has radical square zero. Hence, it has finite representation type.
-
Finite Field Models of Roth's Theorem in One and Two Dimensions
… usefulness of first studying the problem in a finite field environment. Using the techniques of Bourgain to give a result in other settings such as general abelian groups, the author gives a walk through, including proof, of Roth's theorem in both the one dimensional and two dimensional cases …
-
On the Use of Finite Field Based Modeling in Polynomial Manipulation
Made available in DSpace on 2014-12-08T22:24:29Z (GMT). No. of bitstreams: 1 6901402.pdf: 3093978 bytes, checksum: 030e2670fc45221c81dd5839e7f50313 (MD5) Previous issue date: 1968
-
The Galois Group of a Polynomial Equation with Coefficients in a Finite Field
… of a polynomial equation with coefficients in a finite field. The problem of finding the Galois group of an arbitrary equation, where the coefficient field is either finite or infinite, is neither new nor unsolved.</p>
-
Rational Functions of Degree Five That Permute the Projective Line Over a Finite Field
Rational functions over a finite field Fq induce mappings from the projective line P1(Fq) to itself. Rational functions that permute the projective line are called permutation rational functions (PRs). The notion of permutation rational functions is a natural extension of the permutation …
-
Evaluation of Certain Exponential Sums of Quadratic Functions over a Finite Field of Odd Characteristic
… S(f, n) equal to the sum_(x as x runs over the finite field with (p to the n elements) of zeta_(p to the power of Tr_n (f(x))), where zeta_p equals e to the power of (2i times pi divided by p) and Tr_n is the trace from the finite field with p to the n elements to the finite field with p …
-
Automated Design Space Exploration and Datapath Synthesis for Finite Field Arithmetic with Applications to Lightweight Cryptography
… and sufficient cryptographic strength. Finite fields are widely used in cryptography. Examples of algorithm design choices related to finite field arithmetic are the field size, which arithmetic operations to use, how to represent the field elements, etc. As there are many parameters to …
Page 1 of 16