Search Results - (( java simulation optimization algorithm ) OR ( _ solving rsa algorithm ))

Refine Results
  1. 1

    Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis by Wan Mohd Ruzai, Wan Nur Aqlili, Nitaj, Abderrahmane, Kamel Ariffin, Muhammad Rezal, Mahad, Zahari, Asbullah, Muhammad Asyraf

    Published 2022
    “…That is, the unknown [Formula presented] can be found amongst the convergents of [Formula presented] via continued fractions algorithm. Consequently, Coppersmith's theorem is applied to solve for prime factors p and q in polynomial time. …”
    Get full text
    Get full text
    Article
  2. 2

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

    Published 2017
    “…The S-index pattern is very useful in designing an algorithm to factor RSA modulo. The S-index will add another comparative tool to better manoeuvre in a factoring process. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

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

    Published 2016
    “…The S-index pattern is very useful in designing an algorithm to factor RSA modulo. At any instance in the factoring algorithm, the accumulative result stands independently. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    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

    Published 2018
    “…The securities of these models are based on the difficulties of solving multiple hard problems simultaneously. The newly algorithm will not only increase the security of system but also has high correct ability. …”
    Get full text
    Get full text
    Student Project
  5. 5

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

    Published 2010
    “…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
    Proceeding Paper
  6. 6

    Extending Pollard class of factorable RSA modulus by Abd Ghafar, Amir Hamzah, Kamel Ariffin, Muhammad Rezal, Asbullah, Muhammad Asyraf

    Published 2018
    “…This is a reason why implementation in key generation algorithm of RSA cryptosystem requires its primes, p and q not to be constituted by small primes. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7
  8. 8

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

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

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

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  10. 10

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

    Published 2012
    “…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
  11. 11

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  12. 12

    CHAOS AND PUBLIC KEY INFRASTRUCTURE (PKI) by CHEW, JUNYEE

    Published 2004
    “…Theproject thus concludes with comparison of the new public key scheme based on logistic map with RSA algorithm on MATLAB platform.…”
    Get full text
    Get full text
    Final Year Project
  13. 13

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

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Factorization strategies of N = pq and N = pʳq and relation to its decryption exponent bound by Abubakar, Saidu Isah

    Published 2018
    “…The major RSA underlying security problems rely on the difficulty of factoring a very large composite integer N into its two nontrivial prime factors of p and q in polynomial time, the ability to solve a given Diophantine equation ed = 1 + kφ (N) where only the public key e is known and the parameters d, k and φ (N) are un- known and finally the failure of an adversary to compute the decryption key d from the public key pair (e, N). …”
    Get full text
    Get full text
    Thesis
  16. 16

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

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  17. 17

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

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

    Published 2014
    “…Results from the study and analysis found that AAβ cryptosystem have speeds exceeding RSA and ECC cryptosystem encryption process. While the decryption process, AAβ have speeds exceeding RSA and ECC. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    An investigation of cryptographically generated address (CGA)-based authentication for mobile IPv6 by Qadir, Sana, Siddiqi, Mohammad Umar

    Published 2014
    “…The only drawback is that CGA algorithms can be computationally expensive. This study analyses the performance of the CGA generation algorithm and proposes changes to impose a minimal computational security while maintaining reasonable performance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  20. 20