Advanced RSA Cryptographic

Algorithm for Improving Data Security

Mukesh Kumar

Abstract Data security is a method which is used to cover the important infor-
mation. Data security methods control the privacy and integrity of the important
information. The access to the database of the companies has improved. Now
companies store their business data more on computer than before. Most of the
company data is for internal use and not for the general public because business
data is highly confidential. At present, cryptographic block cipher is being used
with some logical operation and the main drawback in this method is the generation
of the secret key which is totally based on the alphabets. So with the help of loop
concept, there is a chance for the hackers to find out the secret key. But I propose
advanced algorithm for cryptography which is totally dependent on hashing func-
tion technique to generate a secret key which is further used to encrypt and decrypt
the important information. The secret key will be generated by using different key
generation algorithms which will be of higher sets of alphanumeric characters. I am
using a hashing technique for cryptography along with a new quantum-bit gener-
ation method.

Keywords Cryptography Ciphertext Data security Key generation algorithms

1 Introduction

Cryptography is the technique which is used to secure important information and

sends it over channel which is secured and only recipient receives the message. At
present, data security becomes a very important aspect of computing system. Due to
easy access of the Internet today, virtually all the computer system are connected to
each other. Due to advancement in the Internet, there is easy access of all the data
all over the world, but it also created new risks for those users who want to remain

M. Kumar (&)
H.P. University, Shimla, India
e-mail: mukesh.kumarphd2014@gmail.com

© Springer Nature Singapore Pte Ltd. 2018 11

M. U. Bokhari et al. (eds.), Cyber Security, Advances in Intelligent Systems
and Computing 729, https://doi.org/10.1007/978-981-10-8536-9_2
12 M. Kumar

Fig. 1 Network security model

their data secret. At present, hackers are using a variety of techniques in order to
break into computer system and steal information or change important data of any
organizations (Fig. 1).
At present, cryptography has many applications area. Cryptography provides a
high level of privacy by covering confidential data of any individuals or groups.
Cryptography is used for the purpose of providing access to data in restricted way,
data integrity, and authentication. At present, a lot of research work is going on to
find out the new cryptographic algorithms based on security and complexity [1].
Simply talking about data security, then the following features come to our mind
like privateness, validation, wholeness, disownment, access control, and availability
of data.

2 Literature Review

For generating the starting key for the purpose of encryption and decryption of the
information/ message provided to use, they generally used the random key gen-
erator algorithm [2]. In that particular technique, a replacement technique is used
where they can take four words set from given input message and after getting the
encrypted data, the equivalent words in the random key matrix can be identified.
A technique is suggested by Nath in multiple sequence alignment algorithm for
searching characters from a random key matrix [3]. In this technique, they provide
arrangement for encrypting data. The random key matrix contains all possible
characters set whose value lies between 0 and 255 (ASCII code). Text/ word key
used by the end user is used for the design of the random key matrix. From the
Advanced RSA Cryptographic Algorithm for Improving Data Security 13

starting word/text key used by user, they are providing a new encryption/
decryption steps to find the random and encryption number. The author unex-
pectedly finds it very difficult to meet the two variables from two unlike input. At
this stage, it is very difficult to crack the encryption techniques which are provided
by the author, but if anybody wants to crack the techniques then they must know all
the possible pattern of the word/text key used by the user. If anybody tries to
decrypt the data, then they must know the exact key matrix used and if anybody
tries theoretically to make the random matrix then they almost have to try 65,536!
attempts. Different researcher have applied this technique on possible data files and
they have observed that it gives 100% results while applying cryptography on data.
In paper [4], a newly advanced algorithm outline symmetric algorithm is pro-
posed which is in resemblance to Rijndael algorithm. In Rijndael technique, 128
bits block for encryption are used but in AES technique, 200 bits block are used.

3 Rivest–Shamir–Adleman Algorithm

RSA algorithm was suggested by Rivest–Shamir–Adleman of the Massachusetts

Institute of Technology in 1977. Rivest–Shamir–Adleman algorithm is a cryp-
tosystem which is used for encryption with public key, and is further used for
securing secret message details, which is transmitted over an uncertain computer
network. Public-key cryptography uses two different keys like one public and one
private key. Both the keys are used for the encryption of secret message; and in the
another case, opposite keys are used to decrypt of secret message. Due to this
attribute, Rivest–Shamir–Adleman algorithm has become the most widely used
algorithm. In Rivest–Shamir–Adleman algorithm, the security of the secret message
is implemented through web service. In Rivest–Shamir–Adleman algorithm,
public-key encryptions techniques are used. The certainty of the Rivest–Shamir–
Adleman algorithm depends on the problems for factoring [3, 5]. Rivest–Shamir–
Adleman algorithm is isolated or divided into two different parts:
Encryption of Secret Data: During the process of encryption of data files,
different session keys for encryption are generated. These generated keys are further
used for encryption with an algorithm as compared to encryption of data files as
whole. A moderate public encryption of data files is further used for encryption of
session.
Decryption of Encrypted Secret Data: The confidential data is changed into
their ciphertext before sending from sender X to recipient Y. Then, Y extracts the
session key which is further used for decryption with private key to get the con-
fidential information. The encryption and decryption keys should be kept
secret always.
Session Key: A session key of any cryptography algorithm is a decryption and
an encryption key that is randomly generated to maintain the security of a trans-
mission session between a sender and receivers.
14 M. Kumar

Quantum-bits Production: For the secret data of the user, first of all, find the
secret key for that data to encrypt. After getting the secret key, change the data into
hexadecimal code and after that change it into binary to get the least bits as
Quantum bits of 0 and 1.

4 Proposed Work

I proposed a block-based symmetric algorithm for cryptography techniques. To

generate the initial key by using session key method, a pseudorandom prime
number and their exponential values were used, further this key was used for
encrypting the given secret data using RSA algorithm. To encrypt a secret data, I
introduced a system which using 512-bit key size with some combination of
alphanumeric method. But one drawback of this method is to find out two similar
data. To decrypt any data file, receiver may know the same key block and then find
the combination with the alphanumeric number, but theoretically if you want to
decrypt the data, user has to apply 2256 trail on data. So, practically this is not
possible and the data still remains traceable.
Different steps for Session Key Generation:
• This is the jointly used secret key for encryption/decryption.
• For generating session key, pseudorandom prime number and their exponential
values were used.
• The session key used for encryption and decryption is 512 bits with a combi-
nation of alphanumeric values.
Proposed Algorithm for encryption and decryption:
Below are the following steps:
• First of all, get the secret key for your data. After that change into hexadecimal
to binary values again.
• After the completion of first step, two binary values are obtained, which are
further used for finding quantum bits.
• After getting the quantum bits, find the quantum key with the help of quantum
key production.
• If the quantum bit value is 0 for both binary value, then (1/√2 (a [0] + a [1])).
• If the quantum bit value is 1 and 0 for binary value, respectively, then (1/√2 (a
[0] − a [1])).
• If the quantum bit value is 0 and 1 for binary value, respectively, then a [0].
• If the value is 1 for both binary value, then a [1].
• By applying master key, the next session key is encrypted and then reserves all
the important information.
• Now, key administration center issues all actual session key to the user.
• Key administration center also issues quantum bits to the use.
• Key administration center also issues session key/ quantum bits to the receiver
to decrypt the messages.
Advanced RSA Cryptographic Algorithm for Improving Data Security 15

5 Conclusion

This presented algorithm is mainly used for block cipher techniques and possibly
this technique will take less time to encrypt a data of large size. It is not possible to
crack the encryption algorithm if you do not know the exact key value and this is
the main advantage of presented algorithm. I have used this algorithm for both
encryption and decryption while sending or receiving important message.

References

1. A Text book by William Stallings, data and computer communications, 6e William 6e 2005
2. Chatterjee D, Nath J, Dasgupta S, Nath A (2005) A new symmetric key cryptography
algorithm using extended MSA method: DJSA symmetric key algorithm, accepted for
publication in IEEE CSNT2011 to be held at SMVDU (Jammu) 03–06 June 2011
3. Nath A, Das S, Chakrabarti A (2010) Data hiding and retrieval. In: Proceedings of IEEE
international conference on computer intelligence and computer network held at Bhopal from
26–28 Nov 2010
4. Muhammad F, Chowdhury I, Matin MA Effect of security increment to symmetric data
encryption through AES methodology, 9th ACIS international conference on software
engineering, artificial intelligence, networking, and parallel/distributed computing. Phuket,
Thailand. 6–8 Aug 2008. https://doi.org/10.1109/SNPD.2008.101
5. Felten K An algorithm for symmetric cryptography with a wide range of scalability. In
published by 2nd international workshop on embedded systems, internet programming and
industial IT
6. Wang Y, Hu M (2009) Timing evaluation of the known cryptographic algorithms. International
conference on computational intelligence and security. Beijing, China, 11–14 Dec 2009.
https://doi.org/10.1109/CIS.2009.81
7. Nath A, Ghosh S, Malik MA Symmetric key cryptography using random key generator, vol 2,
pp 239–244

Author Biography

Mukesh Kumar (10/04/1982) has pursuing Ph.D. in Computer

Science from Himachal Pradesh University, Summer-Hill
Shimla-5. India. My research interest includes Data Mining,
Educational Data Mining, Big Data and Image Cryptography.