Enhancing Cloud Security through a Blend of Symmetric and

Asymmetric Cryptography Methods

Akshay Sharma
M.E. CSE(CC), Chandigarh University, Mohali, Punjab, India
Dhawan Singh
CSE-APEX & UCRD, Chandigarh University, Mohali, Punjab, India
ABSTRACT: In the cloud services business, ensuring cloud computing security of key concern.
Protecting data a shared cloud environment and offering dependable and secure services neces-
sitate a strong encryption solution with little performance effect. This research presents an effi-
cient cryptographic strategy to improving cloud security while reducing performance effects.
Complex encryption methods do not lend themselves to the cloud’s emphasis on processing
speed. As a consequence, for encryption and key security, this approach combines an upgraded
Blowfish technique with an elliptic curve-based method, resulting in greater security and effi -
ciency. For data integrity, a digital signature mechanism is also utilized. The evaluation shows
that factors such as throughput, execution time, and memory use have improved.

1 GENERAL INSTRUCTIONS

Many companies, as well as individuals, use cloud computing services including Infra-
structure as a Service , Software as a Service , and Platform as a Service. Cloud comput-
ing allows for the delivery of high-performance services in a location-independent man-
ner by combining computer resources and activities. [1]. Convenience notwithstanding,
cloud computing presents security risks, including the possibility of impersonation, data
interception, authentication breaches, and resource manipulation intrusions.[2]. Because
of the open sharing of resources and services across networks, these security problems are espe -
cially important in the area of cloud computing. Furthermore, the distant storage of user data in
third-party facilities emphasizes the significance of security [3, 4]. Therefore, it is crucial to
utilize cryptographic techniques to encrypt user data in order to safeguard data security
and integrity and to prevent unauthorized access. Numerous cloud service types, public,
private, and hybrid clouds, as well as other cloud computing deployment patterns, have
all used various cryptographic methods to protect data [5]. As a result, governments and
cloud service providers offer several concurrent services for vast volumes of data; in
particular, security becomes essential and ensuring data integrity becomes a significant
issue when working with large amounts of data.
[6]. As a result, that’s critical to develop creative strategies that enhance security while having a
minimum influence on performance and a short execution time [7]. However, due to the com-
plexity of cryptographic methods and their propensity to burden processes and the cloud envi-
ronment, particularly when it comes to data in transit, there is an urgent need for more stream -
lined encryption solutions that have the least impact on performance. These solutions ought to
preserve high standards of security or data protection while offsetting any detrimental effects on
services. Thus, the hybrid cryptography method presented in this research is based on an
enhanced version of the Blowfish algorithm. The third section of the document exam-
ines the unique technique, and the second section gives a summary of the study context.
After examining the proposed solution in detail in the fourth section, the paper con-
cludes with a review of the earlier discussions.

Research Background

Several research projects have been conducted due to the critical nature of security in
cloud computing. AbdElminaam [8], for example, introduced a hybrid cryptography
technique that combines AES (Advanced Encryption Standard) and Blow-fish. They
claim that cloud security is significantly increased when symmetric and asymmetric
techniques are combined. Their results show higher throughput and faster encryption
when compared to previous approaches, such as the Rivest-Shamir-Adleman combo of
RSA and AES [9]. Data is encrypted using a 128-bit block cipher and key in a lightweight
cryptographic approach presented by Thabit and colleagues [10] to improve cloud computing
security. Increase encryption complexity, they used Feistel and substitution permutation archi-
tectural approaches. This technique is adaptable in terms of secret key length and encryption
turns, resulting in fast encryption. While these technologies improve security and reduce en-
cryption time, one disadvantage is the requirement for key sharing, which compromises data
confidentiality and the result, overall cloud security. In study [11], multiple cryptographic ap-
proaches were used to improve cloud computing security. For safeguarding client-cloud storage
system connections, their solution incorporates AES-based encryption or asynchronous key
mech, as well as Elliptic curve cryptography. The suggested technique uses chaotic cryptogra-
phy to creating key rendomly. Nonetheless, it appears that the proposed approach did not take
into account the time necessary for data splitting and merging. However, other research projects
look into different techniques to improving cloud computing security. For example, Esposito
and colleagues [12] argued for the use of blockchain to improve cloud computing security. In
their blockchain-based design, the new data block is generated or distributed to all net-
work peers, and it joins the chain once it is approved by the majority of peers. Because
blockchain has built-in security, this approach can offer cloud computing a high degree
of safety. The blockchain-based approach has a number of disadvantages in addition to
some benefits, such as strong data integrity (data stored inside the chain is immutable).
For instance, it can run counter to data protection laws like the GDPR, which mandate
setting data retention limits and keeping private, sensitive information for the "shortest
time possible."[13, 14].Furthermore, because it requires consent from a majority of peers, un-
doing unwanted changes or fixing errors becomes impossible. Another drawback is that
blockchain is built primarily for little transactional data, making it insufficient for safeguarding
massive amounts of cloud computing data, such as large picture files. In a research, the perfor-
mance and efficancy of several symmetric cryptographic algorithms were evaluated, taking into
account aspects such as execution time and memory utilization [15]. According to their re-
search, Blowfish and DES perform better than other algorithms in terms of memory usage and
encryption/decryption times. The most significant and effective cryptographic methods for guar-
anteeing cloud computing security have been the subject of several research [5, 16]. The results
of these earlier research show how innovative cloud computing solutions are needed to boost se-
curity without negatively affecting performance. This way, cloud computing security may be
strengthened without compromising its services.

2 PROPOSED SOLUTION

The suggested method is a practical strategy that makes use of many cryptographic data pro-
tection approaches. It combines symmetric and asymmetric encryption, as well as an improved
dig. Sign. technique that uses the MD5 hashing fun.to assure data integrity. It is critical to eval -
uate the algorithms’ encryption speed and strike a compromise b\w performance and speed.
Asymmetric key generation methods, such as public keys, take longer to generate than symmet-
ric approaches like Blowfish, resulting in slower processing. Asa result, given the symmetric
key generation nature of the Blowfish technique, we use an upgraded Blowfish algorithm for
data encryption in this approach. The answer is depicted at a high level in Figure 1. To begin,
the original data’s MD5 hash code is created as a validation measure for data integrity. Follow-
ing that, an Elliptic Curve (EC) technique is used to generate a digital signature, assuring the se-
curity of both the MD5 code and the private key. Our objective is to provide a high level of se-
curity while

Fig1. Proposed Solution High-Level Diagram

limiting the lengths of key and the hash code, hence reducing the Elliptic Curve (EC) execution
time. An improved version of the asymmetric Blowfish technique, which is renowned for its
speedy encryption and decoding process, is used to encrypt the original data. Each component
of the solution will be covered in more detail in the upcoming sections.

2.1 e-signature
Type In this work, we used a combination of a digital signature and a hashing mechanism to en -
sure the data’s integrity. Recognizing the first digital signature model’s vulnerability to attack-
ers, we devised an alternative technique. The message is first hashed, and then the resultant
hashed message is signed. This method prevents bad actors from creating a counterfeit digital
signature by manipulating the verification process. As a result, the approach prohibits attackers
from forging a bogus signature that corresponds to the hashed message. As a result, the attacker
is unable to change or compromise the message’s content [17]. Figure 2 depicts the proposed
solution’s sequential procedure, which includes a digital signature and hash code.

2.2 Data Encryption

Purpose of research is to present a safe cryptography of the method recognized for its speedy
execution and strong data processing capabilities. The core of data encryption is based on an up-
dated Blowfish technique, which provides key length flexibility ranging from 32 to 448 bits and
employs numerous pre-computed subkeys [18]. Data encryption/decryption requires the pre-
computation of these subkeys. It’s worth mentioning that the Blowfish method outperforms
other algorithms and has a smaller memory footprint. The operation includes the use of four 256
S-BOXes, which hold a total of 1024 32-bit entries. More precisely, The first byte of the
first 32-bit entry identifies an entry in the first S-BOX, the second byte identifies an
entry in the second S-BOX, and so on (an adaptation of the Blowfish approach). This
pattern is followed by the decryption process, which starts with the ciphertext as input
and uses the subkeys in the opposite order. To make the algorithm better, we want to re-
duce the time it takes to execute. In the conventional Blowfish configuration,

Fig.3. Blowfish has an F-Function

Fig. 2. Hash-Code and Digital Sign Fig. 4. Enhanced F-Function Module.

Equation (1) is used to calculate the value of the Ffunction.

• F (XL) = ((S1, a + S2, bmod2 32) XORS3, c) + S4, dmod2 32(1) WecanchangetheF − function-
toequation(2), F ′ (XL) = (S1, a + S2,bmod32)(S3, c + S4, dmod232)
This modification enables us to simultaneously perform the addition operations

(S1, a + S2, bmod2 32)

and

(S3, c + S4, dmod232).

This concurrent procedure reduces execution time by basically combining the time required for
two tasks into a single one. Given that Blowfish has 16 rounds, this change is expected to lower
the execution time for encryption and decryption methods in half. It is critical to stress that this
change will not jeopardize the algorithm’s security because Blowfish’s security is inextricably
related to its encryption keys. The graphical depiction of this adjustment is shown in Figure 4.

Some Example of Pseudocode:

Here’s a pseudocode representation of Blowfishalgo., incorporating the enhanced F-fun.

Initially, the 64-bit entry is divided into two 32-bit segments, referred to as the left (L)
and right (R) components. Subsequently, the first 32-bit block (L) undergoes an XOR
operation. The computed 32-bit data is then sent to the F-function and XORed with the
second 32-bit block (R). The L and R segments are then switched for use in the Blow-
fish algorithm's subsequent rounds. During the decryption process, this sequence is re-
peated, with the exception that P1, P2, and P18 values are used out of order. One per-
forms an XOR operation on the initial 32-bit block (L). In the third step, the computed
32-bit data is then sent to the F-function for XOR with the other 32-bit block (R). Fol-
lowing that, the assignments of L and R are switched for use in subsequent rounds the Blowfish
algorithm. The decryption procedure is similar to this one, with the exception that the values of
P1, P2, and P18 are used in reverse order.

Element, x.

Divide x into two 32-bit halves: xL, xR

For i = 1 to 16:

xL = xL XOR Pi

xR=F(xL) XOR xR

Swap xL and xR

Next i
Swap xL and xR

xR=xR XOR P17

xL=xL XOR P18

Recombine xL and xR

Function F

Divide xL into four eight-bit quarters: a, b, c and d

F(xL)=(S1,a+S2,b mod 232) XOR (S3,c+ S4,d mod 232)

2.3 Protecting the Symmetric-Key

Because symmetric-key algorithms—like Blowfish—need the transfer of a private key, they are
susceptible to interception and theft by adversaries, especially through man-in-the-middle at-
tacks. We employ an asymmetric encryption method based on elliptic curves to secure the hash
code and the private key in order to get around this problem. Compared to competing options,
this approach performs better since it uses a 164-bit key [19]. Strong security is provided by el-
liptic curve-based encryption algorithms, which use minimal memory and bandwidth [20]. This
encryption technique has a significant benefit in that it applies cryptography over finite fields,
providing “p” isa prime integer and the finite field consists of numbers fewer than “p”. More in-
formation on the two-dimensional Elliptic curve (E) will be provided later.

If p>3 is prime odd and 𝑎𝑎, ∈ 𝐹𝐹𝑝𝑝 and the 4𝑎3 +27𝑏2 ≠ 0 mod 𝑝𝑝, then the Elliptic curve
E(Fp) is equal To equation (3)

𝑦2= 𝑥2+ 𝑎x + b

(3)

Using element Q, which can create group in the E(Fp)

and considering p=(x1,y1) and {𝑝𝑝,𝑄} ∈ 𝐸(𝐹𝐹𝑝)

For point adding 𝑃 + 𝑄 = (𝑥3, 𝑦3)𝑎 𝑎𝑛𝑑 𝑃 ± Q

𝑥3= 𝜆2 − 𝑥1− 𝑥2

𝑦3= 𝜆(𝑥1− 𝑥3) − 𝑦1, 𝜆 = (𝑦2− 𝑦1)/(𝑥2− 𝑥1)

For point doubling 𝑃 + 𝑃 = 2𝑃(𝑥3, 𝑦3)

𝑥3= 𝜆2− 2𝑥1, 𝑦3= 𝜆(𝑥1− 𝑥3) − 𝑦1, 𝜆 = (3𝑥12 + 𝑎)/2𝑦1

Six addition operations, one squaring operation, two multiplications, and one inverse
operation are needed in Fp to add two unique points on an elliptic curve. Similarly,
eight additions, two squaring operations, two multiplications, and one inverse operation
are required to double a point on the elliptic curve.
In elliptic curve cryptography, the private key is initially chosen at random ("k") from a
predefined field range. Next, the procedure Q=kP is used to find the public key "Q,"
where "P" is a point on the elliptic curve. The complexity of the discrete logarithm is-
sue, which makes it challenging to compute "k" from known "P" and "Q" locations, is
the foundation for the security of elliptic curve encryption. The scalar multiplication
method serves as the basis for this strategy.

Q = k.P = P + P + ... + P (4)

The field-based operations in this technique, which employ Modular Multiplication, sig-
nificantly improve elliptic-curve encryption efficiency. The process flowchart is shown
in Figure 5, and the ensuing sections provide a detailed explanation of each step.
1. To increase the effectiveness of digital signature and data integrity verification, we
use MD5 to create a hash code before encrypting.
2. The digital signature for the contents is then produced by encrypting the hash code
using the private key after that.
3. Therefore, elliptic-curve cryptography is used to encrypt the Blowfish private key.

4. The Blowfish symmetric cryptographic algorithm is used to encrypt the data. To pro-
tect the original data, a sym-metric key is employed. The encrypted data from this pro-
cess as well as the ones from the previous one are then sent.
5. When the recipient receives the data, they use the matching private key and a reverse
procedure to decrypt it.
6.The original data is deciphered using the Blowfish algorithm’s unique private key. Following
that, a verification and validation method is carried out using the hash function, which also
serves as a digital signature.

7. The contents are then produced with a digital signature after the hash code is encryp-
ted with the private key.

3 EVALUATION AND DISCUSSION

We used the Eclipse platform and the Java Development Kit (JDK) version 7 to implement the
proposed solution. The Java Cryptography Architecture (JCA) and the Java Cryptography Ex-
tension (JCE) are two Java Cryptography libraries included in the JDK. While JCA

Fig. 5. Flowchart of the Proposed Solution

meets basic cryptographic requirements, JCE adds more complex cryptographic features. The
gear used to evaluate the solution included an Intel Core2 Duo CPU operating at 2.5 GHz. All
tests were carried out on a Windows 7 machine. We thoroughly compared our proposed tech-
nique against algorithms such as AES, 3DES, DES, and RSA in terms of memory use, data
transmission speed, and processing length [21]. To understand how the system functions in vari-
ous settings, we first tested its efficiency with modest data amounts (50 KB).

3.1 Evaluation Results - Throughput and Execution Timing

In initial evaluation entails reviewing a 50 KiloBytes dataset. This indicates that the addition of
the fast Blowfish algorithm and modifications to the F function led to an increase in the simpli-
city of the encryption process. This indicates that the addition of the fast Blowfish algorithm
and modifications to the F function led to an increase in the simplicity of the encryption process.
It also had little effect on execution time because the main goal of the asymmetric EC
technique was to encrypt and digest the key. Using a 50 KB dataset, Figure 7 shows the
performance evaluation of various methods. It is shown that in terms of throughput, our
suggested method performs better than the alternatives. Recognizing that data size may af-
fect how rapidly it can be handled, we decided to hype the data size by 1024 KiloBytes to con-
duct a more complete test of the solution’sRecognizing that data size may affect how rapidly it
can be handled, we decided to hype the data size by 1024 KiloBytes to conduct a more complete
test of the solution’s
Fig. 6. Time to Execution with 50KB Data

Fig. 7. Data throughput of 50KB

performance with bigger datasets. As shown in Figure 8, our proposed solution consistently out-
performs previous methods in terms of processing time, even with the larger 1024 KB dataset-
With respect to symmetric algorithms like AES-DES and 3DES, the proposed approach (dubbed
“Hybrid”) lowered processing times by 230, 230, and 130 milliseconds, respectively. It also out-
performed the asymmetric technique RSA by 731 milliseconds.
Fig. 8. Time to Execution with 1024KB Data

Fig. 9. Data throughput of 1024KB

When compared to competing ways, this emphasizes the suggested method’s superior speed.
Figure 9 depicts the data transfer speeds of several ways, including our recommended solution,
while dealing with 1024 KB data. As can be seen, our suggested approach has improved data
transfer rates, which is expected given its shorter processing time. The solution’s data trans-mis-
sion rate exceeds symmetric methods (AES, 3DES, and DES) on average by 16, while it outper-
forms the asymmetric algorithm RSA by more than 50. In the last stage, we evaluate the se-
lected algorithms using a data set of 2049 rows. Figures 10 and 11 show the processing time and
data transmission rate findings. It is critical to emphasize that increasing data size invariably re-
sults in longer processing times. Nonetheless, our suggested method routinely outperforms
DES, 3DES, and RSA in terms of processing time. The processing time is 470 millisecond
faster than 3DES, 320 millisecond faster than DES, and 670 milliseconds faster than RSA. By
this, it is critical to note that the processing time of our suggested approach does not outperform
AES. The slight increase in processing time, especially in the context of cloud comput-
ing, is likely to be disregarded, though, when other advantages like digital signatures
and hashing are taken into account. In order to determine whether the benefits indicated
above outweigh the little processing time difference when compared to AES, future re-
search should focus on examining the performance of the suggested technique in the
field of cloud computing, especially with larger datasets. As shown in Figure 11, our sug-
gested technique outperforms DES, 3DES, and RSA in terms of data transmission speeds. Our
modifications to the F-function, the key component of Blowfish encryption that enables
parallel processing, are what give this improvement. Additionally, this method allowed
us to use Blowfish and EC simultaneously without appreciably affecting processing
times or data transfer rates because we separated the data encryption and key encryp-
tion. The EC encryption is only used to encrypt tiny-sized private key hash codes, hence it has
Fig. 10. Execution Time with 2048KB Data

a modest influence on processing time. Additionally, the larger original information is en-
crypted using the most recent version of the Blowfish technology, which is renowned
for its efficiency and speed. To improve cloud security, numerous studies have created
hybrid and multilayer encryption systems or improved cryptographic algorithms [7, 22–
26]. On the other hand, our suggested approach has the advantage of using both sym-
metric and asymmetric algorithms in addition to a digital signature. These algorithms
work together to build a robust defense for data security, guarantee the integrity of di-
gital signatures, and enable quick encryption, all while modifying Blowfish's F-func-
tion.
However, like with previous cloud security techniques, our suggested solution need consider-
able testing and assessment in large datacentric cloud computing settings.

B. Consumption of Memory

Memory usage is an important factor to consider when evaluating encryption algorithms. Figure
12 depicts the memory use in our proposed strategy, with comparisons to existing methods.
Most notably, our suggested method uses less RAM than the alternatives. A number of
factors, such as the quantity and type of operations, key size, and initialization vectors,
influence memory utilization. [21]. It’s important to note that our memory usage tests were
only run with 50KB data. The inclusion of the memory-efficient Blowfish algorithm, acknowl-
edged as one of the most effective encryption algorithms in terms of memory efficiency [21],
results in reduced memory consumption in our proposed approach. Furthermore, the changes
made to Blowfish’s core structure as part of our proposed strategy contribute to this decrease in
memory consumption [27], it is well-suited for infrastructures with limited memory capacity,
such as older systems.
Fig. 11. Data throughput of 2048KB

Fig. 12. Memory Utilization

4 CONCLUSION

This study provided a novel cryptographic framework intended to deliver high-performance and
efficient cloud computing security. This technique is based on an enhanced version of Blowfish,
a symmetric method that drastically reduces encryption time. As a result, the solution’s process-
ing time and data transmission rates have both improved. Furthermore, the use of the EC asym-
metric cryptography algorithm for key encryption attempts to solve security vulnerabilities usu-
ally associated with symmetric key exchange systems, such as key theft during transit. To fur-
ther guarantee the integrity of the da-ta, the recommended technique includes digital
signatures based on MD5. The evaluation's conclusions demonstrate that the approach
offers a notable improvement over RSA, AES, DES, and 3DES. Symmetric crypto-
graphy is the best method for encrypting and decrypting big amounts of data because of
its effectiveness and speedy processing. When symmetric algorithms are used to protect
data confidentiality, information sent inside the cloud architecture can be quickly and
efficiently secured. Nevertheless, the handling of symmetric keys brings about inherent vul-
nerabilities, requiring a delicate equilibrium between performance and security considerations.
In terms of throughput, memory consumption, and processing time, the proposed method sur-
passes its competitors on average. It’s worth noting that when we raised the data amount, AES
became marginally quicker with higher throughput. We propose that future research efforts per-
form experiments in diverse infrastructures, with a particular emphasis on cloud computing sys-
tems that manage large amounts of data. Symmetric cryptography, characterized by its effi-
ciency and quick processing, is well-suited for encrypting and decrypting extensive datasets.
Employing symmetric algorithms to ensure the confidentiality of data enables rapid and re-
source-effective protection of information transmitted within the cloud infrastructure. Neverthe-
less, the administration of symmetric keys presents inherent risks, demanding a meticulous
equilibrium between performance and security considerations.

REFERENCES
[1] Subramanian and A. Jeyaraj, “Cloud computing security challng.”, Computer Elect. Engi

neering, vol. 71, pp28-42, 2018.

[2] H. Tabrizchi and M..Rafsanjani, ” A assessment of cloud security challenges: concerns,

threats, and solutions ,” The journal of super-computing, vol. 76, no. 12, pp. 9493-9532,
2020.

[3] Z. Balani and H. Varol, “Cloud Computing Security Challng and Threats,” in 2020 8th In

ternational Symposium on Digital Forensics and Security (ISDFS), 2020: IEEE, pp. 1-4.

[4] A. Orobosade, T. Aderonke, A. Boniface, and A. J. Gabriel, “Cloud appli. security using

hybrid encry.,” Commu.,vol. 7, pp. 25-31, 2020.

[5] Agarwal, A. K. Kaushal, and L. Chouhan, “ Survey on Cloud Computing Security Issues
and

Crypto. Techniques,” in Social Networking and Computational and the Intelligence:

Springer, 2020, pp. 119134.

[6] Ray, K. N. Mishra, and S. Dutta, “Big Data Security Issues from the Perspective of IoT and

Cloud Compu-ting: A Review,” Recent Advt. in Computer Science and Communications,

vol.12, pp. 1- 00, 2020.

[7] Sajay, S. S. Babu, and Y. Vijayalakshmi, “Enhancing the security of cloud data using hy -
brid

encryption algorithm,” Journal of Ambient Intelligence and Humanized Computing, pp. 1-

10, 2019.

[8] D. S. Abd, “Improving the security of cloud computing by building new hybrid crypto.

Algo.,” Int. Journal of Electronics and Info. Engineering, vol. 8, no. 1, pp. 40-48, 2018.

[9] R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital sign. and public-
key

cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120-126, 1978.

[10] F. Thabit, Alhomdy, A. H. Al-Ahdal, and Jagtap, “new lightweight cryptographic algo-
rithm

for enhancing data security in cloud computing,” Global Transitions Proceedings, vol. 2,
no.

1, pp. 91- 99, 2021.

[11] Hussain, C. Xu, and M. Ali, “Security of cloud storage system using various cryptographic

techniques,” Int. J. Math. Trends Technol, vol. 60, no. 1, pp. 45-51, 2018.

[12] Esposito, A. De Santis, G. Tortora, H. Chang, and K.-K. R. Choo, “Blockchain: A panacea
 for healthcare cloud-based data security and privacy? ,” IEEE Cloud Computing, vol. 5,
no.

1, pp. 31-37, 2018.

[13] EC. ”For how long can data be kept and update it?” https://ec.europa.eu/info/law/law-

topic/dataprotection/reform/rulesbusiness-and-organisations/principlesgdpr/how-long-

can-data-be-keptand-it-necessary-update-iten (accessed 18/05/2021, 2021).

[14] ICO. ”Principle (e): Storage limitation.” https://ico.org.uk/fororganisations/guide-to-data-

protection/guideto-the-gen.-dataprotection-regulation-gdpr/principles/storagelimitation

(accessed 18/05/2021, 2021).

[15] A. R. Wani, Q. Rana, and N. Pandey, “Performance Evalua-tion and Analysis of Advanced

Sym. Key Crypto. Algo. for Cloud Computing Security,” in Soft Computing: Theories and

Appli.: Springer, 2019, pp. 261-271.

[16] KALPANA, ”A SURVEY ON CRYPTO- ALGORITHM FOR DATA SECURITY IN

CLOUD STORAGE ENVIRONMENT,” European Journal Molecular Clinical Medicine,

vol. 7, no. 09, p. 2020.

[17] Ahmed, ”A brief review: security issues in cloud computingand their solutions,” Telkom

nika, vol. 17, no. 6, 2019.

[18] R. Asassfeh, M. Qatawneh, and F. M. AL-Azzeh, “Performance evaluation of blowfish

algo.

on supercomputer iman1,” International Journal of Computer Networks Communications

(IJCNC), vol. 10, no. 2, 2018.

[19] Chandra, S. Paira, S. S. Alam, and G. Sanyal, “A comparative survey of sym. and asy. key

crypto.,” in 2014 international conference on electronics, communication and computa -

tional

engineering (ICECCE), 2014: IEEE, pp. 83-93.

[20] Wollinger, J. Pelzl, V. Wittelsberger, C. Paar, G. Saldamli, andC¸ . K. Koc¸, ”Elliptic and

hyper elliptic curves on embedded P,” ACM Transactions on Embedded Computing Sys -
tems

(TECS), vol. 3, no. 3, pp. 509-533, 2004.

[21] Patil, P. Narayankar,Narayan, and S. M. Meena, ”A comprehensive evaluation of crypto

graphic algorithms: DES, 3DES, AES, RSA and Blowfish,” Procedia Computer Science,

vol. 78, pp. 617624, 2016.

[22] A. PanimalarS, N. D, R. Aiswarya, and P. Shailesh, “CloudData Security Using Elliptic

 Curve Cryptography,” 2017.

[23] V. K. R. Gangireddy, S. Kannan, and K. Subburathinam, ”Implementation of enhanced

blow

fish algo. in cloud environment,” Journal of Ambient Intelligence or Humanized Compu

ting, pp. 1-7, 2020

[24] U. Gupta, M. S. Saluja, and T. Tiwari, ”Enhancement of Cloud Security and removal of
anti-

patterns using multilevel encry. algorithms,” International Journal of Recent Research As

pects, vol. 5, no. 1, pp. 55-61, 2018.

[25] A. Chauhan and J. Gupta, ”A novel technique of cloud security based on hybrid encry. by

Blowfish and MD5,” in 20174th International conference on signal processing, computing

and control (ISPCC), 2017: IEEE, pp. 349-355.

[26] V. Saranya and K. Kavitha, ”A modified blowfish algorithm for improve the cloud secu-
rity,”

Elsiyum J, vol. 4, no. 3, pp. 1-6, 2017.

[27] D.M and D.Yadav, ”Performance of Analysis of RSA and Elliptic Curve Crypto,” IJ Net.

Security, vol. 20, no.4, pp. 625-635, 2018