Search Results - (( based coding rsa algorithm ) OR ( java implications tree algorithm ))

Search alternatives:

  • Showing 1 - 7 results of 7
Refine Results
  1. 1
    A comparative review on symmetric and asymmetric dna-based cryptography

    A comparative review on symmetric and asymmetric dna-based cryptography by Hammad B.T., Sagheer A.M., Ahmed I.T., Jamil N.

    Published 2023
    “…The efficiencies of DNA coding in OTP, RSA, and other algorithms were given. …”
    Article
    Save to List
    Saved in:
  2. 2
    Implementing Station-to-Station protocol using Multi Prime RSA Cryptosystem / Muhammad Arif Musa Abdullah

    Implementing Station-to-Station protocol using Multi Prime RSA Cryptosystem / Muhammad Arif Musa Abdullah by Abdullah, Muhammad Arif Musa

    Published 2023
    “…The result will also produce the algorithm for implementing Multi Prime RSA cryptosystem into Station-to-Station protocol. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  3. 3
    A hardware implementation of Rivest-Shamir-Adleman co-processor for resource constrained embedded systems

    A hardware implementation of Rivest-Shamir-Adleman co-processor for resource constrained embedded systems by Paniandi, Arul

    Published 2006
    “…Embedded C language codes are then written to test the functionality of the RSA co-processor on hardware. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    DNA sequences compression by GP2R and selective encryption using modified RSA technique

    DNA sequences compression by GP2R and selective encryption using modified RSA technique by Hossein, Syed Mahamud, De, Debashis, Mohapatra, Pradeep Kumar Das, Mondal, Sankar Prasad, Ahmadian, Ali, Ghaemi, Ferial, Senu, Norazak

    Published 2020
    “…This technique can find out the 3.851273 bits per base of the compression rate. The O(n) is the complexity of this algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    A qualitative study of families of Edwards Curves and their applications in cryptography / Nurul Azwa Kamaruddin and Nurul Ain Mustakim

    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
    Save to List
    Saved in:
  6. 6
    Quantum-Resistant Cryptography in Cyber Security

    Quantum-Resistant Cryptography in Cyber Security by Bhargavgowda, A.B., Chitra, K.

    Published 2025
    “…It provides a systematic overview of major post-quantum cryptographic families, including lattice-based, hash-based, code-based, multivariate, and isogeny-related schemes, and evaluates their current security assumptions, practical efficiency, and readiness for real-world deployment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Simulation of quantum growing network / Ong Boon Teong

    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
    Save to List
    Saved in:

Search Tools: