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 25 for “"Galois fields"”.

  1. Efficient computations in Galois fields

    … division and multiplication over finite or Galois fields are presented. The structures are regular, which is important for hardware realization, particularly for large finite fields. The concept of supporting elements is introduced which leads to efficient algorithms for computing divisions …

    uvic Repository record for Efficient computations in Galois fields (opens in a new tab)

  2. Primitive free elements of Galois fields

    The key result linking the additive and multiplicative 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 …

    glasgow Download PDF for Primitive free elements of Galois fields (opens in a new tab)

  3. A study of polynomial residue number systems over binary Galois fields GF(2m) for cryptography

    This thesis is concerned with GF(2m) Polynomial Residue Number Systems (PRNS) and their application in cryptography to provide resistance against side-channel- analysis and protection against fault attacks. PRNS operations over GF(2m) required in a number of cryptography primitives are …

    whiterose Download PDF for A study of polynomial residue number systems over binary Galois fields GF(2m) for cryptography (opens in a new tab)

  4. Progressive product reduction for polynomial basis multiplication over GF(3m)

    Galois fields are essential blocks of building many of cryptographic schemes. The main advantage of applying Galois fields over cryptographic applications are to reduce cost and increase the sufficiency of the performance. In past, they were interested in implement Galois field of characteristic 2 …

    uvic Repository record for Progressive product reduction for polynomial basis multiplication over GF(3m) (opens in a new tab)

  5. A Study of Modifications to Quantum Mechanics

    … the space of states used are vector spaces over Galois fields instead of complex Hilbert spaces. The particular deformation of the canonical commutation relations used leads to a minimum value of the uncertainty in position which is interpreted as a minimum length scale. Both harmonic and …

    vt Repository record for A Study of Modifications to Quantum Mechanics (opens in a new tab)

  6. ΜΕΛΕΤΗ ΤΗΣ ΥΠΟΛΟΓΙΣΤΙΚΗΣ ΠΟΛΥΠΛΟΚΟΤΗΤΑΣ ΑΛΓΟΡΙΘΜΩΝ ΤΗΣ ΨΗΦΙΑΚΗΣ ΕΠΕΞΕΡΓΑΣΙΑΣ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΗΜΑΤΩΝ

    … DEVELOPED. NEW ALGORITHMS FOR CONVOLUTIONS OVER GALOIS FIELDS ARE PRESENTED. FINALLY THE ERROR ANALYSIS IN FLOATING POINT ARITHMETIC OF THE RECTANGULAR TRANSFORM AND THE MULTIDIMENSIONAL DFTS IS PRESENTED.

    greece Repository record for ΜΕΛΕΤΗ ΤΗΣ ΥΠΟΛΟΓΙΣΤΙΚΗΣ ΠΟΛΥΠΛΟΚΟΤΗΤΑΣ ΑΛΓΟΡΙΘΜΩΝ ΤΗΣ ΨΗΦΙΑΚΗΣ ΕΠΕΞΕΡΓΑΣΙΑΣ ΠΟΛΥΔΙΑΣΤΑΤΩΝ ΣΗΜΑΤΩΝ (opens in a new tab)

  7. Parallel multipliers for modular arithmetic

    … high-speed multipliers for prime and extension Galois fields are presented in this work. A tool is developed that automatically generates Hardware Description Language (HDL) code for the various designs. Simulation is used to evaluate the area and delay complexities of all the designs.

    texas Repository record for Parallel multipliers for modular arithmetic (opens in a new tab)

  8. The use of the big encryption system (BES) for the cryptanalysis of the advanced encryption system (AES)

    … the operations of AES are based on two different Galois Fields, GF(2) and GF(28), this brings a lot of difficulties and complexities to the cryptanalysis of AES. Therefore, BES, which stands for Big Encryption System, is introduced. By enlarging the message space and key space, BES can replicate …

    concordia Download PDF for The use of the big encryption system (BES) for the cryptanalysis of the advanced encryption system (AES) (opens in a new tab)

  9. Reconfigurable co-design of a computationally intensive mathematical problem

    … the listing of irreducible polynomials over Galois fields of order 3 (GF(3)). The main goal is to accelerate the performance compared to an existing software implementation. This project uses hardware/software Co-design methodologies and techniques, and it is designed, implemented and …

    uvic Repository record for Reconfigurable co-design of a computationally intensive mathematical problem (opens in a new tab)

  10. Reconfigurable and compact modular polynomial multiplier in Galois field for the security of IoT

    … and compact modular polynomial multipliers over Galois Fields (GF), specifically tailored for the security demands of IoT devices. Leveraging polynomial basis arithmetic in GF(2m), the proposed designs emphasize hardware efficiency, adaptability, and cryptographic robustness for Elliptic Curve …

    lethbridge Repository record for Reconfigurable and compact modular polynomial multiplier in Galois field for the security of IoT (opens in a new tab)

  11. Number Fields with Large Minimal Index

    … proves results of the form m(K) << |DK|U for all Galois quartic fields and composites of totally real Galois fields with imaginary quadratic fields, and of the form m( K) >> |DK|L for infinitely many pure cubic fields, both types of Galois quartic fields, and the same composite fields, with U and …

    toronto-retro Repository record for Number Fields with Large Minimal Index (opens in a new tab)

  12. On the application of combination strategies to testing finite state machines.

    … from group and field theory, specifically Galois fields leading to the development of orthogonal Latin squares, in addition to combinatorial methods, provide strong tools for testing finite state machines. The results of an empirical experiment comparing the different strategies in testing …

    umn Repository record for On the application of combination strategies to testing finite state machines. (opens in a new tab)

  13. Coding performance on satellite channels using AX.25 protocol

    … Golay code, Reed-Solomon, RS , codes over the Galois fields of 16, GF(16), and 256, GF(256), elements, and common rate convolutional codes of various constraint lengths. The codes are evaluated on three primary criteria, which include: throughput vs. input bit error rate, coding complexity, and …

    vt Repository record for Coding performance on satellite channels using AX.25 protocol (opens in a new tab)

  14. Generalized low-density parity-check codes

    … designed for GLDPC codes defined over non-binary Galois fields using RS constituent codes. Seven vote rules were proposed and the suggested optimal voting rule was deemed to be E = 3, V = 0, and e = F = 1.5 where larger values indicates unreliable symbols and smaller values indicates more reliable …

    soton Download PDF for Generalized low-density parity-check codes (opens in a new tab)

  15. Pascal polynomials over GF(2)

    … 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 known as Galois fields, the DLP can be viewed as finding a solution to …

    nps Repository record for Pascal polynomials over GF(2) (opens in a new tab)

  16. RESOURCE EFFICIENT DESIGN OF QUANTUM CIRCUITS FOR CRYPTANALYSIS AND SCIENTIFIC COMPUTING APPLICATIONS

    … abilities to tackle computational problems in fields such as number theory, encryption, search and scientific computation. Up to a superpolynomial speedup has been reported for quantum algorithms in these areas. Motivated by the promise of faster computations, the development of quantum …

    uky-thes Repository record for RESOURCE EFFICIENT DESIGN OF QUANTUM CIRCUITS FOR CRYPTANALYSIS AND SCIENTIFIC COMPUTING APPLICATIONS (opens in a new tab)

  17. Versatile architectures for cryptographic systems

    … proposed algorithms and architectures operate on Galois Fields GF of the form GF(p) for integers and GF(2n) for polynomials. Alternative number representation systems such as Residue Number System (RNS) for integers and Polynomial Residue Number System (PRNS) for polynomials are employed. The …

    greece Repository record for Versatile architectures for cryptographic systems (opens in a new tab)

  18. Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2<sup>m</sup>)

    … multiplicative inversion or field division over Galois fields <i>GF</i>(2<i><sup>m</sup></i>) in the specific case of cryptographic applications where field dimension <i>m</i> may be very large (greater than 400) and either <i>m</i> or defining irreducible polynomial may vary. For this purpose, …

    waterloo Repository record for Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2<sup>m</sup>) (opens in a new tab)

  19. On the construction of balanced and partially balanced factorial experiments

    … oy the familiar methods, using the. theory of Galois fields. Although these methods can be extended to asymmetrical factorial experiments· (White and Hultquist, 1965; Raktoe, 1969) the actual construction of designs becomes much mor:e complicated for the general case and does not always lead to …

    vt Repository record for On the construction of balanced and partially balanced factorial experiments (opens in a new tab)

  20. VLSI algorithms and architectures for non-binary-LDPC decoding

    … inability to implement decoders over high-order Galois fields due to the high decoder complexity), it was selected as starting point for this thesis due to its capability to reach high-throughput. Taking into account the identified limitations of the T-EMS algorithm, the second part of the thesis …

    upv Repository record for VLSI algorithms and architectures for non-binary-LDPC decoding (opens in a new tab)

Page 1 of 2