Search Results - (( developing variable encryption algorithm ) OR ( java optimisation based algorithm ))

Search alternatives:

  • Showing 1 - 6 results of 6
Refine Results
  1. 1
    A hardware implementation of Rivest-Shamir-Adleman co-processor for resource constrained embedded systems

    A hardware implementation of Rivest-Shamir-Adleman co-processor for resource constrained embedded systems by Paniandi, Arul

    Published 2006
    “…This RSA co-processor core is able to encrypt and decrypt data with variable key lengths up to 4096 bits. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Web-based expert system for material selection of natural fiber- reinforced polymer composites

    Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

    Published 2015
    “…Finally, the developed expert system was deployed over the internet with central interactive interface from the server as a web-based application. As Java is platform independent and easy to be deployed in web based application and accessible through the World Wide Web (www), this expert system can be one stop application for materials selection.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    A framework of test case prioritisation in regression testing using particle swarm-artificial bee colony algorithm

    A framework of test case prioritisation in regression testing using particle swarm-artificial bee colony algorithm by Ba-Quttayyan, Bakr Salim Abdullah

    Published 2024
    “…The developed framework, grounded in fault-based testing theory, comprises three key components: inputs, prioritization factors, and a prioritization algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure

    Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure by Asbullah, Muhammad Asyraf

    Published 2015
    “…In this thesis, we also develop a new cryptographic hard problem based on a special instance of a linear Diophantine equation in two variables, with some provided restrictions and carefully selected parameters. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Improved scalar multiplication algorithm in affine coordinate system using elliptic net

    Improved scalar multiplication algorithm in affine coordinate system using elliptic net by Razali, Zuren, Muslim, Norliana, Kahar, Saliyah, Yunos, Faridah, Mohamed, Kamsiah

    Published 2022
    “…In the case of the 384-bits, results indicate that the developed scalar multiplication algorithm accelerates the running time by 65.96 % compared to the binary method, 44.81 % compared to the elliptic net without equivalent sequences, 30.28 % compared to the elliptic net with temporary variables, and 19.71 % compared to the seven blocks of the elliptic net with Karatsuba method. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Enhancing obfuscation technique for protecting source code against software reverse engineering

    Enhancing obfuscation technique for protecting source code against software reverse engineering by Mahfoudh, Asma

    Published 2019
    “…There is also a need to develop a tool that contains the three approaches where the developer can customize the protection of the source code.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: