Search Results - (( java implementation rsa algorithm ) OR ( re optimization path algorithm ))

Search alternatives:

  • Showing 1 - 20 results of 20
Refine Results
  1. 1
    RSA Encryption & Decryption using JAVA

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  2. 2
    AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING

    AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING by SALLEH AL-HUMAIKANI, MOHAMMED ABDULQAWI

    Published 2021
    “…RSA is one of these encryption algorithms that have been implemented in security systems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    An improved RSA cryptosystem based on thread and CRT / Saheed Yakub Kayode and Gbolagade Kazeem Alagbe

    An improved RSA cryptosystem based on thread and CRT / Saheed Yakub Kayode and Gbolagade Kazeem Alagbe by Yakub Kayode, Saheed, Kazeem Alagbe, Gbolagade

    Published 2017
    “…Java programming language is used to implement the algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Secure Image Steganography Using Encryption Algorithm

    Secure Image Steganography Using Encryption Algorithm by Siti Dhalila, Mohd Satar, Roslinda, Muda, Fatimah, Ghazali, Mustafa, Mamat, Nazirah, Abd Hamid, An, P.K

    Published 2016
    “…A system based on the proposed algorithm will be implemented using Java and it will be more secured due to double-layer of security mechanisms which are RSA and Diffie-Hellman.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    State-Aware re-configuration model for multi-radio wireless Mesh Networks

    State-Aware re-configuration model for multi-radio wireless Mesh Networks by Zakaria, Omar, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Khalifa, Othman Omran, Azram, Mohammad, Goudarzi, Shidrokh, Jivanadham, Lalitha Bhavani, Zareei, Mahdi

    Published 2017
    “…In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients’ traffic due to the re-configuration process. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Digitally signed electronic certificate for workshop / Azinuddin Baharum

    Digitally signed electronic certificate for workshop / Azinuddin Baharum by Baharum, Azinuddin

    Published 2017
    “…Digital Signature was encrypted by RSA Algorithm, a very powerful asymmetrical encryption. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Intelligent motion planning of a mobile robot by using convolutional neural network / Siti Asmah Abdullah

    Intelligent motion planning of a mobile robot by using convolutional neural network / Siti Asmah Abdullah by Siti Asmah, Abdullah

    Published 2019
    “…It trains by using labelled data which comes by eight different folders represent the eight different movements; up, up-right, right, right-down, down-left, left, and left-up. By the path reference created by A* algorithm the robot is capable in optimizing its path to reach the designated destination. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…The main objectives of this project is to design the DNA sequence generator module using the Eulerian Path algorithm. This project is designed based on speed optimization. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  9. 9
    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…The objective of this project is to design the DNA sequence generator modules using the Eulerian Path Algorithm. This project is designed based on speed optimization. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Energy-Aware Routing Hole Detection Algorithm in the Hierarchical Wireless Sensor Network

    Energy-Aware Routing Hole Detection Algorithm in the Hierarchical Wireless Sensor Network by Najm Us, Sama, Kartinah, Zen, Atiq Ur, Rahman, Aziz Ud, Din

    Published 2019
    “…In this paper a novel energy efficient routing hole detection (EEHD) algorithm is presented, on the detection of routing hole, the periodic re-clustering is performed to avoid the long detour path. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Traffic management algorithms for LEO satellite networks

    Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

    Published 2016
    “…In dealing with traffic routing problem, two algorithms, Dijkstra's Shortest Path and Genetic Algorithm (GA) are combined together and enhanced to re-strategize a better routing mechanism for a heterogeneous mix of traffic classes ranging from traditional voice calls to multimedia data services in Low Earth Orbit (LEO) satellite networks. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Ant-based vehicle congestion avoidance framework using vehicular networks / Mohammad Reza Jabbarpour Sattari

    Ant-based vehicle congestion avoidance framework using vehicular networks / Mohammad Reza Jabbarpour Sattari by Sattari, Mohammad Reza Jabbarpour

    Published 2015
    “…Previous researches concentrated on using static algorithms to find the shortest path in VTRSs. However, providing a shortest path without considering other factors such as congestion, accidents, obstacles, travel time and speed is not a proper solution for vehicle traffic congestion problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Enhancing Autonomous Guided Vehicles with Red-Black TOR Iterative Method

    Enhancing Autonomous Guided Vehicles with Red-Black TOR Iterative Method by A’Qilah Ahmad Dahalan, Azali Saudi, Jumat Sulaiman

    Published 2023
    “…By carefully choosing the optimal parameter values, the suggested B-MTOR improved the computational execution of the algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Optimizing mobile robot navigation through neuro-symbolic fusion of Deep Deterministic Policy Gradient (DDPG) and fuzzy logic

    Optimizing mobile robot navigation through neuro-symbolic fusion of Deep Deterministic Policy Gradient (DDPG) and fuzzy logic by Nasary, Muhammad Faqiihuddin, Mohd Ibrahim, Azhar, Al Mahmud, Suaib, Shafie, Amir Akramin, Mardzuki, Muhammad Imran

    Published 2024
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  19. 19
    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra’s algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

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

    Published 2019
    “…It involves the process of re-testing software after modifications. Ideally, to perform regression testing is to re-execute all the test cases on the modified software. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: