Search Results - (( developing computer rsa algorithm ) OR ( java implication drops algorithm ))
Search alternatives:
- developing computer »
- implication drops »
- java implication »
- rsa algorithm »
- computer rsa »
-
1
Parallel Processing of RSAAlgorithm Using MPI Library
Published 2006“…This report explains the project of developing Parallel Processing of RSA Algorithm Using MPI Library. …”
Get full text
Get full text
Final Year Project -
2
Implementation of Grid Computing for Cryptosystem (RSA)
Published 2005“…One objective ofthis project is to perform a small scale study in order to set up a grid computing that can support faster computation ofRSA Algorithm. …”
Get full text
Get full text
Final Year Project -
3
A hardware implementation of Rivest-Shamir-Adleman co-processor for resource constrained embedded systems
Published 2006“…The designed RSA coprocessor core is actually a modular exponentiation hardware engine, which is the basic arithmetic operation in implementing a RSA public key encryption and decryption algorithm. …”
Get full text
Get full text
Thesis -
4
-
5
Hybrid cryptography algorithm to improve security cloud storage
Published 2017“…To improve secure of data in cloud storage by hybrid three algorithms (AES, ECC and RSA).All the existing algorithms has some sort of problems and issues, this had made us decide to develop a safe, correct ad efficient algorithm for having secured data in cloud storage. …”
Get full text
Get full text
Get full text
Thesis -
6
An analysis of the AAḃ asymmetric encryption scheme on embedded devices for IoT environment / Syed Farid Syed Adnan
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 -
7
New Lightweight Identity Based Encryption Algorithm for Mobile Device: Preliminary Study
Published 2012“…Recently the importance of mobile security coincides with the development of mobile computing. Mobile security has become the most important part of the mobile telecommunication, but mobile device has a limited processing capabilities, bandwidth is limited , high latency networks, storage capabilities are limited, lack of computing power to support strong encryption are constrained in using traditional encryption scheme such as RSA. …”
Get full text
Get full text
Conference or Workshop Item -
8
Factorization strategies of N = pq and N = pʳq and relation to its decryption exponent bound
Published 2018“…This thesis develops three new strategies for the factorization of RSA modulus N = pq through analyzing small prime difference satisfying inequalities |b2 p − a2q| < Nγ , |bi p − a jq| < Nγ and |b j p − a jq| < for... …”
Get full text
Get full text
Thesis -
9
A qualitative study of families of Edwards Curves and their applications in cryptography / Nurul Azwa Kamaruddin and Nurul Ain Mustakim
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 -
10
-
11
-
12
Lattice-based cryptography: the dots that provide information security
Published 2023“…Once quantum computing technology is ready to be deployed effectively, the Shor’s quantum algorithm would become a major threat on number-theoretical based cryptosystems that are widely used today such as the RSA, ElGamal, and Elliptic Curve cryptosystems. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
13
Improved algorithms of elliptic curve point multiplication over binary and prime fields using elliptic net
Published 2022“…For safe curves of 384 and 512 bits, the developed ENPM algorithm over prime field outperformed the BM algorithm in terms of overall multiplications with 57.60% and 59.16% average running time. …”
Get full text
Get full text
Get full text
Thesis -
14
Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
Published 2015“…Elliptic curve cryptosystem (ECC) is being used nowadays more than ever to fulfill the need for public key cryptosystem because of its ability to use shorter keys lengths and computationally more efficient algorithms than anther public key cryptosystems such as Rivest-Shamir- Adleman (RSA), Digital Signature Algorithm (DSA) and ElGamal. …”
Get full text
Get full text
Get full text
Thesis -
15
Implementation of High Speed Large Integer Multiplication Algorithm on Contemporary Architecture
Published 2018“…The computation of cryptographic algorithm required a lot of large integer arithmetic computation, especially large integer exponentiation and modular operation. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
16
Quaternion-based dynamic algorithm for random generation of solid 4D cylindrical curves in RVE modeling
Published 2025“…A quaternion‐based dynamic algorithm is developed to populate Representative Volume Elements (RVEs) with solid 4D cylindrical fibers, combining spatial centerline coordinates (x,y,z) and quaternion‐encoded orientation. …”
Get full text
Get full text
Get full text
Article -
17
-
18
-
19
Efficient selective encryption schemes to secure video data and moving objects information for HEVC/H.265 using advanced encryption standard / Mohammed Ahmed Mohammed Saleh
Published 2016“…All of those encryption algorithms are classified as asymmetric and symmetric algorithms. …”
Get full text
Get full text
Thesis -
20