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 3 of 3 for “"Montgomery reduction"”.

  1. Issues in Implementation of Public Key Cryptosystems

    … and 2) coefficient reduction. We present an efficient coefficient reduction algorithm based on a division algorithm derived from the Barrett reduction algorithm. We also show a coefficient reduction algorithm based on the Montgomery reduction algorithm. We give …

    waterloo Repository record for Issues in Implementation of Public Key Cryptosystems (opens in a new tab)

  2. Implementace modulární aritmetiky do obvodů FPGA a ASIC

    … pre operácie v modulárnej aritmetike s využitím Montgomeryho redukcie a porovnať výsledky implementácie s klasickými algoritmami.

    brno-tech Repository record for Implementace modulární aritmetiky do obvodů FPGA a ASIC (opens in a new tab)

  3. High-Speed Elliptic Curve and Pairing-Based Cryptography

    … the corresponding density formulas. • Incomplete reduction and branchless arithmetic techniques are optimally combined for devising high-performance field arithmetic. Efficient algorithms for “small” modular operations using suitably chosen pseudo-Mersenne primes are carefully analyzed and …

    waterloo Repository record for High-Speed Elliptic Curve and Pairing-Based Cryptography (opens in a new tab)