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 9 of 9 for “"Binary Field"”.

  1. Efficient Binary Field Multiplication on a VLIW DSP

    … proposed multiplication utilizes Multi-Precision Binary Polynomial Multiplication with Unbalanced Exponent Modular Reduction. The resulting DSP implementation performs a GF(2^233) multiplication in less than 1.31us, which is over a seven times speed up when compared with the ARM implementation on …

    vt Repository record for Efficient Binary Field Multiplication on a VLIW DSP (opens in a new tab)

  2. FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field

    … bases of both ECC and Tate pairing are Galois field arithmetic units. In this thesis, I propose the FPGA implementations of the elliptic curve point multiplication in GF (2283) as well as Tate pairing computation on supersingular elliptic curve in GF (2283). I have designed and synthesized the …

    unt Repository record for FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field (opens in a new tab)

  3. On Non-Binary Constellations for Channel Encoded Physical Layer Network Coding

    … their symbols, $S_A$ and $S_B$, from a small non-binary field, $\mathbb{F}$, and use non-binary PSK constellation mapper during the transmission phase. The relay then directly decodes the network-coded combination ${aS_A+bS_B}$ over $\mathbb{F}$ from the noisy superimposed channel-coded packets …

    waterloo Repository record for On Non-Binary Constellations for Channel Encoded Physical Layer Network Coding (opens in a new tab)

  4. Affine equivalence and constructions of cryptographically strong Boolean functions

    … relationship to circulant matrices over the binary field F2 and regular graphs. We first establish a relationship between generalized inverses of circulant matrices in F2 and their generating polynomials. We then apply the relationship to gain insight into necessary conditions for the affine …

    nps Repository record for Affine equivalence and constructions of cryptographically strong Boolean functions (opens in a new tab)

  5. Kvadratické polynomy nad binárními poli

    Tato bakalářská práce se zabývá kvadratickými polynomy nad binárními poli, které indukují bijekci. Stanovíme podmínky bijekce na konktrétním binárním poli s výhledem dalšího zkoumání polynomiálních automorfismů indukujících bijekci.

    brno-tech Repository record for Kvadratické polynomy nad binárními poli (opens in a new tab)

  6. Quantum Error Correction and Stabilizer Codes

    … tensor product operation between two non-binary parity-check matrices obtained from the idempotent polynomials of QR/NQR sets. Next, we study quantum synchronizable codes that correct both quantum noise and block synchronization errors. We propose a general construction of quantum …

    unsw Repository record for Quantum Error Correction and Stabilizer Codes (opens in a new tab)

  7. Elliptic Curve Cryptography on Heterogeneous Multicore Platform

    Elliptic curve cryptography (ECC) is becoming the algorithm of choice for digital signature generation and authentication in embedded context. However, performance of ECC and the underlying modular arithmetic on embedded processors remains a concern. At the same time, more complex system-on-chip …

    vt Repository record for Elliptic Curve Cryptography on Heterogeneous Multicore Platform (opens in a new tab)

  8. On Bilinear Techniques for Similarity Search and Boolean Matrix Multiplication

    … This thesis presents advancements in multiple fields of algorithms, related through the application of bilinear techniques. Functions that map elements from a pair of vector spaces to a third vector space with the property that they are linear in their arguments, or bilinear maps, are a …

    aalto Repository record for On Bilinear Techniques for Similarity Search and Boolean Matrix Multiplication (opens in a new tab)

  9. Codes over Rings, Their Generic Decoding and Their Use in Code-Based Cryptography

    … mostly studied as linear spaces over some finite field equipped with the Hamming metric. These codes have several practical properties, for example they can be efficiently stored and encoded. However, there have been a few classes of non-linear codes over the binary field with, in a sense, similar …

    zurich