Search Results - (( developing point rsa algorithm ) OR ( java implication based algorithm ))

  • Showing 1 - 5 results of 5
Refine Results
  1. 1

    Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields by Al-Saffar, Najlae Falah Hameed

    Published 2015
    “…Elliptic curve cryptosystem (ECC) is being used nowadays more than ever to fulfill the need for public key cryptosystem because of its ability to use shorter keys lengths and computationally more efficient algorithms than anther public key cryptosystems such as Rivest-Shamir- Adleman (RSA), Digital Signature Algorithm (DSA) and ElGamal. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Improved algorithms of elliptic curve point multiplication over binary and prime fields using elliptic net by Muslim, Norliana

    Published 2022
    “…For safe curves of 384 and 512 bits, the developed ENPM algorithm over prime field outperformed the BM algorithm in terms of overall multiplications with 57.60% and 59.16% average running time. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    Implementation of High Speed Large Integer Multiplication Algorithm on Contemporary Architecture by Chang, Boon Chiao

    Published 2018
    “…CPU implementations are becoming less efficient in handling the computation of crypto algorithms. Hence, other contemporary processor architectures such as GPU and FPGA have become popular alternative to speed up the computation in recent years.This dissertation first discusses several existing large integer multiplication algorithms and reviews different methods used to implement thediscussed algorithms done by other researchers in both Graphic Processing Unit (GPU) and Field Programmable Gate Array (FPGA).Compared to GPU, FPGA offered more low level design and development to the implementation. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5