Search Results - (( java implementation force algorithm ) OR ( using continuous rsa algorithm ))

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

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

    Published 2016
    “…In the first attack we consider the class of public key exponents satisfying an equation eX - NY - (apr + bqr + z) = 1 where a, b are suitably small integers with gcd(a, b) = 1. 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
    Conference or Workshop Item
  2. 2

    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
    “…This weakness was identified by solving the simultaneous Diophantine approximations using the lattice basis reduction technique. We note that this work extends the bound of insecure RSA decryption exponents.…”
    Get full text
    Get full text
    Article
  3. 3

    Cryptanalysis on prime power RSA modulus of the form N=prq by Kamel Ariffin, Muhammad Rezal, Shehu, Sadiq

    Published 2016
    “…We apply the LLL algorithm, and show that our strategy enable us to simultaneously factor the \(k\) prime power RSA moduli \(N_i\).…”
    Get full text
    Get full text
    Article
  4. 4

    An analysis of the AAḃ asymmetric encryption scheme on embedded devices for IoT environment / Syed Farid Syed Adnan by Syed Adnan, Syed Farid

    Published 2019
    “…It is also not known how the algorithm would perform against the widely used RSA on resource-constrained platforms. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

    Efficiency analysis for public key systems based on fractal functions. by M. G. AL-Saidi, Nadia, Md. Said, Mohamad Rushdan, M. Ahmed, Adil

    Published 2011
    “…Results: In the proposed protocol, the attractor of the IFS is used to obtain public key from private one, which is then used with the attractor again to encrypt and decrypt the messages. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Simulation of quantum growing network / Ong Boon Teong by Ong , Boon Teong

    Published 2003
    “…Should it be possible to build a microprocessor which fully exploits quantum mechanics then it may be possible to carry out such factorisations in remarkably less time. The RSA algorithm, a widely used encryption system, is safe only if such factorisations cannot be performed quickly. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Development of a cryptography model based on improved filtering, compression and encryption techniques for ECG signal processing by Hameed, Mustafa Emad

    Published 2022
    “…The Diffie-Hellman key exchange and Rivest Shamir Adleman (RSA) key generation algorithms have been used to authenticate the receiver, and key generation for encrypting and decrypting processes, respectively. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9