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 1 of 1 for “"digit-level finite field multiplication"”.

  1. High Speed and Low-Complexity Hardware Architectures for Elliptic Curve-Based Crypto-Processors

    … efficient and low-complexity architectures for finite field multiplications over Gaussian normal basis (GNB). We propose three new low-complexity digit-level architectures for finite field multiplication. Architectures are modified in order to make them more suitable for hardware implementations …

    uwo Repository record for High Speed and Low-Complexity Hardware Architectures for Elliptic Curve-Based Crypto-Processors (opens in a new tab)