Efficient Algorithm for RSA Cryptosystem

Tanishq Nanda1 ,Arunakumari B N2[0000-0001-7600-2502]

1,2 BMS Institute of Technology and Management, Bengaluru 560064Karnatak India

[email protected], [email protected]

Abstract. Cryptography provides the users to hide their confidential data which
is in human readable form to a cipher text which cannot be understood by hu-
mans. With the advancement of technology data theft has become a major secu-
rity breach. It has become really important to encrypt the data before transmission
through unsecure channels. This study has proposed the use of RSA algorithm
and DNA based encoding which works together, to provide higher levels of se-
curity. The paper also explores the possibility for the proposed methodology be-
ing used in computational constrained environments.

Keywords: RSA, Cryptography, Security

1 Introduction

Cryptography is that discipline of cybersecurity which deals with the principles, means,
and methods for transforming data to hide its semantic content, prevent unauthorized
use, or detect unauthorized modification. It is the art and science of using mathematics
to secure information and create a high degree of trust in the electronic realm. The
principal purpose of cryptography is to enable secure communication over insecure
channels by encoding information into an impenetrable form. It ensures access control
by allowing only authorized parties with the correct decryption key to access encrypted
resources. There are two types of cryptography: asymmetric key cryptography, which
utilizes two different keys—public key for encryption and private key for decryption—
and symmetric key cryptography, which uses a single shared key for both encryption
and decryption.
The Rivest-Shamir-Adleman (RSA) algorithm, is an asymmetric key algorithm
which since its inception in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman,
has stood as a cornerstone in the field of cryptography. The essence of RSA lies in its
utilization of two keys: a public key, which is openly shared, and a private key, which
remains confidential to the owner. The encryption and decryption of messages as well
as the integrity and authenticity of digital signatures are made easier by this dual-key
system. Digital signatures, secure email, and creating safe connections over the internet
are just a few of the many fields in which RSA has found extensive use. The entire
foundation of the RSA method is based on the observation that, although finding the
product of two large primes is simple, factorizing the result to provide the original
primes utilized will be quite challenging.
2

In biology, DNA, which stands for deoxyribonucleic acid, is a chemical found in all
living creatures. It contains distinctive details about the species, such as genetic infor-
mation, which allows an organism to function, reproduce, and evolve. DNA is made up
of several tiny components called nucleotides. It is composed of four nucleotide bases:
adenine (A), thymine (T), guanine (G), and cytosine (C). DNA forms a double helix
structure with two strands kept together by the links produced between these bases:
adenine links to thymine, while cytosine links to guanine. The molecular makeup
DNA's structure and the connections between the bases are responsible for the various
species.

1.1 Motivation

Despite RSA’s widespread use in the industry, it suffers from performance limitations,
particularly in scenarios where demand high-throughput encryption/decryption is
needed and also in devices which have constrained computational power. As the com-
puting power increases exponentially, RSA now needs to use even longer key sizes
which becomes more computationally taxing. Thus, we have a roadblock as a result of
the security-versus-performance tradeoff. Addressing these difficulties calls for the
development of a modified RSA system that will be beneficial to both present and
emerging technologies that rely on similar algorithms for security. This paper works on
creating a bridge between the two, so that even if a small key size is chosen it won’t
create security issues and your data would be safe.

2 Survey

In this study, we reviewed the existing literature on RSA cryptography. Many of the
research publications used an array of alterations that either enhance safety or speed up
encryption and decryption, or both.
Hoyoung Yu et al. [1] proposes a modified RSA encryption that can be used by devices
with low computational power. It is difficult for wireless communication devices to
perform large calculation or to factor extremely large prime numbers required for RSA.
To address this flaw, the research study suggests a method known as True Prime Num-
ber Random Generator (TPRNG), which significantly decreases the encryption key
length. The drawback of this technology is that it will fail on systems that have no
computational limitations.
Nadia Widari Nasution et al. [2] the authors recognized the fault in RSA that it takes
time to encrypt data. To tackle this issue and boost security, they work with two alter-
native RSA versions, namely R prime RSA and multi prime RSA. The proposed meth-
odology works with three prime numbers instead of two and to minimize the value of
keys Chinese remainder theorem is put to use.
Dan Boneh et al. [3] this paper reports about three different variants namely: Batch
RSA, Multi-factor RSA and Rebalanced RSA, these were designed to speed up the
decryption process. Throughout the paper their main focus was on 1024-bit RSA mod-
ulus. Although all three variants perform well but each has one or more defects and
can’t be used widely
 3

Mingxuan Ma et al. [4] puts forward the mechanisms behind RSA and ECC and also
presents their advantages and disadvantages. The major difference between the two is
their key size, RSA uses a bigger key size than ECC. Both methods have benefits as
well as drawbacks, thus the choice is totally up to the individual user. ECC cannot re-
place RSA, despite its smaller key size, because it requires a certain environment to
function.
Abderrahmane Nitaj et al. [5] this research paper makes a detailed analysis of Murru-
Saettone variant of the RSA cryptosystem which uses cubic pell equation as key equa-
tion. During the analysis researchers found that cubic pell equation variant is much
more insecure than the traditional RSA. One more disadvantage of this algorithm is that
if a user who is not careful enough while generating the keys, it would result in a total
breakdown of the cryptosystem.
Michael N. John et al. [6] researchers of this paper focus primarily on the mathematical
aspect of RSA algorithm. The paper explores the number theory foundations that un-
derpin the popular RSA cryptographic technique for secure communication. It covers
fundamental number theory principles like as division, greatest common divisor, prime
factorization, and modular arithmetic, which provide the mathematical foundation of
RSA encryption and decryption. This is also its drawback because the paper only talks
about the mathematical part and security part is altogether neglected.
Osama Fouad Abdel Wahab et al. [7] this paper proposes a methodology in which a
hybrid data compression algorithm which increase the input data to RSA. This increases
the security level of RSA and also helps in performing lossless compacting steganog-
raphy. The primary drawback in this methodology would be that it would require a
greater amount of time over the traditional RSA as it is implementing three algorithms.
Steganography in itself is not considered too secure and is generally avoided.
O Sarjiyus [8] researchers focused on modifying the public key in RSA to improve its
performance and security. The papers describe how to design a RSA technique that has
faster key generation and raises the security level of RSA by using ‘e’ and ‘f’ transfor-
mation. Although it offers security advantages, it additionally comes with some draw-
backs, such as the fact that it takes more time to encrypt data, so the time complexity is
slightly greater than the original RSA. The algorithm trades off time for greater security
objectives.

3 Proposed Methodology

3.1 DNA based RSA algorithm

In this paper we have proposed algorithm that works on two principles namely RSA
and DNA based data hiding technique. Let e,d,n be positive integers. In the initial steps
we’ll convert plain text(M) to cipher text(C) using RSA. Firstly, we’ll choose two dis-
tinct prime numbers p and q respectively. Next, we calculate n which is just the product
of p and q, n would be useful in later steps. Now we find 𝜙(𝑛) which is a product of
(p-1) and (q-1).
4

𝑛=𝑝∗𝑞
𝜙(𝑛) = (𝑝 − 1)(𝑞 − 1)
After computing this we find an integer e, which would work as public key, e should
be such that 1<e< 𝜙(𝑛) and e is also coprime with 𝜙(𝑛) which means gcd (e, 𝜙(𝑛))=1.
In the next step we compute the private key d. To compute d, we use multiplicative
inverse of e. Thus we get our key pairs public key pair (e, n) and private key pair (d, n).
𝑑 = 𝑒 −1 (𝑚𝑜𝑑 𝜙(𝑛))
Last step is encryption which is done by raising M to eth power and modulo n and
we’ll obtain cipher text(C). To decipher we raise the cipher text to the power d and
modulo n, this’ll will return us the original text.

𝐶 = 𝑀𝑑 (𝑚𝑜𝑑 𝑛)
𝑀 = 𝐶 𝑑 (𝑚𝑜𝑑 𝑛)

The cipher text(C) from RSA will be fed as plain text in the DNA hiding technique.
Let us consider C from RSA as F for better understanding in this algorithm. For this
technique we’ll first need two keys namely K1 and K2. K1 is a number in the range 0
to 255 and will be used to XOR the last character of the message: this result would then
be XORed with the character preceding the last one in M. K2 on the other hand is
randomly generated and will be used to divide DNA sequence into segments of same
length. The resulting characters are pushed as binary bits at the beginning of each seg-
ment. Using Table1 each segment is converted into DNA bases.
The encryption process for proposed methodology is as follows:
Split F into characters F=f1,f2,f3,…fn, and each character is converted into its 8 bit
binary equivalent.
Process K1 by randomly generating a number between 0 and 255 and then convert it
to its 8-bit binary equivalent.
Last character from F is XORed with K1
The character preceding the last one in F is XORed with the result from previous
step
A random DNA sample is selected in converted to binary bit sequence using Table1.
Generate a random number which would act as K 2, it’ll be used to divide the DNA
binary sequence into smaller segments.
Now just concatenate both the binary sequence. Convert the resulting binary se-
quence to DNA form using Table1.
We will refer to Table 1: DNA digital conversion, whenever we want to convert
DNA to binary system or vice-versa which is a crucial step during encryption and de-
cryption process.
 5

DNA Nucleotide Decimal Binary

A 0 00
C 1 01
G 3 10
T 3 11
Table 1 DNA digital conversion

For the decryption process the receiver must know K 1 and K2 to decrypt the cipher
text.
Firstly, convert the fake DNA into a binary sequence using Tavle 1.
Divide this binary sequence into segments of size K2+1
Gather the first bits from each of the segment, concatenate them together to get a
new binary sequence let’s say G.
XOR the first 8 bits of G with K1 and then XOR the next 8 bits of G with the previous
8 bits. Repeat the process till the end.
Next it converts the bits of the DNA sequence into text value.
Lastly push this text to RSA algorithm for decryption and you’ll get your plain text.
Refer Figure 1 to understand the working of the proposed system.

Fig 1 block diagram of proposed methodology

4 Result and Analysis

The proposed system improves RSA encryption as DNA hiding method provides
lower cracking probability than existing system. The possibility of an intruder to crack
the DNA code is really low and thus adds and extra layer of security.
We refer to table 2 for a much better comparison of existing systems with our proposed
system.
6

Scholarly investigations Existing System Proposed Systems

Hoyoung Yu et al. This system is used only Proposed system is suita-
(2020)
for IoT devices and not ble for both IoT devices
on PCs and PCs
N. W. Nasution et This technique has in- This methodology
al. (2020) creased time and space doesn’t burden the com-
complexity puter
D. Boneh et al. Multiple public keys and System only needs basic
certificates are needed set of keys
M. Ma et al. (2022) Special environment is System is able to work in
needed to implement any environment, no spe-
ECC cial requirements
A. Nitaj et al. (2022) Insecure and might No such defects are ex-
sometimes break down. pected in proposed meth-
odology
M. N. Jogn et al. Focuses primarily on This system was pro-
(2023) mathematical aspects and posed with keeping both
not on the security aspect mathematics and security
in mind
O. F. A. Wahab et al. RSA encryption and Proposed methodol-
(2021) compression techniques ogy is not as intensive as
are computationally in- RSA, Huffman coding
tensive and DWT
O. Sarjiyuset et al. The encryption takes System does not re-
(2020) significantly longer than quire such amount of
usual time.
Table 2 Comparison of existing algorithms and proposed algorithm
 7

5 Conclusion

This paper proposes an improved technique to the standard RSA algorithm. In the pro-
posed methodology the cipher obtained after RSA encryption is hidden within a DNA
strand which increases the security level of the confidential data. The system boasts of
lower penetration as compared to other encryption techniques. Repeated XORing adds
another layer of security which is difficult to guess as to how it was performed. Due to
the added security, we can use smaller keys in RSA which can be used by devices with
computational constraints.

References
1. Yu, H.; Kim, Y. New RSA Encryption Mechanism Using One-Time Encryption Keys and
Unpredictable Bio-Signal for Wireless Communication Devices. Electronics 2020, 9, 246.
https://doi.org/10.3390/electronics9020246
2. Nasution, Nadia Widari, and Syahril Efendi. "Analysis of RSA variants in securing mes-
sage." 2020, In IOP Conference Series: Materials Science and Engineering, vol. 725, no. 1,
p. 012131. IOP Publishing.
3. Boneh, Dan, and Hovav Shacham. "Fast variants of RSA." 2002 CryptoBytes 5, no. 1: 1-9.
4. M. Ma, "Comparison between RSA and ECC," 2021 2nd International Seminar on Artificial
Intelligence, Networking and Information Technology (AINIT), Shanghai, China, 2021, pp.
642-645, doi:10.1109/AINIT54228.2021.00129.
5. Nitaj, Abderrahmane, Muhammad Rezal Bin Kamel Ariffin, Nurul Nur Hanisah Adenan,
Terry Shue Chien Lau, and Jiahui Chen. "Security issues of novel RSA variant." 2022, IEEE
Access 10: 53788-53796.
6. John, Michael N., Ogoegbulem Ozioma, Victor Obukohwo, and Henry Etaroghene Eg-
bogho. "NUMBER THEORY IN RSA ENCRYPTION SYSTEMS." 2023, GPH-
International Journal of Mathematics 6, no. 11: 07-16.
7. Wahab, Osama Fouad Abdel, Ashraf AM Khalaf, Aziza I. Hussein, and Hesham FA Hamed.
"Hiding data using efficient combination of RSA cryptography, and compression steganog-
raphy techniques." 2021, IEEE access 9: 31805-31815.
8. Sarjiyus, O. "Enhancing RSA Security Capability Using Public Key Modification." Interna-
tional Journal of Research and Scientific Innovation 7, no. 9 (2020): 10-15.