Search Results - (( mobile optimization method algorithms ) OR ( based operational rsa algorithm ))

Refine Results
  1. 1

    New signed-digit {0,1,3}-NAF scalar multiplication algorithm for elliptic curve over binary field by Md Yasin, Sharifah

    Published 2011
    “…Efficiently managed point operations can give optimal number of point operations involved throughout the execution of the scalar multiplication algorithm and can reduced cost of the scalar multiplication.…”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

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

    Published 2006
    “…The designed RSA coprocessor core is actually a modular exponentiation hardware engine, which is the basic arithmetic operation in implementing a RSA public key encryption and decryption algorithm. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5
  6. 6

    Mobile robot path planning using hybrid genetic algorithm and traversability vectors method by Loo, C.K., Rajeswari, M., Wong, E.K., RaoTask, M.V.C.

    Published 2004
    “…Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…The environment design for mobile robots' path planning based on industry environment shows excellent combinations with the GA method that generate the optimal path for the mobile robot with a semi-dynamic obstacle.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    New Lightweight Identity Based Encryption Algorithm for Mobile Device: Preliminary Study by Norhidayah, Muhammad, Jasni, Mohamad Zain, Md Yazid, Mohd Saman

    Published 2012
    “…Elliptic curve method has shorter key size, smaller signature length, fast operations and high security working. Thus, it is suitable for mobile devices, it uses 160 bits key and provides the same security as RSA 1024 bits key.Some benefits are expected from this study to improve the encryption algorithm for mobile security.…”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Adaptive route optimization for mobile robot navigation using evolutionary algorithm by Kit Guan Lim, Guan Lim, Yoong Hean Lee, Hean Lee, Min Keng Tan, Keng Tan, Hou, Pin Yoong, Tienlei, Wang, Tze, Kenneth Kin Teo

    Published 2021
    “…For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  10. 10
  11. 11
  12. 12

    Optimization of ANPR algorithm on android mobile phone by Mutholib, Abdul, Gunawan, Teddy Surya, Chebil, Jalel, Kartiwi, Mira

    Published 2013
    “…In this paper, the optimization of ANPR algorithm on limited hardware of Android mobile phone is presented. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  13. 13

    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

    Published 2025
    “…The results reveal that our proposed method reduces the mobile robot's travel time by up to 69%, 67%, 72%, and 79% compared to these algorithms, while consistently achieving optimal path lengths. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    An analysis of the AAḃ asymmetric encryption scheme on embedded devices for IoT environment / Syed Farid Syed Adnan by Syed Adnan, Syed Farid

    Published 2019
    “…It is also not known how the algorithm would perform against the widely used RSA on resource-constrained platforms. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Optimized performance data transmission in Mobile IP networks by Gholizadeh, Somayyeh, Abdullah, Azizol, Othman, Mohamed, Mohd Hanapi, Zurina, Heydarian, Mohsen

    Published 2014
    “…Our new method determines an optimal domain for each mobile node and does not allow nodes to exit from that optimal domain. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Quality of service in mobile IP networks with parametric multi-channel routing algorithms based on linear programming approach by Gholizadeh, Somayyeh

    Published 2018
    “…Furthermore, Optimized Parametric Topology Control Routing algorithm performs significantly better than Triangular Routing Method and Change Foreign Agent Algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

    A review on autonomous mobile robot path planning algorithms by Noraziah, Adzhar, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2020
    “…The emerging trend of modern industry automation requires intelligence to be embedded into mobile robot for ensuring optimal or near-optimal solutions to execute certain task. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Performance analysis and improvement of rabin primitive based cryptosystems by Mahad, Zahari

    Published 2014
    “…The encryption process for the AAβ cryptosystem is easy and fast as operations involved only add and multiply operations. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    An improved public key cryptography based on the elliptic curve by Al-Daoud, Essam Faleh

    Published 2002
    “…Moreover, the new formula can be used more efficiently when it is combined with the suggested sparse elements algorithms. To speed up the underlying finite field operations, several new algorithms are introduced namely: selecting random sparse elements algorithm, finding sparse base points, sparse multiplication over polynomial basis, and sparse multiplication over normal basis. …”
    Get full text
    Get full text
    Thesis