Search Results - (( exploring computer rsa algorithm ) OR ( java implication based algorithm ))

  • Showing 1 - 5 results of 5
Refine Results
  1. 1

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

    Published 2017
    “…The success of factoring few large RSA modulo within the last few decades has been due to computing prowess overcoming one strong prime of RSA modulo. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    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 success of factoring few large RSA modulo within the last few decades has been due to computing prowess overcoming one strong prime of RSA modulo. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    A qualitative study of families of Edwards Curves and their applications in cryptography / Nurul Azwa Kamaruddin and Nurul Ain Mustakim by Kamaruddin, Nurul Azwa, Mustakim, Nurul Ain

    Published 2012
    “…Among those cryptosystems, there are three types of public key cryptographic systems that are currently considered both secure and efficient, classified according to the mathematical problems upon which they are based: the Integer Factorization Systems (of which the RSA algorithm is the most well known example), the Discrete logarithm Systems (such as the US Government’s Digital Signature Algorithm) and the Elliptic Curve Cryptosystem (ECC). …”
    Get full text
    Get full text
    Research Reports
  4. 4
  5. 5