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 15 of 15 for “"Point Multiplication"”.

  1. Single-Precision and Double-Precision Merged Floating-Point Multiplication and Addition Units on FPGA

    Floating-point (FP) operations defined in IEEE 754-2008 Standard for Floating-Point Arithmetic can provide wider dynamic range and higher precision than fixed-point operations. Many scientific computations and multimedia applications adopt FP operations. Among all the FP operations, addition and …

    sask Repository record for Single-Precision and Double-Precision Merged Floating-Point Multiplication and Addition Units on FPGA (opens in a new tab)

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

    … elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. Similarly, Tate pairing is also quite computationally expensive. Therefore, it is more attractive to implement the ECC and Tate pairing using hardware than using software. The …

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

  3. A Novel and Efficient Design of Fully Reversible Single and Double Precision Floating Point Hardware Based on IEEE 754 Standard

    … most recently - Optical Computation. Floating point multiplication is a crucial operation in high power computing applications. However, multiplication requires more time and more power to work than the other operations. The paper proposes a novel, efficient reversible design method of IEEE754 …

    unt Repository record for A Novel and Efficient Design of Fully Reversible Single and Double Precision Floating Point Hardware Based on IEEE 754 Standard (opens in a new tab)

  4. Low-Resource and Fast Elliptic Curve Implementations over Binary Edwards Curves

    … art binary Edwards curve equations over mixed point addition and doubling. The binary Edwards curve offers the security advantage that it is complete and is, therefore, immune to the exceptional points attack. In conjunction with Montgomery ladder, such a curve is naturally immune to most types …

    rit Repository record for Low-Resource and Fast Elliptic Curve Implementations over Binary Edwards Curves (opens in a new tab)

  5. GPU-based Parallel Computing Models and Implementations for Two-party Privacy-preserving Protocols

    … (SW) problems. PSI is chosen to represent ECC point multiplication related computations, SH for bilinear pairing, and the last two for SFE-based dynamic programming (DP) problems. They represent different types of computations, so that in-depth understanding of the benefits and limitations of …

    tamu Repository record for GPU-based Parallel Computing Models and Implementations for Two-party Privacy-preserving Protocols (opens in a new tab)

  6. Floating-point fused multiply-add architectures

    … of several new architectures for floating-point fused multiplier-adders used in the x87 units of microprocessors. These new architectures have been designed to provide solutions to the implementation problems found in modern-day fused multiply-add units. The new three-path fused …

    texas Repository record for Floating-point fused multiply-add architectures (opens in a new tab)

  7. Elliptic Curve Cryptography on Heterogeneous Multicore Platform

    … to improve the performance and efficiency of ECC point multiplication on the target platform. We examine multiple aspects of ECC and heterogeneous design such as algorithm-level choices for elliptic curve operations and the effect of interprocessor communication overhead on the design …

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

  8. DESIGN AND IMPLEMENTATION OF AN EFFICIENT IMAGE COMPRESSOR FOR WIRELESS CAPSULE ENDOSCOPY

    … The conventional DCT requires complex floating point multiplication, which is not feasible for wireless capsule endoscopy (WCE) application because of its high implementation cost. So, an integer version of the DCT, known as iDCT, is used in this work. Several low complexity iDCTs along with …

    sask Repository record for DESIGN AND IMPLEMENTATION OF AN EFFICIENT IMAGE COMPRESSOR FOR WIRELESS CAPSULE ENDOSCOPY (opens in a new tab)

  9. A high performance pseudo-multi-core elliptic curve cryptographic processor over GF(2^163)

    … parallelized algorithm for elliptic curve point multiplication (PM) can be well suited on this platform. Instructions for combined FF operation are proposed to decrease clock cycles in the instruction set. The interconnection among three FF cores and the main controller is obtained by …

    sask Repository record for A high performance pseudo-multi-core elliptic curve cryptographic processor over GF(2^163) (opens in a new tab)

  10. Hardware Implementations of Scalable and Unified Elliptic Curve Cryptosystem Processors

    … operation in ECC schemes is the elliptic curve point multiplication (ECPM). This thesis explores the implementation of hardware accelerators that offload the ECPM operation to hardware. These processors are referred to as ECC processors, or simply ECPs. This thesis targets the efficient hardware …

    sask Repository record for Hardware Implementations of Scalable and Unified Elliptic Curve Cryptosystem Processors (opens in a new tab)

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

    … uses affine coordinates to compute scalar point multiplication which results in having a very small control unit and negligible with respect to the datapath for all practical values of <i>m</i>. The throughput of this EC based on this bit serial systolic architecture is comparable with …

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

  12. Efficient hardware architecture for scalar multiplications on elliptic curves over prime field

    … strategies to perform elliptic curve scalar multiplication, the fundamental operation in all ECC based crypto-systems. Finite field arithmetic is the bottleneck in the computation of the EC scalar multiplication operation. Especially, finite field multiplication is the most time-critical …

    dcu Download PDF for Efficient hardware architecture for scalar multiplications on elliptic curves over prime field (opens in a new tab)

  13. Optimized Floating-Point Arithmetic for Efficient Operations in DNN Accelerators

    … through novel approaches to optimising floating-point (FP) arithmetic. While previous work has largely addressed the efficiency of inference, this thesis targets the underexplored domain of training, aiming to reduce computational costs and energy consumption for sustainable AI development. The …

    unsw Repository record for Optimized Floating-Point Arithmetic for Efficient Operations in DNN Accelerators (opens in a new tab)

  14. Návrh aproximativních násobiček s plovoucí řádovou čárkou

    Tato práce je zaměřena na návrh, klasifikaci a implementaci aproximativních násobiček. Výstupem je sada nově navržených aproximativních násobiček pro plovoucí řádovou čárku s možností variabilní šířky operandů. Návrh a vlastnosti těchto násobiček jsou v práci podrobně analyzovány.

    brno-tech Repository record for Návrh aproximativních násobiček s plovoucí řádovou čárkou (opens in a new tab)

  15. Návrh aproximativních násobiček s plovoucí řádovou čárkou

    Tato práce je zaměřena na návrh, klasifikaci a implementaci aproximativních násobiček. Výstupem je sada nově navržených aproximativních násobiček pro plovoucí řádovou čárku s možností variabilní šířky operandů. Návrh a vlastnosti těchto násobiček jsou v práci podrobně analyzovány.

    brno-tech Repository record for Návrh aproximativních násobiček s plovoucí řádovou čárkou (opens in a new tab)