Cryptography has several important aspects in supporting the security of the data, which
guarantees confidentiality, integrity and the guarantee of validity (authenticity) data. One of the
public-key cryptography is the RSA cryptography. The greater the size of the modulus n, it will be
increasingly difficult to factor the value of n. But the flaws in the RSA algorithm is the time
required in the decryption process is very long. Theorem used in this research is the Chinese
Remainder Theorem (CRT). The goal is to find out how much time it takes RSA-CRT on the size
of modulus n 1024 bits and 4096 bits to perform encryption and decryption process and its
implementation in Java programming. This implementation is intended as a means of proof of
tests performed and generate a cryptographic system with the name "RSA and RSA-CRT Text
Security". The results of the testing algorithm is RSA-CRT 1024 bits has a speed of
approximately 3 times faster in performing the decryption. In testing the algorithm RSA-CRT 4096
bits, the conclusion that the decryption process is also effective undertaken more rapidly.
However, the flaws in the key generation process and the RSA 4096 bits RSA-CRT is that the
time needed is longer to generate the keys.
Design and implementation of network security using genetic algorithmeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEMIJNSA Journal
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In this paper we propose a cryptosystem Little Dragon Two which is as efficient as Little Dragon cryptosystem but secure against all the known attacks. Like Little Dragon cryptosystem the public key of Little Dragon Two is mixed type that is quadratic in plaintext and cipher text variables. So the public key size of Little Dragon Two is equal to Little Dragon Cryptosystem. Our public key algorithm is bijective and can be used for both encryption and signatures.
Design and implementation of network security using genetic algorithmeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
LITTLE DRAGON TWO: AN EFFICIENT MULTIVARIATE PUBLIC KEY CRYPTOSYSTEMIJNSA Journal
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In this paper we propose a cryptosystem Little Dragon Two which is as efficient as Little Dragon cryptosystem but secure against all the known attacks. Like Little Dragon cryptosystem the public key of Little Dragon Two is mixed type that is quadratic in plaintext and cipher text variables. So the public key size of Little Dragon Two is equal to Little Dragon Cryptosystem. Our public key algorithm is bijective and can be used for both encryption and signatures.
EFFICIENT CONDITIONAL PROXY REENCRYPTION WITH CHOSEN CIPHER TEXT SECURITYIJNSA Journal
In a proxy re-encryption (PRE) scheme, Alice gives a special information to a proxy that allows it to transform messages encrypted under Alice's public key into a encryption under Bob's public key such that the message is not revealed to the proxy. In [14], Jian Weng and others introduced the notion of conditional proxy re-encryption (C-PRE) with bilinear pairings. Later, a break for the same was published in [17] and a new C-PRE scheme with bilinear pairings was introduced. In C-PRE, the proxy also needs to have the right condition key to transform the ciphertext (associated with a condition set by Alice) under Alice's public key into ciphertext under Bob's public key, so that Bob can decrypt it. In this paper, we propose an efficient C-PRE scheme which uses substantially less number of bilinear pairings when compared to the existing one [17]. We then prove its chosen-ciphertext security under modified Computational Diffie-Hellman (mCDH) and modified Computational Bilinear Diffie-Hellman (mCBDH) assumptions in the random oracle model.
Nearest Prime Cipher for Data Confidentiality and IntegrityEswar Publications
Communication is the process of transmitting information from source to destination. The information exchanged between sender and receiver through the proper channel. The information should not be stolen by unauthorized parties like hackers while sending or receiving via channel. To avoid this stealing of the information cryptography techniques are used. The key is playing prominent role in cryptography. This paper proposes a novel method for key generation by using nearest primes. Further 2’s complement and logical operations are
used in encryption and decryption process. The final cipher text is generated by representing the intermediate cipher in matrix form and then read by column wise.
Exploiting tls to disrupt privacy of web application's trafficSandipan Biswas
In this work, we analyze privacy and security aspects of encryption modes, padding schemes
and order of padding of messages in TLS during encrypted communication between client and
web-application on the server. We show that using padding schemes to pad all packets to
hide message sizes during communication without considering underlying encryption modes and
padding methodology is not safe .
Digital Signature Recognition using RSA AlgorithmVinayak Raja
• OBJECTIVE: Basically, the idea behind digital signatures is the same as your handwritten signature. You use it to authenticate the fact that you promised something that you can't take back later. A digital signature doesn't involve signing something with a pen and paper then sending it over the Internet. But like a paper signature, it attaches the identity of the signer to a transaction.
• PROBLEM SOLVED: Signer authentication , Message authentication, Non-repudiation , Message integrity
SCHEME OF ENCRYPTION FOR BLOCK CIPHERS AND MULTI CODE GENERATION BASED ON SEC...IJNSA Journal
In this paper we propose a scheme of encryption for Block ciphers in N-alphabet, where every member of any m-block of plain text is enciphered by different permutations which are generated by the help of a secret key word. Further we extend this method to multicode encryption using the fact that encrypting each member differently is the basis of multicode encryption.
Elgamal signature for content distribution with network codingijwmn
Network coding is a slightly new forwarding technique which receives various applications in traditional
computer networks, wireless sensor networks and peer-to-peer systems. However, network coding is
inherently vulnerable to pollution attacks by malicious nodes in the network. If any fake node in the
network spreads polluted packets, the pollution of packets will spread quickly since the output of (even an)
honest node is corrupted if at least one of the incoming packets is corrupted. There have been adapted a
few ordinary signature schemes to network coding that allows nodes to check the validity of a packet
without decoding. In this paper, we propose a scheme uses ElGamal signature in network coding. Our
scheme makes use of the linearity property of the packets in a coded system, and allows nodes to check the
integrity of the packets received easily.
Dynamic Multi Levels Java Code Obfuscation Technique (DMLJCOT)CSCJournals
Several obfuscation tools and software are available for Java programs but larger part of these
software and tools just scramble the names of the classes or the identifiers that stored in a
bytecode by replacing the identifiers and classes names with meaningless names. Unfortunately,
these tools are week, since the java, compiler and java virtual machine (JVM) will never load and
execute scrambled classes. However, these classes must be decrypted in order to enable JVM
loaded them, which make it easy to intercept the original bytecode of programs at that point, as if
it is not been obfuscated. In this paper, we presented a dynamic obfuscation technique for java
programs. In order to deter reverse engineers from de-compilation of software, this technique
integrates three levels of obfuscation, source code, lexical transformation and the data
transformation level in which we obfuscate the data structures of the source code and byte-code
transformation level. By combining these levels, we achieved a high level of code confusion,
which makes the understanding or decompiling the java programs very complex or infeasible.
The proposed technique implemented and tested successfully by many Java de-compilers, like
JV, CAVJ, DJ, JBVD and AndroChef. The results show that all decompiles are deceived by the
proposed obfuscation technique
Mobile User Authentication Based On User Behavioral Pattern (MOUBE)CSCJournals
Smart devices are equipped with multiple authentication techniques and still remain prone to
attacks since all of these techniques require explicit user intervention. The purpose of this paper
is to capture the user behavior in order to use it as an implicit authentication technique.
In this paper, we introduce a novel authentication model to be used complementary to the
existing models; Particularly, the context of the user, the duration of usage of each application
and the occurrence time were examined and modeled using the cubic spline function as an
authentication technique. A software system composed of two software components has been
implemented on Android platform. Preliminary results show a 76% accuracy rate in determining
the rightful owner of the device.
Automated Diagnosis of Malaria in Tropical Areas Using 40X Microscopic Images...CSCJournals
This paper proposes a new algorithm to measure parasitemia stemming from Plasmodium
falciparum by using optical images of capillary blood smears from Sub-Saharan Africa. The
approach is an improvement of the previous noteworthy method by developing a two-tone
adaptive median filter and Sauvola segmentation. The analysis was performed on the database
of 100X and 40X microscopic images originating from real time collection of patients’ blood of
some Cameroon’s laboratories. The obtained results were very satisfactory with a detection of
infected cells on 40X images of a sensitivity at 81.58%, a specificity at 97.11% and an accuracy
at 96.71%. Compared to the previous works, the values portray a real improvement in most
performance’s criteria for 100X images and 40X images as well. There is a significant step of
automated Malaria diagnosis in tropical areas and in the performance assessed. The results of
the method gave more strength for the two magnification ranges. The time spent in analysis is
obviously reduced with 40X magnification and the inaccessibility of the information by the visual
laboratory measurement is henceforth genuinely assaulted. The low cost of the system opens
therefore the possibility of a cost effective method of diagnosing malaria in low and middleincome
countries
EFFICIENT CONDITIONAL PROXY REENCRYPTION WITH CHOSEN CIPHER TEXT SECURITYIJNSA Journal
In a proxy re-encryption (PRE) scheme, Alice gives a special information to a proxy that allows it to transform messages encrypted under Alice's public key into a encryption under Bob's public key such that the message is not revealed to the proxy. In [14], Jian Weng and others introduced the notion of conditional proxy re-encryption (C-PRE) with bilinear pairings. Later, a break for the same was published in [17] and a new C-PRE scheme with bilinear pairings was introduced. In C-PRE, the proxy also needs to have the right condition key to transform the ciphertext (associated with a condition set by Alice) under Alice's public key into ciphertext under Bob's public key, so that Bob can decrypt it. In this paper, we propose an efficient C-PRE scheme which uses substantially less number of bilinear pairings when compared to the existing one [17]. We then prove its chosen-ciphertext security under modified Computational Diffie-Hellman (mCDH) and modified Computational Bilinear Diffie-Hellman (mCBDH) assumptions in the random oracle model.
Nearest Prime Cipher for Data Confidentiality and IntegrityEswar Publications
Communication is the process of transmitting information from source to destination. The information exchanged between sender and receiver through the proper channel. The information should not be stolen by unauthorized parties like hackers while sending or receiving via channel. To avoid this stealing of the information cryptography techniques are used. The key is playing prominent role in cryptography. This paper proposes a novel method for key generation by using nearest primes. Further 2’s complement and logical operations are
used in encryption and decryption process. The final cipher text is generated by representing the intermediate cipher in matrix form and then read by column wise.
Exploiting tls to disrupt privacy of web application's trafficSandipan Biswas
In this work, we analyze privacy and security aspects of encryption modes, padding schemes
and order of padding of messages in TLS during encrypted communication between client and
web-application on the server. We show that using padding schemes to pad all packets to
hide message sizes during communication without considering underlying encryption modes and
padding methodology is not safe .
Digital Signature Recognition using RSA AlgorithmVinayak Raja
• OBJECTIVE: Basically, the idea behind digital signatures is the same as your handwritten signature. You use it to authenticate the fact that you promised something that you can't take back later. A digital signature doesn't involve signing something with a pen and paper then sending it over the Internet. But like a paper signature, it attaches the identity of the signer to a transaction.
• PROBLEM SOLVED: Signer authentication , Message authentication, Non-repudiation , Message integrity
SCHEME OF ENCRYPTION FOR BLOCK CIPHERS AND MULTI CODE GENERATION BASED ON SEC...IJNSA Journal
In this paper we propose a scheme of encryption for Block ciphers in N-alphabet, where every member of any m-block of plain text is enciphered by different permutations which are generated by the help of a secret key word. Further we extend this method to multicode encryption using the fact that encrypting each member differently is the basis of multicode encryption.
Elgamal signature for content distribution with network codingijwmn
Network coding is a slightly new forwarding technique which receives various applications in traditional
computer networks, wireless sensor networks and peer-to-peer systems. However, network coding is
inherently vulnerable to pollution attacks by malicious nodes in the network. If any fake node in the
network spreads polluted packets, the pollution of packets will spread quickly since the output of (even an)
honest node is corrupted if at least one of the incoming packets is corrupted. There have been adapted a
few ordinary signature schemes to network coding that allows nodes to check the validity of a packet
without decoding. In this paper, we propose a scheme uses ElGamal signature in network coding. Our
scheme makes use of the linearity property of the packets in a coded system, and allows nodes to check the
integrity of the packets received easily.
Dynamic Multi Levels Java Code Obfuscation Technique (DMLJCOT)CSCJournals
Several obfuscation tools and software are available for Java programs but larger part of these
software and tools just scramble the names of the classes or the identifiers that stored in a
bytecode by replacing the identifiers and classes names with meaningless names. Unfortunately,
these tools are week, since the java, compiler and java virtual machine (JVM) will never load and
execute scrambled classes. However, these classes must be decrypted in order to enable JVM
loaded them, which make it easy to intercept the original bytecode of programs at that point, as if
it is not been obfuscated. In this paper, we presented a dynamic obfuscation technique for java
programs. In order to deter reverse engineers from de-compilation of software, this technique
integrates three levels of obfuscation, source code, lexical transformation and the data
transformation level in which we obfuscate the data structures of the source code and byte-code
transformation level. By combining these levels, we achieved a high level of code confusion,
which makes the understanding or decompiling the java programs very complex or infeasible.
The proposed technique implemented and tested successfully by many Java de-compilers, like
JV, CAVJ, DJ, JBVD and AndroChef. The results show that all decompiles are deceived by the
proposed obfuscation technique
Mobile User Authentication Based On User Behavioral Pattern (MOUBE)CSCJournals
Smart devices are equipped with multiple authentication techniques and still remain prone to
attacks since all of these techniques require explicit user intervention. The purpose of this paper
is to capture the user behavior in order to use it as an implicit authentication technique.
In this paper, we introduce a novel authentication model to be used complementary to the
existing models; Particularly, the context of the user, the duration of usage of each application
and the occurrence time were examined and modeled using the cubic spline function as an
authentication technique. A software system composed of two software components has been
implemented on Android platform. Preliminary results show a 76% accuracy rate in determining
the rightful owner of the device.
Automated Diagnosis of Malaria in Tropical Areas Using 40X Microscopic Images...CSCJournals
This paper proposes a new algorithm to measure parasitemia stemming from Plasmodium
falciparum by using optical images of capillary blood smears from Sub-Saharan Africa. The
approach is an improvement of the previous noteworthy method by developing a two-tone
adaptive median filter and Sauvola segmentation. The analysis was performed on the database
of 100X and 40X microscopic images originating from real time collection of patients’ blood of
some Cameroon’s laboratories. The obtained results were very satisfactory with a detection of
infected cells on 40X images of a sensitivity at 81.58%, a specificity at 97.11% and an accuracy
at 96.71%. Compared to the previous works, the values portray a real improvement in most
performance’s criteria for 100X images and 40X images as well. There is a significant step of
automated Malaria diagnosis in tropical areas and in the performance assessed. The results of
the method gave more strength for the two magnification ranges. The time spent in analysis is
obviously reduced with 40X magnification and the inaccessibility of the information by the visual
laboratory measurement is henceforth genuinely assaulted. The low cost of the system opens
therefore the possibility of a cost effective method of diagnosing malaria in low and middleincome
countries
The availability of advanced capturing and computation techniques delivered the way to study on
trajectory data, which denote the mobility of a variety of moving objects, such as people, vehicles
and animals. Trajectory data mining is of the research trend in data mining research to cope with
the current demand of trajectory data analysis providing profit rich applications. Data clustering is
one of the best techniques to group the community data. In this paper efforts are made to review
the trendy research being done in trajectory data mining. The review is three fold, surveying the
literature on location and community based trajectory mining, trajectory data bases and trajectory
querying. The review explored the trajectory data mining framework. This review can help outline
the field of trajectory data mining, providing a quick outlook of this field to the community.
Trajectory clustering methods are discussed. The opportunities and applications of cluster based
trajectory data mining are presented. The method of similarity based community clustering is
adopted to go with the future work.
Performance Evaluation of Image Edge Detection Techniques CSCJournals
The success of an image recognition procedure is related to the quality of the edges marked. The
aim of this research is to investigate and evaluate edge detection techniques when applied to
noisy images at different scales. Sobel, Prewitt, and Canny edge detection algorithms are
evaluated using artificially generated images and comparison criteria: edge quality (EQ) and map
quality (MQ). The results demonstrated that the use of these criteria can be utilized as an aid for
further analysis and arbitration to find the best edge detector for a given image.
Gene Selection for Patient Clustering by Gaussian Mixture ModelCSCJournals
Clustering is the basic composition of data analysis, which also plays a significant role in
microarray analysis. Gaussian mixture model (GMM) based clustering is very popular approach
for clustering. However, GMM approach is not so popular for patients/samples clustering based
on gene expression data, because gene expression datasets usually contains the large number
(m) of genes (variables) in presence of a few (n) samples observations, and consequently the
estimates of GMM parameters are not possible for patient clustering, because there does not
exists the inverse of its covariance matrix due to m>n. To conquer these problems, we propose to
apply a few ‘q’ top DE (differentially expressed) genes (i.e., q<n /><m) between two or more
patient classes, which are selected proportionally from all DE gene’s groups. Here, the fact
behind our proposal that the EE (equally expressed) genes between two or more classes have no
significant contribution to the minimization of misclassification error rate (MER). For selecting few
top DE genes, at first, we clustering genes (instead of patients/samples) by GMM approach. Then
we detect DE and EE gene clusters (groups) by our proposed rule. Then we select q (few) top DE
genes from different DE gene clusters by the rule of proportional to cluster size. Application of
such a few ‘q’ number of top DE genes overcomes the inverse problem of covariance matrix in
the estimation process of GMM’s parameters, and ultimately for gene expression data
(patient/sample) clustering. The performance of the proposed method is investigated using both
simulated and real gene expression data analysis. It is observed that the proposed method
improves the performance over the traditional GMM approaches in both situations.
Robust Analysis of Multibiometric Fusion Versus Ensemble Learning Schemes: A ...CSCJournals
Identification of person using multiple biometric is very common approach used in existing user
validation of systems. Most of multibiometric system depends on fusion schemes, as much of the
fusion techniques have shown promising results in literature, due to the fact of combining multiple
biometric modalities with suitable fusion schemes. However, similar type of practices are found in
ensemble of classifiers, which increases the classification accuracy while combining different
types of classifiers. In this paper, we have evaluated comparative study of traditional fusion
methods like feature level and score level fusion with the well-known ensemble methods such as
bagging and boosting. Precisely, for our frame work experimentations, we have fused face and
palmprint modalities and we have employed probability model - Naive Bayes (NB), neural
network model - Multi Layer Perceptron (MLP), supervised machine learning algorithm - Support
Vector Machine (SVM) classifiers for our experimentation. Nevertheless, machine learning
ensemble approaches namely, Boosting and Bagging are statistically well recognized. From
experimental results, in biometric fusion the traditional method, score level fusion is highly
recommended strategy than ensemble learning techniques.
Application of Fuzzy Logic in Load Balancing of Homogenous Distributed Systems1CSCJournals
Various studies have shown that distributing the work load evenly among processors of a
distributed system highly improves system performance and increases resource utilization. This
process is known as load balancing. Fuzzy logic has been applied in many fields of science and
industry to deal with uncertainties. Existing research in using fuzzy logic for the purpose of load
balancing has only concentrated in utilizing fuzzy logic concepts in describing processors load
and tasks execution length. The responsibility of the fuzzy-based load balancing process itself,
however, has not been discussed and in most reported work is assumed to be performed in a
distributed fashion by all nodes in the network. This paper proposes a new fuzzy dynamic load
balancing algorithm for homogenous distributed systems. The proposed algorithm utilizes fuzzy
logic in dealing with inaccurate load information, making load distribution decisions, and
maintaining overall system stability. In terms of control, we propose a new approach that specifies
how, when, and by which node the load balancing is implemented. Our approach is called
Centralized-But-Distributed (CBD). An evaluation study of the proposed algorithm shows that our
algorithm is able to reduce the average response time and average queue length as compared to
known load balancing algorithms reported in the literature.
The Royal Split Paradigm: Real-Time Data Fragmentation and Distributed Networ...CSCJournals
With data encryption, access control, and monitoring technology, high profile data breaches still
occur. To address this issue, this work focused on securing data at rest and data in motion by
utilizing current distributed network technology in conjunction with a data fragmenting and
defragmenting algorithm. Software prototyping was used to exhaustively test this new paradigm
within the confines of the Defense Technology Experimental Research (DETER) virtual testbed.
The virtual testbed was used to control all aspects within the testing network including: node
population, topology, file size, and number of fragments. In each topology, and for each
population size, different sized files were fragmented, distributed to nodes on the network,
recovered, and defragmented. All of these tests were recorded and documented. The results
produced by this prototype showed, with the max wait time removed, an average wait time of
.0287 s/fragment and by increasing the number of fragments, N, the complexity, X, would
increase as demonstrated in the formula: X = (.00287N!).
Performance Evaluation of Web Services In Linux On MulticoreCSCJournals
Contemporary Business requires the ability to seamlessly exchange information between internal
business units, customers, and partner, is vital for success. Most organizations employ a variety of
different applications to store and exchange data in dissimilar way and therefore cannot “communicate” to
one another productively [1]. Service Oriented Architecture (SOA) components provide services to other
components via communication protocols typically over a network [2].The technologies like DCOM, RMI,
COBRA, Web Services etc. are developed using SOA, which contributed best to fulfill requirements to
some extent, but components result from these technologies are mostly either language specific or
platform specific,[3]. The services or components developed for one platform may not be able to
communicate and reusable in other platform, as they are mostly language specific or platform specific.
“World Wide Web Consortium (W3C) International community to develop web standards” issued WS-*
specifications for programming language vendors for Web services, which confirms a standard means of
interoperating between different software applications running on a variety of platforms or frameworks
[4][5]. This paper tests web services performance gain along with interoperability, reusability by using
“NAS Parallel Benchmarks (NPB)” set of program [6] developed by NASA Advanced Supercomputing
Division to evaluate the performance of supercomputers.
Over this thesis, we did try to optimize tow major challenges of RSA policy:
1# Computational complexity.
2# Apology of unbreakability.
We use here multidimensional random padding scheme (MRPS) as an outer layer protection. RSA policy itself is inner or core layer but not ever unbreakable if additional layers are imposed. Here in this work, our MRPS scheme would able to ensure fully parametrized randomization process.
Chaotic Rivest-Shamir-Adlerman Algorithm with Data Encryption Standard Schedu...journalBEEI
Cryptography, which involves the use of a cipher, describes a process of encrypting information so that its meaning is hidden and thus, secured from those who do not know how to decrypt the information. Cryptography algorithms come with the various types including the symmetric key algorithms and asymmetric key algorithms. In this paper, the authors applied the most commonly used algorithm, which is the RSA algorithm together with the Chaos system and the basic security device employed in the worldwide organizations which is the Data Encryption Standard (DES) with the objective to make a hybrid data encryption. The advantage of a chaos system which is its unpredictability through the use of multiple keys and the secrecy of the RSA which is based on integer factorization’s difficulty is combined for a more secure and reliable cryptography. The key generation was made more secure by applying the DES schedule to change the keys for encryption. The main strength of the proposed system is the chaotic variable key generator that chages the value of encrypted message whenever a different number of key is used. Using the provided examples the strength of security of the proposed system was tested and demonstrated.
Information and network security 33 rsa algorithmVaibhav Khanna
RSA algorithm is asymmetric cryptography algorithm. Asymmetric actually means that it works on two different keys i.e. Public Key and Private Key. As the name describes that the Public Key is given to everyone and Private key is kept private
Nowadays cloud computing is emerging technology which gives open resources on the internet. It is offering large amount of data to the users and distributed data over the network. Cloud computing denotes sharing of resources rather than having local servers to handle applications. It provides services to servers, storage and applications over the internet. And this cloud computing environment is used by all small and large company users. Since all the data is stored in the cloud, backing it up and restoring the same is relatively much easier than storing the same on a physical device. Cloud computing provide a convenient way to work group of people together on a common project or applications in an effective manner. there are also many factors supporting cloud computing like virtualization process, distributed storage, fast and inexpensive server, broadband internet access etc.
But the major drawback is security in providing data over the internet. Each and every cloud searcher is raising a question to cloud provider that whether it contains security policies and procedures before hosting their applications. Due to poor security, there exists poor applications, data loss, hijacking, traffic etc. But the main issue is it does not have any security in distributing data. It becomes the main obstacle in cloud computing environment. So to enhance the security, so to protect the data, we proposed an algorithm called RSA algorithm. It is a new approach and it met the requirements of public key systems. By using this algorithm it will increase the data security This algorithm uses various data block size and various size keys. It has asymmetric keys for both encryption and decryption. It uses two prime numbers to generate the public and private keys. These two different keys are used for encryption and decryption purpose. This algorithm can be broadly classified in to three stages; key generation by using two prime numbers, encryption and decryption.
Many cryptographic asymmetric algorithms are available to solve data security issue in cloud. Algorithms hide data from unauthorized users. Encryption Algorithms have vital role in the data security of cloud computing. Examples of such algorithms are Diffie-hellman ,ECC,DSA,RSA etc. Since Diffie-helman algorithm is not for encryption or decryption but it enable two parties who are involved in communication to generate a shared secret key for exchanging information confidentially. Elliptic Curve Cryptography (ECC) is only for smaller devices like cell phones. When Digital Signature Algorithm (DSA) is used, the process of creating the digital signature is faster than validating it. When RSA is used, the process of validating the digital signature is faster than creating it.RSA has two keys one public and the other is private, The public key is known to all, and the private key is kept secret and is mostly used in hybrid encryption schemes and digital signatures.
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have
become increasingly reliant on. The main research in computer security domain is how to enhance the
speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the
CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo
value that can process large power of numbers which otherwise are not supported by built-in data types.
First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using
CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime
number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or
small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical
soundness can be alleviated by this algorithm.
ANALYSIS OF RSA ALGORITHM USING GPU PROGRAMMINGIJNSA Journal
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have become increasingly reliant on. The main research in computer security domain is how to enhance the speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo value that can process large power of numbers which otherwise are not supported by built-in data types. First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical soundness can be alleviated by this algorithm.
RSA is one of the most popular Public Key Cryptography based algorithm mainly used for digital
signatures, encryption/decryption etc. It is based on the mathematical scheme of factorization of very large
integers which is a compute-intensive process and takes very long time as well as power to perform.
Several scientists are working throughout the world to increase the speedup and to decrease the power
consumption of RSA algorithm while keeping the security of the algorithm intact. One popular technique
which can be used to enhance the performance of RSA is parallel programming. In this paper we are
presenting the survey of various parallel implementations of RSA algorithm involving variety of hardware
and software implementations.
Authentication system for e-certificate by using RSA’s digital signatureTELKOMNIKA JOURNAL
Online learning and teaching become the popular channel for all participants, because they can access the courses everywhere with the high-speed internet. E-certificate is being prepared for everyone who has participated or passed the requirements of the courses. Because of many benefits frome-certificate, it may become the demand for intruders to counterfeit the certificate. In this paper, Rivest-Shamir-Adleman (RSA)’s digital signature is chosen to signe-certificate in order to avoid being counterfeited by intruders. There are two applications to managee-certificate. The first application is the signing application to sign the sub image including only participant’s name in e-certificate. In general, the file of digital signature is divided frome-certificate. That means, both of them must be selected to compare each other in checking application. In fact, the solution will be approved when each pixel of participant’s name is equal to each part from the decrypted message at the same position. In experimental session, 40 e-certificatesare chosen for the implementation. The results reveal that the accuracy is 100% and both of signing and checking processes are completed rapidly fast, especially when signing application is applied with Chinese remainder theorem (CRT) or the special technique of CRT. Therefore, the proposed method is one of the best solutions to protect e-certificate from the forgery by intruders.
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
The Art Pastor's Guide to Sabbath | Steve ThomasonSteve Thomason
What is the purpose of the Sabbath Law in the Torah. It is interesting to compare how the context of the law shifts from Exodus to Deuteronomy. Who gets to rest, and why?
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
How to Create Map Views in the Odoo 17 ERPCeline George
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
We all have good and bad thoughts from time to time and situation to situation. We are bombarded daily with spiraling thoughts(both negative and positive) creating all-consuming feel , making us difficult to manage with associated suffering. Good thoughts are like our Mob Signal (Positive thought) amidst noise(negative thought) in the atmosphere. Negative thoughts like noise outweigh positive thoughts. These thoughts often create unwanted confusion, trouble, stress and frustration in our mind as well as chaos in our physical world. Negative thoughts are also known as “distorted thinking”.
How to Split Bills in the Odoo 17 POS ModuleCeline George
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
Implementation of RSA Algorithm with Chinese Remainder Theorem for Modulus N 1024 Bit and 4096 Bit
1. Desi Wulansari, Much Aziz Muslim & Endang Sugiharti
International Journal of Computer Science and Security (IJCSS), Volume (10) : Issue (5) : 2016 186
Implementation of RSA Algorithm with Chinese Remainder
Theorem for Modulus N 1024 Bit and 4096 Bit
Desi Wulansari desiwulans03@gmail.com
Department of Computer Science
Faculty of Mathematics and Natural Science
Semarang State University
Semarang, 50229, Indonesia
Much Aziz Muslim a212muslim@yahoo.com
Department of Computer Science
Faculty of Mathematics and Natural Science
Semarang State University
Semarang, 50229, Indonesia
Endang Sugiharti endanghs02@yahoo.com
Department of Computer Science
Faculty of Mathematics and Natural Science
Semarang State University
Semarang, 50229, Indonesia
Abstract
Cryptography has several important aspects in supporting the security of the data, which
guarantees confidentiality, integrity and the guarantee of validity (authenticity) data. One of the
public-key cryptography is the RSA cryptography. The greater the size of the modulus n, it will be
increasingly difficult to factor the value of n. But the flaws in the RSA algorithm is the time
required in the decryption process is very long. Theorem used in this research is the Chinese
Remainder Theorem (CRT). The goal is to find out how much time it takes RSA-CRT on the size
of modulus n 1024 bits and 4096 bits to perform encryption and decryption process and its
implementation in Java programming. This implementation is intended as a means of proof of
tests performed and generate a cryptographic system with the name "RSA and RSA-CRT Text
Security". The results of the testing algorithm is RSA-CRT 1024 bits has a speed of
approximately 3 times faster in performing the decryption. In testing the algorithm RSA-CRT 4096
bits, the conclusion that the decryption process is also effective undertaken more rapidly.
However, the flaws in the key generation process and the RSA 4096 bits RSA-CRT is that the
time needed is longer to generate the keys.
Keywords: Encryption and Decryption, RSA, RSA-CRT, 1024 bit and 4096 bit.
1. INTRODUCTION
When this information becomes essential for the people, the ease of access to information are
the main expectations. In addition to convenience, content information obtained is also influential
for most people. Security and confidentiality is an aspect that is important in order to prevent the
collapse of confidential information into the hands of those who are not responsible. A data can
be secured by way of encryption of the content of the data, it is commonly referred to
cryptography [1].
Cryptography is the study of mathematical techniques related to aspects of information security
such as data confidentiality, data integrity, data integrity, and authentication of data. One public-
key cryptography algorithm is the famous RSA cryptography. The RSA algorithm has a
cryptographic key pair that is a public key and a private key.
2. Desi Wulansari, Much Aziz Muslim & Endang Sugiharti
International Journal of Computer Science and Security (IJCSS), Volume (10) : Issue (5) : 2016 187
Mathematical operations on RSA consists of multiplying two prime numbers (p and q) are
selected randomly, the result of the multiplication is n. N The larger the size, the better the level of
security because it would deprive the attacker to break the factorization of the value of n. Then
proceed with the powers and operation of modular operations. Modular calculations on the
division process must leave the quotient (remainder value).
But despite the problems faced by RSA cryptography is secure so far it has been claimed [2], but
if the modulus n bits of its enormous size, the decryption process at the RSA algorithm requires a
long time. Additionally this process requires great complexity. So as to simplify the process of
powers between the two numbers modular required an efficient mathematical calculations.
Some of the popular mathematical calculations to solve this problem one of them is Chinese
Remainder Theorem (CRT), or more commonly referred to RSA-CRT [3]. This algorithm is a
mathematical calculation that his role in the RSA algorithm as modular exponential simplification
process. Modular powers RSA-CRT performed on the value of p and q [4]. In this study, there are
2 pieces the size of modulus n to be used is 1024 bits and 4096 bits. The resulting time of the
encryption and decryption process will be observed to obtain results and draw a conclusion.
2. THE ALGORITHM AND METHOD
In the key generation RSA-CRT decryption exponent (d) is not directly given to the private key but
can be calculated via the parameter dP, dQ and qInv which has a long half-size bits d. While the
private key RSA-CRT is set as Kprivate = (dP, dQ, qInv, p, q). While public key RSA-CRT is
equal to the system RSA algorithm, namely (n, e) so that the encryption algorithm is not change
is by using modular exponential function c = m
e
mod n.
2.1 RSA Algorithm
The RSA algorithm in the algorithm key generation, encryption and decryption are shown as
follows:
1) Choose two prime numbers p and q with p ≠ q.
2) Calculate the value of n = p q and ø(n) = (p - 1) (q - 1).
3) Choose a number e (1<e <ø(n)) with gcd (e, ø(n)) = 1.
4) Calculate the value of d = e
-1
on ℤø(n).
5) The key to the public is (n, e) and the private key is (n, d).
The encryption process using equation (1) as follows:
c = m
e
mod n (1)
Where c is the result of the encryption of the plaintext, plaintext is the original text [5] while e is
relatively prime numbers resulting from calculations ø(n) = (p - 1) (q - 1). m is the plaintext to be
encrypted, while n is the result of n = p q.
And the decryption algorithm of RSA to decrypt the chipertext, chipertext is the data that has
been encoded [6] using equation (2) as follows:
m = c
d
mod n (2)
Where m is the result of decryption, while c is the chipertext. d is the result of the inverse process
e modulus (p - 1) (q - 1).
2.2 RSA-CRT Algorithm
A RSA-CRT algorithm to generate the keys are as follows:
1) Choose two prime numbers p and q with p ≠ q provisions.
2) Calculate the value of n = p q and ø(n) = (p - 1) (q - 1).
3) Choose a number e (1<e <ø(n)) with gcd (e, ø(n)) = 1.
4) Calculate the value of d = e
-1
on ℤø(n).
5) Calculate the results dP = d mod (p - 1).
6) Calculate the results dQ = d mod (q - 1).
3. Desi Wulansari, Much Aziz Muslim & Endang Sugiharti
International Journal of Computer Science and Security (IJCSS), Volume (10) : Issue (5) : 2016 188
7) Calculate the results qInv = q
-1
mod p.
8) Results Kpublic = (e, n) and Kprivate = (dP, dQ, qInv, p, q).
The formula to determine the private key d by using equation (3) as follows:
d e mod ø(n) = 1 (3)
equation (3) is equivalent to the following equation (4):
d ≡ e
-1
(mod ℤø(n)) (4)
Where d is the result of the inverse process e modulus (p - 1) (q - 1), and e is relatively prime
numbers resulting from calculations ø(n) = (p - 1) (q - 1).
Encryption algorithm RSA-CRT serves to convert plaintext into chiperteks. Encryption algorithm
RSA-CRT is equal to the RSA encryption algorithm. The encryption process using the following
algorithm:
1) Input plaintext and Kpublic = (n, e).
2) Calculate the result of the formula encryption c = m e mod n.
Where c is the result of the encryption of the plaintext, while e is relatively prime numbers
resulting from calculations ø(n) = (p - 1) (q - 1). m is the plaintext to be encrypted, while n is the
result of n = p q.
To decrypt chiperteks, using the private key (dP, dQ, qInv, p, q) The RSA-CRT decryption
algorithm to restore chiperteks into plaintext is as follows:
1) Input chiperteks and Kprivate = (dP, dQ, qInv, p, q).
2) Calculate the value x1 = C
dP
mod p.
3) Calculate the value x2 = C
dQ
mod q.
4) Calculate h = qInv (x1 - x2) mod p.
5) The results of M = x2 + h q.
Where M is the result of decrypting encrypted plaintext message after (chiperteks). To find the
result x2, first calculating the results of x1. After that, the search continues in the process of
calculating x2 + h q to find the value of h.
2.3 Testing
Testing was conducted using the data in the form of text with each having a different size. Here is
a table of text data that is used both the character and its size in bytes is shown in Table 4.1.
No. Text Size (byte)
1 Hai 3 byte
2 SEGERA BERKUMPUL NANTI SORE AKAN ADA
RAPAT PENTING
50 byte
3 anGKasAdiRganTara666679 23 byte
4 Rp 95.345.000,- 15 byte
5 Segera Lakukan Re-shuffle Kabinet Kerja! 40 byte
TABLE 1: Text and Data List Size in Bytes.
In accordance with Table 1, the first text data of plaintext is used lower case letters. The second
text data using upper case letters. The third text data using a combination of upper case, lower
case and numbers. The fourth data meggunakan combination of upper case, lower case,
numbers and symbols. While in the fifth the data using a combination of upper case, lower case,
and symbols.
4. Desi Wulansari, Much Aziz Muslim & Endang Sugiharti
International Journal of Computer Science and Security (IJCSS), Volume (10) : Issue (5) : 2016 189
In the first test, the key will be raised by 1024 bits. The results of the private key and public key
obtained at random. The value of e generated by the system randomly in accordance with the
provisions e (1 <e <ø(n)) with gcd (e, ø(n)) = 1 is e = 3. Since 1024 bit key size for the number of
numbers generated long enough on the value of p, q and n. Here below is the result of the RSA
key generation and a 1024-bit RSA-CRT:
p = 10277651387301176987572317325479097395047746036448
09259710908734340250231174881775912743279205016377
33979655095360153800010911836260705198915653142336
10391
Values of p key generated as many as 155 characters in decimal. While following the generation
of the keys on the value of q is:
q = 11477990785403537825829714057028719300154941210754
98780912268468497672034368407332370186424197056338
84617243251249168877722536665242249074891552040518
84923
The value of q raised key has a number no different from p key values as many as 154
characters. The system is processing the steps to find the value of the multiplication of two prime
numbers p and q are prime numbers by multiplying the result of both the n = p q. As a result of
the value of n are as follows:
n = 11796678791903279657847637919373441536852260211807
21756891581313624284029594204420437699481533561502
05907103863786409262454101821911942847169605133844
12454088268637081919279132101575631548968303775379
00396870079715414202890886129151448171128723026655
67529874887655142902239658345808376618266144606443
149034893
While at RSA-CRT key dP, dQ and qInv raised key value shown below:
dP = 68517675915341179917148782169860649300318306909653
95064739391562268334874499211839418288528033442515
59864367302401025333406078908404701326104354282240
6927
dQ = 76519938569356918838864760380191462001032941405033
25206081789789984480229122715549134576161313708925
64114955008327792518150244434948327165943680270125
6615
qInv = 49376036358377184742338381585975903414025413474651
80142927287373201845362801213975002353013594980009
82781233309664942894019440739725040071111488679026
6219
The key value dP, dQ, and qInv raised as many as 155 characters in decimal. The key value is
generated through the key generation process has a number of characters as much as 308
decimal. This allows RSA and RSA-CRT can meet the security because the number of digits p
and q are more than 200 characters so difficult for an attacker to perform factorization of integers
to the variable n. Number of key characters n is the number of key digit number of digits p plus q
key. The total size of each key value p and q is equal to 512 bits.
5. Desi Wulansari, Much Aziz Muslim & Endang Sugiharti
International Journal of Computer Science and Security (IJCSS), Volume (10) : Issue (5) : 2016 190
The next stage is to convert the original message into chiperteks through an encryption process
using the public key (n, e). In the process of testing, there are 5 pieces of text that are used with
each having a different size. This test was conducted to determine the time complexity of the
algorithm RSA and RSA-CRT if the process of encryption and decryption of 1024 bits. The results
displayed time during the testing process are presented in Table 2 below.
TABLE 2: The Results of Comparison Time RSA encryption and RSA-CRT 1024 bits.
Table 2 is a comparison of the speed of RSA encryption and RSA-CRT 1024 bits. Comparison of
the time generated by the RSA encryption algorithm and RSA-CRT 1024 bits is not much
different. As for the results of a comparison between the decryption algorithm RSA and RSA-CRT
1024 bits is shown in Table 3.
TABLE 3: The Results of Comparison Time Decryption RSA and RSA-CRT 1024 bits.
According to Table 3, it can be observed that the RSA algorithm can refund the value of
chiperteks into plaintext (decryption) requires quite a long time. However, after the RSA
algorithm, written by the method of Chinese Remainder Theorem (CRT) produces a fairly short
period of approximately three times faster in performing decryption on chiperteks. The next the
process of testing 4096 bits of RSA cryptography. the tests performed same with previous testing,
which is at RSA 4096 bits of key generated first. As a result of generating RSA keys and RSA-
CRT 4096 bits in full accordance with the above image is presented as follows:
e = 7
p = 23004739437130670717767973787359593061506850243043
25607619686023618167468895402838699644725214215416
13517783225570705477157602704678080850641643354084
48788139925747826925716115259021998013764524545442
50132576754539162984708954775994111863949367749188
98596798892762703721897660754269396787575347317861
72005032900309977955865353849663122559450766116200
19900697594319430653517455044561213715149587144358
12808105760534953251122857223443037295142422728392
77452518994866804326273059852039122733640793942419
51467961267922123771714470172589855471403925099003
99600933703299618940494790244562326436331743244891
88104721410869189
q = 21155458138467361615630020886747232977290579067606
44093817952201383907421669404140461298040861018512
94356397719420120661533112364966103895975470611284
File Encryption of RSA (nano second) Encryption of RSA-CRT (nano second)
1 330,130 371,148
2 316,803 348,592
3 330,131 358,845
4 344,485 375,250
5 351,661 382,426
File Decryption of RSA (nano second) Decryption of RSA-CRT (nano second)
1 103,534,963 29,710,330
2 102,998,756 29,400,697
3 103,437,564 29,477,594
4 103,300,180 29,538,084
5 103,515,483 29,730,836
6. Desi Wulansari, Much Aziz Muslim & Endang Sugiharti
International Journal of Computer Science and Security (IJCSS), Volume (10) : Issue (5) : 2016 191
59555691938605475679143738342023160406595656207125
28688746932060932901087146005724913383679676462914
25111818061111355369782150031417084873696513986408
44192179218027352730330751601408746261807993884875
24967320631383650474726049321139689267017927472741
10537452174438073647055888088907175371475637066399
84238358606270733851231054506236027168917410258644
27791811620232357156852830968051904448345249071423
20636813950865049249173520526338375849746056641291
62456646596400321
The number of characters on the keys p which successfully raised at RSA 2048 bit is 309
decimal, while key of q has a amount key characters as much as 617 decimal numbers too. Each
bit size of the prime numbers p and q primes of 1024 bits. While the key to a successful n
generated by the system is shown below:
n = 48667580214856711939608782982782654039474506145845
74729970275369021184937552979829698643289613989846
83810552175168649301276459103458598106550569350829
48311009766352440629735219005499596542366070318534
80636971426314636748719898530766702838739895624734
48715744017165496189610977062483011525926678939822
72304610282641009699295207757304332305369455979079
39400905726040909340376155455675230054966686745866
92395189350670883360136306662666024712982620043885
38817140835873762553894885582232091236765630370531
09409367448536939942326971709204992241443326968470
24842004195083050919973103956139746085705747721397
44220740017250377516579114375393032367960575734662
40985818086971124687153459889224102603129735966422
11090526509550618506660960501059059488768062423285
12293404637063857288861320321710486620724762865102
49155387283656915866544132912949177207955024183987
90808335434916939030718293314405213286026542653019
99274031454436177644289766421305117169389794695480
59405996132629013419458712153312629847526858358158
24272174866343408814248059867483504208140459395031
78208260352887452739471407601502459892739849796801
55601913500035969339798326846347431188891315946829
06095369125180465493978443533193024155728462316573
003954935742262620738051208609669
While on the RSA-CRT key dP, dQ and qInv are raised key value shown below:
dP = 19718348088969146329515406103451079767005871636894
21949388302305958429259053202433171124050183613213
83015242764774890408992230889724069300549980017786
70389834222069565936328098793447426868941021038950
71542208646747853986893389807994953026242315213590
55940113336653746047340852075088054389350297701024
33147171057408552533598874728282676479529228099600
17057740795130940560157818609623897470128217552306
96692662080458531358105306191522603395836362338622
37816444852742975136805479873176390914549251950645
29829681086790391804326688719362733261203364370574
85372228888542530520424105923910565516855779924193
7. Desi Wulansari, Much Aziz Muslim & Endang Sugiharti
International Journal of Computer Science and Security (IJCSS), Volume (10) : Issue (5) : 2016 192
04089761209316447
dQ = 12088833221981349494645726220998418844166045181489
39482181686972219375669525373794549313166206296293
11060798696811497520876064208552059369128840349305
48317538250631700388082136195441805946626089261214
44964998246891961657764083431842807647816957978808
14349610320635060211304085732238334213540865135090
53824102410301344417331858057947855006747425077071
57124183217933514556986313897794108152581672841566
34592829813964613512603364622232671640843221180799
90993347775011847914989174003563444096524234433511
01595320925847061232487331981743945399054428040813
26078179400494313856670583157907643342712032366452
35689512340800183
qInv = 17051326736583810883461788367598009671919646056446
43952558276557513946796179792294274207504509178165
47966000508916302886307980077711929444707031141893
22283717684812224892576002579728239682870705699779
48012900511259205040902736384145544011139640514949
60945017559503486335527275786234519161944495122863
34422942279408855885048789639567717310566182085612
56070805354303949559081130908069676256821267928508
95815215089426511367951153482283654043014516843543
89848650490862896117503781687512694020741855664799
94390754123303566174870359306737794612248588426900
86378489771115286793762730265134351318346311832925
03935686836335671
The key value of dP, dQ, and qInv is raised as much as 617 characters in decimal. N number of
key characters obtained through the multiplication of prime numbers p and q prime numbers as
many as 1,213 decimal. This key is meets criteria of security because the number of characters
that raised more than 200 decimal. But the key generation process with a size of 4096 bits takes
longer than the key generation process with 1024 bits. The last stage traversed by comparing the
speed of encryption and decryption of the RSA algorithm with RSA-CRT 4096 bits. The results of
the comparison of the encryption process is presented in Table 4.
TABLE 4: The Results of Comparison Time RSA encryption and RSA-CRT 4096 bits
According to the Table 4 can be drawn a response that the encryption process on the RSA
algorithm and RSA-CRT 4096 bits have no significant difference. For the comparison of the
decryption process at RSA and RSA-CRT 4096 bits is shown in Table 5.
File Encryption of RSA (nano second) Encryption of RSA-CRT (nano second)
1 6,623,256 6,643,762
2 6,634,535 6,573,018
3 6,626,332 6,591,474
4 6,660,166 6,659,142
5 6,706,303 6,714,506
8. Desi Wulansari, Much Aziz Muslim & Endang Sugiharti
International Journal of Computer Science and Security (IJCSS), Volume (10) : Issue (5) : 2016 193
TABLE 5: The Results of Comparison Time Decryption RSA and RSA-CRT 4096 bits
The comparison is shown in Table 5 states that after the RSA algorithm is combined with the
Chinese Remainder Theorem (CRT) is more effective to accelerate the process of decryption of a
message, more or less able to speed up the decryption process as much as three times faster
than the use of the RSA algorithm usual, though the size of the bits of used 4 times larger than
1024 are bits.
After the entire the process of testing is done, the next will produce a statement that can be
drawn as a conclusion. The results of the testing of all five text data after the encryption and
decryption process in modulus n 1024 bits and 4096 bits of will be loaded in graphical form. The
following is a graph of the time complexity of the encryption process on text data to the one
shown in Figure 1.
FIGURE 1: The Results of Comparison Time Encryption RSA and RSA-CRT.
Results graph of the time complexity of the encryption process in Figure 1 shows that the
difference between the encryption process on RSA and RSA-CRT did not experience much
change although the modulus n which is used differently. So also with the results of the
encryption process on text data of 2 to 5 text data equally showed no significant differences in
time. Hereafter the time complexity is the result of the decryption process text data to the one
shown in Figure 2.
0
1000000
2000000
3000000
4000000
5000000
6000000
7000000
1024 4096
time(nanosecond)
Modulus (n)
The Result of Encryption RSA vs RSA-CRT on Text 1
RSA
RSA-CRT
File Decryption of RSA (nano second) Decryption of RSA-CRT (nano second)
1 5,853,890,548 1,304,281,228
2 5,842,122,477 1,149,450,813
3 5,906,614,132 1,171,997,568
4 5,944,532,789 1,311,686,767
5 5,945,090,537 1,168,936,106
9. Desi Wulansari, Much Aziz Muslim & Endang Sugiharti
International Journal of Computer Science and Security (IJCSS), Volume (10) : Issue (5) : 2016 194
FIGURE 2: The Results of Comparison Time Decryption RSA and RSA-CRT
Based on the graph in Figure 2, Theorem Chinese Remainder Theorem (CRT) in the RSA is very
effective to accelerate the process of decryption of the message even though the value of the
modulus n which is used differently. Decryption speeds have increased by about 3-fold compared
with the use of RSA. Increased speed is also generated at the data into text data to the 2 to 5.
3. CONCLUSION
The results of the test declared that the correct algorithm RSA-CRT has a rate of approximately 3
times faster in performing the decryption process although using the modulus n of different sizes.
However, shortcomings exist in key generation process of RSA and RSA-CRT 4096 bits because
of the time it takes much longer.
4. REFERENCES
[1] Muslim, M. A., & Prasetiyo, B. “Implementation Twofish Algorithm for Data Security in a
Communication Network using Library Chilkat Encryption Activex.” Journal of Theoretical and
Applied Information Technology, 84 (3), 370. 2016.
[2] Chen, C., Wang, T., & Tian, J. “Improving Timing Attack on RSA-CRT via Error Detection and
Correction Strategy.” Information Sciences, 232, 464-474. 2013.
[3] Lu, Y., Zhang, R., & Lin, D. “New Partial Key Exposure Attacks on CRT-RSA with Large
Public Exponents.” In International Conference on Applied Cryptography and Network
Security (pp. 151-162), Springer International Publishing. June, 2014.
[4] Quisquater, J. J., & Couvreur, C. Fast Decipherment Algorithm for RSA Public-Key
Cryptosystem. Electronics Letters, 18(21), 905-907. 1982.
[5] Abutaha, Mohammed, et al. “Survey Paper: Cryptography is the Science of Information
Security.” International Journal of Computer Science and Security (IJCSS), 5.3: 298. 2011.
[6] Alawadhi, R., & Nair, S. “A Crypto-System with Embedded Error Control for Secure and
Reliable Communication.” International Journal of Computer Science and Security (IJCSS),
7(2), 48. 2013.
0
1E+09
2E+09
3E+09
4E+09
5E+09
6E+09
7E+09
1024 4096
time(nanosecond)
Modulus (n)
The Result of Decryption RSA vs RSA-CRT on Text 1
RSA
RSA-CRT