Search Results - (( problem solving rsa algorithm ) OR ( java application optimization algorithm ))

Refine Results
  1. 1

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

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

    Published 2017
    “…In the past quarter century, factoring large RSA modulo into its primes is one of the most important and most challenging problems in computational number theory. …”
    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

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

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

    Published 2018
    “…Pollard p − 1 method is able to solve integer factorization problem if the targeted composite number has small prime factors. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

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

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

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

    Published 2004
    “…A major problem faced in this implementation has been solved while implementing the new logistic map scheme. …”
    Get full text
    Get full text
    Final Year Project
  9. 9
  10. 10

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

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

    Published 2014
    “…The AAβ cryptosystem is constructed based on the mathematical problem of solving the Square Root Modulo and Integer Factorization problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  13. 13
  14. 14
  15. 15

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

    Published 2014
    “…It is well known that the most promising approach to solving the problem of authentication in a mobile IPv6 network is to use CGA-based authentication. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  16. 16
  17. 17
  18. 18

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Class binarization with self-adaptive algorithm to improve human activity recognition by Zainudin, Muhammad Noorazlan Shah

    Published 2018
    “…Therefore, feature selection using Relief-f with self-adaptive Differential Evolution (rsaDE) algorithm is proposed to select the most significant features. …”
    Get full text
    Get full text
    Thesis
  20. 20