Search Results - (( developing variable encryption algorithm ) OR ( java optimization path algorithm ))

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

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  2. 2

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

    Published 2025
    “…Core functionalities such as path planning, autonomous movement, voice feedback, and app-to-robot communication have been thoroughly tested and optimized. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5

    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
  6. 6

    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
  7. 7

    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
  8. 8

    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
  9. 9

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis