Search Results - (( problem solving rsa algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

  • Showing 1 - 17 results of 17
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

    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
    Save to List
    Saved in:
  2. 2
    Introducing S-index into factoring RSA modulus via Lucas sequences

    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
    Save to List
    Saved in:
  3. 3
    A comparative S-index in factoring RSA modulus via Lucas sequences

    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
    Save to List
    Saved in:
  4. 4
    Comparison between RSA hardware and software implementation for WSNs sexcurity schemes

    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
    Save to List
    Saved in:
  5. 5
    Extending Pollard class of factorable RSA modulus

    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
    Save to List
    Saved in:
  6. 6
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    New Lightweight Identity Based Encryption Algorithm for Mobile Device: Preliminary Study

    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
    Save to List
    Saved in:
  8. 8
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

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

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Factorization strategies of N = pq and N = pʳq and relation to its decryption exponent bound

    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
    Save to List
    Saved in:
  11. 11
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    CHAOS AND PUBLIC KEY INFRASTRUCTURE (PKI)

    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
    Save to List
    Saved in:
  13. 13
    Performance analysis and improvement of rabin primitive based cryptosystems

    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
    Save to List
    Saved in:
  14. 14
    An investigation of cryptographically generated address (CGA)-based authentication for mobile IPv6

    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
    Save to List
    Saved in:
  15. 15
    Class binarization with self-adaptive algorithm to improve human activity recognition

    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
    Save to List
    Saved in:
  16. 16
    Pseudo-random number generator (PRNG) combined with text based watermarking for cryptography application / Lew Chee Hon

    Pseudo-random number generator (PRNG) combined with text based watermarking for cryptography application / Lew Chee Hon by Lew , Chee Hon

    Published 2017
    “…Digital text protection received increasing attention in the last decade due to massive digital data documents via internet, hence digital watermarking was considered as a potential solution for solving cryptography problems since many E-commerce applications protect their data transactions through the internet. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    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
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: