USING IMPROVE RSA (RIVEST-SHAMIR-ADLEMAN ALGORITHM) TO SECURE

BIG DATA STORAGE IN CENTRALIZED COMPUTING SERVICE

BY

Abdulrahman Abdulganiyu

16583005

1
Contents
ABSTRACT....................................................................................................................................................3
1. INTRODUCTION...................................................................................................................................4
1.1 Historical background...............................................................................................................4
1.2. RSA Algorithm..........................................................................................................................6
1.3. Statement of Problem.....................................................................................................................6
1.4 Aim and Objectives.........................................................................................................................7
1.5 Scope of the Study..........................................................................................................................7
1.6 Significance of the Study.................................................................................................................7
1.7 Research Methodology..............................................................................................................7
Research methods..................................................................................................................................8
Structure..................................................................................................................................................8
Reference....................................................................................................................................................9

2
 ABSTRACT

This exploration center around application of improve RSA (Rivest-Shamir-Adleman) Theorem

innovation this will totally give more effectiveness and unwavering quality over the network
(AbdElminaam, 2018). The proposed work improves and strengthen data security by increasing
the prime number and also manipulate the encryption key before sending it to receiver.
Expanded-RSA for key encryption. Thus, unauthorized personnel will need more time to decrypt
the text and it also find a solution for the brute-force attack, differential attack, and linear attack.
The performance analysis of the proposed plan is done and compared with the Expanded-RSA
on the foundation of encryption and decryption time. The result shows that the proposed plan
takes little time for encryption process and less time for decryption process, hence it upgrades the
security of the data.

3
 1. INTRODUCTION

1.1 Historical background

On a public network, data is exposed to a broad range of attacks. Thus, security is of major
importance during data handling, data transfer, and electronic communication. To accomplish
the confidentiality in data transfer and to overcome attacks, Numerous cryptography techniques
are introduced. Cryptography is used for message randomization, confidentiality, and low
modification rate to provide high security to data over network. Cryptography can be a thought
of as a process of transforming the plaintext into a non-readable format and prevents the message
from unauthorized access (Aules Centeno et al., 2016). Thus, in the previously, numerous
encryption techniques are introduced to provide a safe transmission of data over network.
Cryptography techniques are divided into two main categories such as symmetric key
cryptography and asymmetric key cryptography. Symmetric key cryptography works in such a
way that it uses the same cryptographic key for both encryption and decryption process. It could
either be stream cipher or block cipher. In stream cipher, message digits are encrypted one after
the other, while in block cipher, some bits are taken and encrypted as a unit. Sometimes, padding
in plaintext is needed, so that it could make a multiple of block size. AES is an example of
symmetric key cryptography. In asymmetric key cryptography, different keys are used for the
encryption and decryption process. One key is kept public known as public key which is used for
encryption process while another key is kept hidden known as private key which is used for
decryption process. RSA is an example of asymmetric key cryptography (Liu, Fan, Tian, &
Ding, 2017).
The fundamental objective of cryptography is to enable two individuals to convey over an
insecure channel such that a rival can't comprehend what is being said. The sender encrypts a
plain text utilizing a foreordained key and sends the resultant figure text over the channel. An
interloper, after observing the figure text over the channel can't figure out what the original
message was; however the receiver who knows the encryption key can decrypt the figure text
and reproduce the plain text.(Bhagat, Satpute, & Palekar, 2013)
Classical cryptography depends on a mix of mystery and arithmetic. Security relies upon the
trouble of computational many-sided quality which isn't sufficient as the quickly developing
techniques to ascertain the secret key will bargain the security. There are two methodologies in
classical cryptography for key dispersion: Symmetric cryptography and asymmetric
cryptography. (Odeh, Elleithy, & Faezipour, 2013) In symmetric cryptography there is same
secret key shared between two parties who need to impart though in asymmetric cryptography
conveying parties must have match of key called public and private key; the private key is kept
secret with each party and public key is utilized for encryption of data is known to everybody
who needs to convey.
The employments of computer correspondences networks innovations have expanded the
occurrences of computer mishandle. Because of these scenes, most associations facing weight to

4
secure their advantages. Most digital networks by and large extensive rely upon front line
cryptosystems to secure the confidentiality and respectability of development passed on finished
the network. The present current cryptosystems centered around logical model familiarize
potential security openings related with mechanical progression of computing power, the key
revive rate and key extension proportion, the most crucial parameters in the security of any
cryptographic procedures. Along these lines endeavors have been made to make new foundation
for cryptography science in the machine correspondence frameworks. (Gautam, Mishra, &
Shrivastava, 2017). Key circulation is the limit that passes on a key to two parties who wish to
convey. Key dissemination is the quality of any cryptographic framework as the security of any
correspondence is thoroughly relies upon the secret key. In this way, it is essential to have secure
key dissemination framework in light of the fact that if the key get bargained then entire
framework will get traded off.
There are many drawbacks for symmetric encryption algorithms such as key maintenance is a
great problem faced in symmetric encryption methods and less security level is the problem of
asymmetric encryption methods even though key maintenance is easy. And there are many
drawbacks of asymmetric encryption algorithms such as those algorithms consume a significant
amount of computing resources such as CPU time, memory, and battery power.
A proposed protocol architecture by Ren (Dixit, Gupta, Trivedi, & Yadav, 2018), the DES
algorithm is used for data transmission due to its efficiency. The RSA algorithm is used for the
key encryption of the DES due to the advantages it carries in key cipher. The combination of the
session key from RSA encryption and the cipher text from DES encryption are sent out. The
decryption algorithm is the reverse direction of encryption algorithm. The limitation of this
research is using traditional RSA algorithm which most hackers has been working had to bypass.
We need to upgrade the RSA algorithm to strengthen security surrounding data.
Therefore, 0ur research further target how to manipulate encryption key and expand the prime
number of RSA algorithm so to make it difficult in predicting the prime factor. we also modify
the public key e of RSA before sending the modify e to receiver.
In this exploration I will audit the hypothesis of RSA cryptography, its potential applications and
the improvement of a test. The two primary objectives of cryptography are for a sender and a
planned beneficiary to have the capacity to impart in a frame that is incomprehensible to
outsiders, and for the confirmation of messages to demonstrate that they were not adjusted in
travel. Both of these objectives can be expert with provable security if sender and beneficiary are
in control of shared, secret "key" material. Along these lines, key material, which is a really
irregular number succession, is an exceptionally profitable ware despite the fact that it passes on
no valuable information itself. One of the key issues of cryptography is along these lines the
supposed "key conveyance issue." How do the sender and expected beneficiary come into
ownership of secret key material while being certain that outsiders ("eavesdroppers") can't

5
procure even partial information about it? It is provably difficult to build up a secret key with
traditional correspondences, thus key circulation has depended on the foundation of a physically
secure channel ("trusted couriers") or the restrictive security of "troublesome" numerical issues
in public key cryptography. Be that as it may, provably secure key appropriation winds up
conceivable with RSA correspondences. It is this technique of key appropriation that is proficient
by RSA cryptography, and not simply the transmission of an encrypted message. (Meneses et al.,
2016).

1.2. RSA Algorithm

RSA (Rivest Shamir Adleman ) is an asymmetric key cryptography, which uses different keys for
encryption and decryption process such as public key and private key, respectively. The practical
difficulty of factorization of two large prime numbers defines the security of RSA algorithm
(Patil, Narayankar, Narayan, & Meena, 2016). The RSA plan is as follows:

Key generation:
1. Select two enormous random prime numbers, p and q of approximately equal size that their
product n p *q is desired bit length.
2. Calculate n p *q and Ø(n)(p −1)*(q −1).
3. Select a positive integer e, such that 1<e <Ø(n), such that GCD (e, Ø(n))
4. Calculate the value of secret Exponent d, 1<d <Ø(n), such that e *d 1(mod
Ø(n)).
5. The pair (e, n) is a public key and (d, n) is a private key. The values d, p, q, and Ø(n) should
be kept as a secret.
where
• n is modulus,
• e is the public exponent or encryption exponent or simply the exponent, and • d is the

secret exponent or decryption exponent.

Encryption:
Suppose user A wants to send message “m” to user B.
1. Procure the public key (e, n) of user B.
2. Represent the plaintext as positive integer m.
3. Calculate the ciphertextc me mod n, using user B’s public key.
4. Send the ciphertextc to user B.
Decryption:
User B will retrieve the original message from cipher text.
1. Use private key (d, n) to compute m cd mod n.
2. Extract the plaintext m from c.

6
 1.3. Statement of Problem
Most companies store business and individual information over the Internet or cloud computing.
Much of the information stored is highly confidential and not for knowing publicly. Data
encryption is most traditional technique that secure highly confidential information by using
some conventional algorithm, which already exist or prewritten. Most powerful part of
encryption technique is key generation, which has two parts, one is symmetric key generation
and another is asymmetric key generation. Nowadays hackers are easily capable to break the key
with the help of modern high computing machines. Current need is strongly modifying encrypted
data which cannot be decrypt through cryptanalysis.
We have concluded after literature study that the best method to provide security to data is to use
Expand asymmetric RSA algorithms on the data at same time. We used our expanded RSA
algorithm for more data security. Our research target on how to expand the prime number of
RSA algorithm so to make it difficult in predicting the prime factor. We also changed the public
key of RSA before sending the modification to the receiver.

1.4 Aim and Objectives

The aim and objectives of this research is to build up a solution which will improve the information
security and protection of data stored leakage in unify computing frameworks. To accomplish this
objective, the hugeness of security and protection issues in the centralized computing service will be
research. This research will apply the utilization of Expaned RSA (Rivest-Shamir-Adleman) Algorithm
innovation to secure data. This will make three strides:
1. Encrypt our data center.
2. To generate a key for encrypted data using propose Expanded RSA (Rivest-Shamir-Adleman
Algorithm).
3. Transport the key from sender to receiver in a secure channel.

1.5 Scope of the Study

This research will cover execution Expanded RSA (Rivest-Shamir-Adleman) by increasing the prime
number from two to five and also work on manipulation of encryption key before sending it.. We would
portray the device and convention that is intended to actualize the key dissemination by which two
clients who share secret information that are encrypted.

1.6 Significance of the Study

The purpose of my study is to:
1. Is to offers guarantee on the quality of big data services.
2. Easy access, and secure information sharing platform for the users.

7
 1.7 Research Methodology
Therefore, 0ur research further target how to expand the prime number of RSA algorithm so
to make it difficult in predicting the prime factor. we also modify the public key e of RSA
before sending the modify e to receiver, and at same time we are using Three, four and five
prime number instead of two prime numbers, and multiple public keys, to provide more
security over the network and „n‟ prime numbers are not so easily factorable and increases
the efficiency through the networks. Simultaneously, I used knearest neighbor algorithm.
Sometimes there is a situation in which the cipher text is the same as the plaintext and in
such cases attacker can easily encrypt original message.
We can also apply our algorithm on videos. And in future we will apply our algorithm on
audio encryption and decryption [Link] we compare proposed RSA with the original RSA
algorithm.

Research methods
There are two types of research methods used in this thesis:

• Literature review
The purpose of the literature review is to find reference material to provide the solid
and sufficient information needed for the cryptographic algorithm background and to
carry out the actual research.

• Empirical research
This is the constructive part of the thesis, which provides as a result valuable
information of the execution time. The results also provide one more proof if it’s
beneficial or not to use Information security. The execution time is not the only
reason when evaluating the benefit of new software library, but plays a significant
role among the other factors.

8
Reference

AbdElminaam, D. S. (2018). Improving the security of cloud computing by building new hybrid
cryptography algorithms. International Journal of Electronics and Information Engineering, 8(1),
40-48.
Aules Centeno, H. M., Meneses, F., Fuertes, W., Sancho, J., Salvador, S., Flores, D., . . . Nuela, D. (2016).
RSA encryption algorithm optimization to improve performance and security level of network
messages.
Bhagat, P. V., Satpute, K. S., & Palekar, V. R. (2013). Reverse encryption algorithm: a technique for
encryption & decryption. International Journal of Latest Trends in Engineering and Technology
(IJLTET), 2(1), 90-95.
Dixit, P., Gupta, A. K., Trivedi, M. C., & Yadav, V. K. (2018). Traditional and Hybrid Encryption Techniques:
A Survey Networking Communication and Data Knowledge Engineering (pp. 239-248): Springer.
Gautam, S., Mishra, S., & Shrivastava, M. (2017). A Survey on Generation and Evolution of Various
Cryptographic Techniques.
Liu, J., Fan, C., Tian, X., & Ding, Q. (2017). Optimization of AES and RSA Algorithm and Its Mixed
Encryption System. Paper presented at the International Conference on Intelligent Information
Hiding and Multimedia Signal Processing.
Meneses, F., Fuertes, W., Sancho, J., Salvador, S., Flores, D., Aules, H., . . . andNuela, D. (2016). RSA
Encryption Algorithm Optimization to Improve Performance and Security Level of Network
Messages. International Journal of Computer Science and Network Security (IJCSNS), 16(8), 55-
62.
Odeh, A., Elleithy, K., & Faezipour, M. (2013). Steganography in Arabic text using Kashida variation
algorithm (KVA). Paper presented at the Systems, Applications and Technology Conference
(LISAT), 2013 IEEE Long Island.
Patil, P., Narayankar, P., Narayan, D., & Meena, S. (2016). A comprehensive evaluation of cryptographic
algorithms: DES, 3DES, AES, RSA and Blowfish. Procedia Computer Science, 78, 617-624.