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 6 of 6 for “"extended Euclidean algorithm"”.

  1. Topics on Register Synthesis Problems

    … sequence, it is undesirable to have an efficient algorithm that can synthesize a generator which can predict the whole sequence. Otherwise, a cryptanalytic attack can be launched against the system based on that given sequence. Linear feedback shift registers (LFSRs) are the most widely studied …

    uky-thes Repository record for Topics on Register Synthesis Problems (opens in a new tab)

  2. Computing a Basis for an Integer Lattice

    The extended gcd problem takes as input two integers, and asks as output an integer linear combination of the integers that are equal to their gcd. The classical extended Euclidean algorithm and fast variants such as the half-gcd algorithm give efficient algorithmic solutions. In this thesis, we …

    waterloo Repository record for Computing a Basis for an Integer Lattice (opens in a new tab)

  3. Systolic design space exploration of EEA-based inversion over binary and ternary fields

    … field operation in ECC. The two predominant algorithms for computing finite field inversion are Fermat’s Little Theorem (FLT) and Extended Euclidean Algorithm (EEA). EEA is reported to be the most efficient inversion algorithm in terms of performance and power consumption. This dissertation …

    uvic Repository record for Systolic design space exploration of EEA-based inversion over binary and ternary fields (opens in a new tab)

  4. Evaluating Performance and Efficiency of a 16-bit Substitution Box on an FPGA

    … is a sponge based Authenticated Encryption (AE) algorithm which provides both authenticity and confidentiality. It was developed through a joint effort between the Rochester Institute of Technology and the former Harris Corporation, now L3Harris. The MK-3 algorithm has a state that is 512 bits …

    rit Repository record for Evaluating Performance and Efficiency of a 16-bit Substitution Box on an FPGA (opens in a new tab)

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

    … eliminating global data interconnects. Recursive algorithms with regular data flows are suitable for systolization. The computation of multiplicative inversion using algorithms based on EEA (Extended Euclidean Algorithm) are particularly suitable for systolization. Implementations based on EEA …

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

  6. Zabezpečení přenosu dat Reedovými-Solomonovými kódy

    Tato bakalářská práce se zabývá zabezpečením přenosu dat Reedovými-Solomonovými kódy. Rozebírá konstrukci kódu, způsob kódování a především prostředky dekódování. Postupně popisuje jednotlivé fáze dekódování: výpočet syndromového vektoru, nalezení lokalizačního polynomu chyb, určení pozic chybných …

    brno-tech Repository record for Zabezpečení přenosu dat Reedovými-Solomonovými kódy (opens in a new tab)