Search Results - (( problem using ((rsa algorithm) OR (graph algorithm)) ) OR ( java application using algorithm ))

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
Get full text
Get full text
Get full text

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text

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

“…Digital Signature was encrypted by RSA Algorithm, a very powerful asymmetrical encryption. …”
Get full text
Get full text

Parallel Processing of RSAAlgorithm Using MPI Library by Wan Dagang, Wan Rahaya

“…The scope of this project is developing a parallel system to generate public and private key, and to encrypt and decrypt files using the algorithm of RSA. The system is needed to be parallel as to overcome the problem of intensive computational by the RSA algorithm. …”
Get full text
Get full text

Modified multi-prime RSA using discriminant of a quadratic and Chinese remainder theorem / Nur Fatimah Kabulanto and Farah Aina Abdul Razak by Kabulanto, Nur Fatimah, Abdul Razak, Farah Aina

“…Therefore, in this study we introduce a modified RSA Cryptosystem using a hybrid of discriminant quadratic and Chinese Remainder Theorem. …”
Get full text
Get full text

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

“…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

Introducing S-index into factoring RSA modulus via Lucas sequences by Abu, Nur Azman, Salim, Fadzilah, Kamel Ariffin, Muhammad Rezal

“…The S-index pattern is very useful in designing an algorithm to factor RSA modulo. …”
Get full text
Get full text
Get full text

A comparative S-index in factoring RSA modulus via Lucas sequences by Abu, Nur Azman, Abdul Latip, Shekh Faisal, Kamel Ariffin, Muhammad Rezal

“…The S-index pattern is very useful in designing an algorithm to factor RSA modulo. …”
Get full text
Get full text

New directions in factoring the prime power RSA modulus N = prq by Shehu, Sadiq, Kamel Ariffin, Muhammad Rezal

“…Using the continued fraction algorithm, we show that such exponents yield the factorization of the RSA Prime Power modulus in polynomial time. …”
Get full text
Get full text

Implementation and Evaluation of Large Rsa Encryption and Decryption Keys For Internet Security by H. Belgassem, Seddeq

“…Performance has always been the most critical characteristic of a cryptographic algorithm, which determines its effectiveness. In this research the most popular and used algorithm, which is RSA, is implemented with a new modification in order to reduce the calculation time of the algorithm. …”
Get full text
Get full text

Implementing Station-to-Station protocol using Multi Prime RSA Cryptosystem / Muhammad Arif Musa Abdullah by Abdullah, Muhammad Arif Musa

“…The study recommends to use another type of digital signature algorithm to be used in the proposed method. …”
Get full text
Get full text

Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

Get full text
Get full text

Comparison between RSA hardware and software implementation for WSNs sexcurity schemes by Md. Tap, Abu Osman, Manttoro, Teddy, Alkalbani, Abdullah Said

“…In this study we compare the time complexity and power consumption between software and hardware implementation using RSA algorithm. Our simulation shows that usage of hardware security could improve time efficiency and decrease the power consumption, so the strong cryptography can be implemented in WSNs security.…”
Get full text
Get full text

Proposed system for data security in distributed computing in using triple data encryption standard and Rivest Shamir Adlemen by Shawkat S.A., Tuama B.A., Al-Barazanchi I.

“…The main drawback of the 3kRSA algorithm is its computation time, while 3DES is faster than that 3kRSA. …”

Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

“…Many challenging problems in Very Large-Scale Integration (VLSI) physical design automation are modeled using graphs. …”
Get full text
Get full text
Get full text

Graph algorithm vertex coloring by Suyudi, M., Sukono, ., Mustafa, Mamat, Bon, A.T.

“…Graph coloring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems.…”
Get full text
Get full text

A comparative review on symmetric and asymmetric dna-based cryptography by Hammad B.T., Sagheer A.M., Ahmed I.T., Jamil N.

“…Asymmetric cryptography was considered in the second case by incorporating the DNA codes in RSA algorithm. The efficiencies of DNA coding in OTP, RSA, and other algorithms were given. …”

On some packing and partition problems in geometric graphs by Trao, Hazim Michman

“…Graph packing problem refers to the problem of finding maximum number of edge-disjoint copies of a fixed subgraph in a given graph G. …”
Get full text
Get full text

Hybrid cryptography algorithm to improve security cloud storage by Abd Almohsen, Inam Razzaq

“…To improve secure of data in cloud storage by hybrid three algorithms (AES, ECC and RSA).All the existing algorithms has some sort of problems and issues, this had made us decide to develop a safe, correct ad efficient algorithm for having secured data in cloud storage. …”
Get full text
Get full text
Get full text