# Secure and Efficient Data Storage Operations by Using Intelligent Classification Technique and RSA Algorithm in IoT-Based Cloud Computing

Authors: Faiqa Sajid; Muhammad Abul Hassan; Ayaz Ali Khan; Muhammad Rizwan; Natalia Kryvinska; Karovič Vincent; Inam Ullah Khan
Journal: Scientific Programming
 (2022)

---

## Abstract

In mobile cloud services, smartphones may depend on IoT-based cloud infrastructure and information storage tools to conduct technical errands, such as quest, information processing, and combined networks. In addition to traditional finding institutions, the smart IoT-cloud often upgrades the normal impromptu structure by treating mobile devices as corporate hubs, e.g., by identifying institutions. This has many benefits from the start, with several significant problems to be overcome in order to enhance the unwavering consistency of the cloud environment while Internet of things connects and improves decision support system of the entire network. In fact, similar issues apply to monitor loading, resistance, and other security risks in the cloud state. Right now, we are looking at changed arrangement procedures in MATLAB utilizing cardiovascular failure information and afterward protecting that information with the assistance of RSA calculation in mobile cloud. The calculations tried are SVM, RF, DT, NB, and KNN. In the outcome, the order strategies that have the best exactness result to test respiratory failure information will be recommended for use for enormous scope information. Instead, the collected data will be transferred to the mobile cloud for preservation using the RSA encryption algorithm.


---

## Body

## 1. Introduction

Advancements in smart world have upgraded every industry. Intercommunication is the problem where desired results need to be obtained from implementing line models. Today’s modern industry is comprised of complex system models which intend to improve over-all process. Sustained advancement in such industry required reliability and efficiency to Decision Support Systems (DSSs) [1].The Internet is regarded as the most important invention since it allows users to make inter- and intra-connections among conventional and portable devices using various protocols [2]. Internet of things has newly emerged in last few decades. A large number of devices generate data in IoT environment and forward it for further processing. Main problem faced by devices attached with IoT environment is security which is not properly considered during manufacturing. Moreover, these devices have limited memory, and data generated by each device are doubled of its memory size. IoT-based cloud computing is the integrated to process huge amount of data. Figure 1 briefly describes the merger of IoT and cloud computing to enhance the decision support system.Figure 1
IoT-based cloud environment for the optimal decision support system.IoT-based cloud computing technology is providing the best possible practices which are focused on market research [3].Cloud computing usually provides tools as entities on call, snappy transmission, and charge as a need to enhance user service. This technology offers utilities which include Platform as a Service (PaaS), Infrastructure as a service (IaaS), and Software as a service (SaaS). It is most continent way to provide computation services and can be accessed remotely [4]. In addition, the primary focal points are (i) offering on-demand solutions, (ii) compensation as invoice, and (iii) administration limits [5]. IoT-based cloud computing has a variety of applications such as web-based management. However, cloud storage requires specific databases to rely on the client’s need; if the client wishes to hold their knowledge in free space, cloud computing exposes the server and then the knowledge (data) needs to be checked by Decision Support System for timely and accurate measurements.Encryption techniques are being used to ensure privacy of data in Internet of Things (IoT) cloud and ensure confidentiality. Machine Learning (ML) Algorithms are employed including Decision Tree (DT), Support Vector Machine (SVM), Naïve Bayes (NB),K-nearest Neighbors (KNN), and Random Forest (RF) [6]. Each of the layout strategies displays a characteristic suitability and specificity that depends on the type of dataset [7]. Moreover, there are different assessment measurements for looking at the characterization techniques that every one of them could be helpful relying upon the issue. Fundamental problems for cloud computing are (i) digital unloading, (ii) centralized implementation, and (iii) dynamics which have been extensively explored in previous compositions. A few further changes have been introduced to overhaul protection for Clouds themselves, such as protection structure [8] based on TCG [9], stable redistribution [10–13], cloud network defence [14, 15], board tool and detachment [16, 17], and insurance [18, 19]. Main concern to IoT-cloud professional organizations is to ensure the confidentiality of records created and managed by mobile gadgets or cloud server [20]. Data/report confidentiality is very critical to the data/record holder because it may include some secret data.Main contribution of this research study is as follows:(i)
Five different Machine Learning Algorithms are applied to classify the dataset(ii)
RSA algorithm is utilized for the data security(iii)
Fast Encryption and DecryptionRest of the paper is organized as follows: Section2 provides background study and related problem. Section 3 provides proposed methodology. Section 4 provides result and discussion, and conclusion is provided in Section 5.


## 2. Background Study

Machine Learning algorithms are being used for training to explain how the input variables apply to the category [5]. There are various identification approaches for data such as DT, SVM, NB, KNN, RF, LogR, LR, NB, ANN, LC, decision tree, and so on [6, 21]. The association of classifiers and usage of classifier is important [22]. Support Vector Machine (SVM) finds out hyperplane (N-characteristics) in N-dimensional space which distinguishes the data points. [23]. SVM has a few favourable circumstances in which it performs very well when the differentiation between bunches is self-evident and increasingly compelling for high dimensional spaces.. Because the number of tests is more than the number of measurements, it is persuasive.There exist several drawbacks in SVM which do not deal with massive data sets. Every data point needs to access the sum of training dataset where SVM is considered the optimal choice in comparison withK-nearest neighbor (KNN). However, training tuples are linked to n-quality which usually refers to a stage in the domain of n-measures. Right now, the training tuples are put in a space of n-dimensional progression. The KNN classifier quickly determines sample space for the k preparation of tuples that are the most similar to dark tuples. The K tuples are the nearest neighbors of the darkest tuple [24, 25]. “Closeness” is known as the separation metric, e.g., the Euclidean separation. The distinction between Euclidean and two tuples or tuples X1 = (x11, x12, …, x1n) and X2 = (x21, x22, …, x2n) is derived from the following:(1)distX1,X2=∑i=1nx1i−x2i2.DT is a tree-like flowchart layout where each inner hub is a feature check and other branch is the outcome [26]. Inside a tree the top hub is the root hub.During development, choice measures for credits are utilized to pick the best possible asset while three basic determination measures for characteristics are the knowledge, benefit ratio, and Gain index. Information gain is depicted as follows:(2)GainE,Y=EntropyE−EntropyE,Y,where E is the target variable and Y is the feature to be split on.Entropy (E, Y) describes the highlighted information. Tree pruning expects to perceive and take out these branches, with the objective of improving the precision of grouping on inconspicuous information. Random Forest (RF) can be utilized for selection process. Expectations across all trees were grouped to render the last forecast; class approach is utilized to collect information and indicate relapse expectations. The suggested techniques can be used for the progression of settle tests on ultimate conclusion.Increase in base learner numbers (k) will decrease variance. However, k is lower due to that variance increases. However, for the entire cycle, bias remains constant. The cross-validation is used to find k as shown in the following equation:(3)Random forest=DTbase learner+baggingRow sampling with replacement+feature baggingcolumn sampling+aggregationmeanmedian,majority vote.Mobile computing has reduced the privacy and security concerns which usually mimic resource management [27]. Secure data organization is based on ethnicity-based intermediary which uses encryption while integrated phone applications have secured mobile data in better way. Users who store consumer data/records in IoT-based clouds use encryption and trustworthy computations. However, Diffie–Hellman key sharing, bilinear mapping, and the merkle hash tree compel the use of a stable knowledge ownership mechanism [28–31]. Table 1 describes multiple security risks which are elaborated in detail.Table 1
Security risks with details.
AttacksExplanationData revelationSecure details of the owner shall be exposed to any unwanted user.TamperingAt the point when any unapproved individual does a few changes in other client’s information.RejectionAt the point when an individual rejected in the wake of communicating something specific that he did not send it.VirusThose are particularly well-known threats. Those are symbols that will infect the show of a certain program.Personality trickingIn this assault, a person mimics himself as someone who owns the details.Provable Data Ownership (PDP) plot guarantees the clustering, confidentiality, and consistency of mobile consumer data processed on the IoT-based cloud. In Diffie–Hellman symmetric keys, key sharing is required where G1 and GT are cyclical multiplicative social activities with main recruitment q and g as generators of G1. The bilinear solution ise: G1 and G2 above GT, where G1 and GT are cyclical multiplicative social activities with main recruitment q and g as generators of G1. Merkle Hash Tree (MHT) is utilized as an analogous tree, with the leaves representing the actual results’ hash calculation. The establishment of a tree must be validated by the verifier. Hyrax, a Hadoop method that facilitates cloud computing on smartphones, was created by Arockiam and Monikandan [32]. This provides a discerning approach to data exchange and suffers from a middle point of entry. Eugene in like manner executed a scattered media search and data sharing philosophy. Xu et al. [33] suggested methodology that promotes the enhancement of conventional encryption strategies by combining replacement ciphers and conversion ciphers. Both the replacement and the transposing methods used the alphabet for the cipher letter. In their proposed algorithm, plain text is initially translated to the appropriate ASCII code type of each alphabet. Rehman and Manickam [34] suggested an agent-aid paradigm by incorporating multiagent network and choice-making methodology to function load balancing problems in vast clouds. While the mentioned research, manage data sharing which boosts cloud computing efficiency through space-intensive applications, such as distributed data mining. In addition, natured inspired evolutionary computational technique (E-AntHocNet) and Fisheye State routing (FSR) can be considered for further improvements [35–37].


## 3. Methodology

The proposed model contains two stages. In the initial step, we pass our information to the five classification models. In the second step, we can pass the highest precision model to the RSA algorithm which we proposed.Figure2 depicts the progression of the research that led to the development of the model. The proposed model consists of five techniques where data of patient or disease are sent directly to various classification techniques. Here, classification techniques that we use are SVM, NV, DT, RF, and KNN. SVM is accepted as the AI model utilized in characterization. Algorithm 1 shows the RSA after passing by all these techniques.Figure 2
Model diagram of proposed technique.Algorithm 1: Pseudo code of RSA.
(1)
Start(2)
ChooseP, Q where Prime = {P, Q}, P ≠ Q(3)
CalculateS {S = P ∗ Q}(4)
Calculate Φ (S), {Φ (S) = (P − 1) (Q − 1)}(5)
Choose RandomW {gcd (Φ (n), W = 1)} and 1 < W < Φ (S)(6)
CalculateD, {d.e ≡ 1 modϕ (S)}(7)
Public key {W, n}(8)
Private Key {D, n}(9)
EndA support vector machine’s objective is to achieve the most raised edge isolating hyperplane between two classes [24]. Hyperplane is never close to knowledge that focuses on different classes for greater supposition. Hyperplane has distant from the information targeting classification. Moreover, closest to the edge (classifier) is guidance for the vectors [38].Naive Bayes utilized Bayes theorem and characterized those data, which is not known and trivial to each other. It further provides information of specific element and does not affect another in a class. In addition, likelihood of creating classification of clusters is very restrictive. For order of data, ground breaking calculation is used [25].Random forests are an ensemble learning method for classification that involves creating a large number of option trees in a short amount of time and delivering a class. For individual trees, this strategy of classes (order) or mean forecast (relapse) is applied. Overfitting to their preparation set is caused by arbitrary tree propensity choices.Decision Tree is based on supervised learning technique and utilized for the classification of data. Primary aim of DT is the possibility of target class. Parent node and its child nodes are used for clustering of data. DT checks for those nodes which is more gain among others [39].These systems characterize data and generate outcomes. We consider the outcome in terms of precision. The most exact strategy is considered to be used in the future. Significances of these strategies will be examined in Result Section.When one outcome is chosen from five possible outcomes, the information must be saved somewhere. As a result, we are sending our data to the cloud for the purpose of data compression. However, we require a secure method of sending data to the cloud. Because security is a top priority, we have implemented the RSA calculation [40] on the cloud to ensure that data are kept safe and secure.Client data are encoded first and then stored in the mobile Cloud using the RSA technique. When necessary, the client submits a request for information to the Cloud supplier, who validates the customer and transmits the information. RSA is an encryption that prevents each message from being mapped to a number. RSA is made up of two parts: public and private keys.


### 3.1. Environment Setup

This research study focuses on the classification of dataset of heart patients using five different techniques. Tools which we are using for classification are SVM, NB, RF, DT, and KNN. These techniques have more roots of them, e.g., SVM have 6 types: Linear, Cubic, Quadratic, Fine Gaussian, Medium Gaussian, and Coarse Gaussian. We are using fine Gaussian SVM technique here because its accuracy is highest as compared with types. Decision Tree has 3 types further: complex tree, simple tree, and medium Tree. Among these types, complex tree has more accuracy so we are using fine tree for classification of data. The third technique which we are using is KNN. It has 6 types further: Weighted KNN, Cubic KNN, Cosine KNN, Coarse KNN, Fine KNN, and Medium KNN. So, we are using Fine KNN from k-nearest neighbor because it has more accuracy than other types of KNN. The fourth technique which we are using is Naïve Bayes. It has 2 types further: Gaussian Naïve Bayes and Kernel Naïve Bayes. So, we are using Kernel Naïve Bayes because it has more accuracy than other types of Naïve Bayes. At the last, we are using bagged trees in Random Forest because it has highest accuracy than others.According to a recent medical assessment, if factors such as smoking, cholesterol, and diabetes are addressed in a country, people suffering from heart disease can reduce by about 15%. This Clevand data base was compiled by Robert Detrano and contains 303 occurrences of 76 attributes. Cleveland heart disease is the most commonly used dataset by data mining researchers in the UCI machine learning repository, with 76 variables. Only 11 variables have been employed by researchers to predict and analyse cardiac disorders. Table2 shows that we have considered heart-attack dataset throughout the research. Total of 1311 instances are extracted from medical dataset. It has 11 numeric value attributes. One class has “0” value considered as negative and other class has “1” considered a positive for heart patients. The dataset originally had 76 features or qualities from 303 patients; however, published research only chose 11 features to be relevant in predicting heart disease. As a result, we will be working with a dataset of 303 patients and 11 characteristics.Table 2
Dataset with details.
DatasetNo. of rowsNo. of columnsTotal dataHeart attack13111114421Age, sex, cerebral palsy, resting blood pressure, cholesterol, fasting blood sugar test, electrocardiogram, maximum heart rate archieved, exhang, oldpeak, and outcome are attributes used in this paper shown in Table3.Table 3
Attributes of dataset.
AttributesAbbreviationAge—Sex—Cerebral palsyCpResting blood pressureTrestbpsCholesterolCholFasting blood sugar testFbsElectrocardiogramRestecgMaximum heart rate achievedThalachExhang—Oldpeak—OutcomeNumFor Table4, arrangement, accuracy, scatter plot, confusion matrix, and ROC metrics are considered.Table 4
Accuracy measures.
MeasuresExplanationAccuracyAccuracy decides the precision of the calculation in foreseeing occasionsROC curveThe ROC (receiver operating curve) bends are used to assess the ease of testingScatter plotScatter (x, y) makes a disperse plot with hovers at the areas determined by the vectors x and yConfusion matrixThe confusion matrix shows the total number of perceptions in every cellClient information is first encrypted and then stored in the Cloud via RSA. When the client requests information from the Cloud supplier, the Cloud supplier verifies client and then sends the information to the client.In RSA, each message is assigned a whole integer, which is a square figure. RSA is made up of two parts: public and private keys. In our Cloud situation, everyone has access to the Public Key, but only the client with the first access to the data has access to the Private Key.


### 3.2. Encryption and Authentication of Data

To ensure data security, all data packets are encrypted and decoded using a private key, with asymmetric cryptography providing authentication. An upgraded RSA cryptographic method is presented as a solution.


#### 3.2.1. Key Generation

We choose two distinct prime numbers:a = 61 and b = 53.Processn = a ∗ b, in this manner n = 61 ∗ 53 = 3233.Process Euler’s totient work, Ø (n) = (a − 1) ∗ (b − 1). Thus, Ø (n) = (61 − 1) ∗ (53 − 1) = 60 ∗ 52 = 3120.Picked any whole numbere, with the end goal that 1 < e < 3120 that is coprime to 3120. Here, we picked e = 17.Processd, d = e − 1 (mod Ø (n)); therefore, d = 17 − 1 (mod 3120) = 2753.Public Key is (e, n) = (17, 3233) and Private Key is (d, n) = (2753, 3233).


#### 3.2.2. Encryption

Cloud co-op provides the client with the Public Key (17, 3233) for storing the information. Let supposem = 65 for Client mapped information. This information is further encoded to the specialist co-op by utilizing Public Key C = 6517 (mod 3233) = 2790 which is shared among both parties. The Cloud specialist co-op is currently storing these encoded data, i.e., figure content.


#### 3.2.3. Decryption

When the customer requests the information, the Cloud specialist cooperative verifies the client and sends the encrypted data (if the client is legitimate).At that time, the cloud client computes to decode the information,m = Cd (mod n) = 27902753 (mod 3233) = 65.When them esteem is gotten, client will get back the first information. Figure 3 describes the flow chart of RSA.Figure 3
Flow chart depicted the RSA decryption algorithm.


### 3.3. The RSA Algorithm for RSA Public and Private Key Pair Generation

Both key exchange and digital signatures can be done with the RSA technique. The mathematics behind RSA is extremely simple despite the fact that it is used with integers with hundreds of digits.The steps below can be used to establish an RSA public and private key pair:(i)
P and q are two prime numbers. The modulus, n = pq, can be calculated using these numbers.(ii)
Choose a third number,r, that is substantially prime to the product (p 1) (q1); r is the public exponent.(iii)
Use the quotient ((rs − 1))/((p − 1) (q − 1) to find an integer s. The private exponent is represented by the integer s.(iv)
The number pair (n, r) is the public key. Although these data are public, determining r from n and s is computationally impossible unless p and q are large enough.(v)
To encrypt a message,m generates the cipher-text C using equation 4 and the public key. C =  mr mod (n) (4)(vi)
The receiver then uses the private key to decrypt the cipher-text using the following:(4)m=c5modn.


## 3.1. Environment Setup

This research study focuses on the classification of dataset of heart patients using five different techniques. Tools which we are using for classification are SVM, NB, RF, DT, and KNN. These techniques have more roots of them, e.g., SVM have 6 types: Linear, Cubic, Quadratic, Fine Gaussian, Medium Gaussian, and Coarse Gaussian. We are using fine Gaussian SVM technique here because its accuracy is highest as compared with types. Decision Tree has 3 types further: complex tree, simple tree, and medium Tree. Among these types, complex tree has more accuracy so we are using fine tree for classification of data. The third technique which we are using is KNN. It has 6 types further: Weighted KNN, Cubic KNN, Cosine KNN, Coarse KNN, Fine KNN, and Medium KNN. So, we are using Fine KNN from k-nearest neighbor because it has more accuracy than other types of KNN. The fourth technique which we are using is Naïve Bayes. It has 2 types further: Gaussian Naïve Bayes and Kernel Naïve Bayes. So, we are using Kernel Naïve Bayes because it has more accuracy than other types of Naïve Bayes. At the last, we are using bagged trees in Random Forest because it has highest accuracy than others.According to a recent medical assessment, if factors such as smoking, cholesterol, and diabetes are addressed in a country, people suffering from heart disease can reduce by about 15%. This Clevand data base was compiled by Robert Detrano and contains 303 occurrences of 76 attributes. Cleveland heart disease is the most commonly used dataset by data mining researchers in the UCI machine learning repository, with 76 variables. Only 11 variables have been employed by researchers to predict and analyse cardiac disorders. Table2 shows that we have considered heart-attack dataset throughout the research. Total of 1311 instances are extracted from medical dataset. It has 11 numeric value attributes. One class has “0” value considered as negative and other class has “1” considered a positive for heart patients. The dataset originally had 76 features or qualities from 303 patients; however, published research only chose 11 features to be relevant in predicting heart disease. As a result, we will be working with a dataset of 303 patients and 11 characteristics.Table 2
Dataset with details.
DatasetNo. of rowsNo. of columnsTotal dataHeart attack13111114421Age, sex, cerebral palsy, resting blood pressure, cholesterol, fasting blood sugar test, electrocardiogram, maximum heart rate archieved, exhang, oldpeak, and outcome are attributes used in this paper shown in Table3.Table 3
Attributes of dataset.
AttributesAbbreviationAge—Sex—Cerebral palsyCpResting blood pressureTrestbpsCholesterolCholFasting blood sugar testFbsElectrocardiogramRestecgMaximum heart rate achievedThalachExhang—Oldpeak—OutcomeNumFor Table4, arrangement, accuracy, scatter plot, confusion matrix, and ROC metrics are considered.Table 4
Accuracy measures.
MeasuresExplanationAccuracyAccuracy decides the precision of the calculation in foreseeing occasionsROC curveThe ROC (receiver operating curve) bends are used to assess the ease of testingScatter plotScatter (x, y) makes a disperse plot with hovers at the areas determined by the vectors x and yConfusion matrixThe confusion matrix shows the total number of perceptions in every cellClient information is first encrypted and then stored in the Cloud via RSA. When the client requests information from the Cloud supplier, the Cloud supplier verifies client and then sends the information to the client.In RSA, each message is assigned a whole integer, which is a square figure. RSA is made up of two parts: public and private keys. In our Cloud situation, everyone has access to the Public Key, but only the client with the first access to the data has access to the Private Key.


## 3.2. Encryption and Authentication of Data

To ensure data security, all data packets are encrypted and decoded using a private key, with asymmetric cryptography providing authentication. An upgraded RSA cryptographic method is presented as a solution.


### 3.2.1. Key Generation

We choose two distinct prime numbers:a = 61 and b = 53.Processn = a ∗ b, in this manner n = 61 ∗ 53 = 3233.Process Euler’s totient work, Ø (n) = (a − 1) ∗ (b − 1). Thus, Ø (n) = (61 − 1) ∗ (53 − 1) = 60 ∗ 52 = 3120.Picked any whole numbere, with the end goal that 1 < e < 3120 that is coprime to 3120. Here, we picked e = 17.Processd, d = e − 1 (mod Ø (n)); therefore, d = 17 − 1 (mod 3120) = 2753.Public Key is (e, n) = (17, 3233) and Private Key is (d, n) = (2753, 3233).


### 3.2.2. Encryption

Cloud co-op provides the client with the Public Key (17, 3233) for storing the information. Let supposem = 65 for Client mapped information. This information is further encoded to the specialist co-op by utilizing Public Key C = 6517 (mod 3233) = 2790 which is shared among both parties. The Cloud specialist co-op is currently storing these encoded data, i.e., figure content.


### 3.2.3. Decryption

When the customer requests the information, the Cloud specialist cooperative verifies the client and sends the encrypted data (if the client is legitimate).At that time, the cloud client computes to decode the information,m = Cd (mod n) = 27902753 (mod 3233) = 65.When them esteem is gotten, client will get back the first information. Figure 3 describes the flow chart of RSA.Figure 3
Flow chart depicted the RSA decryption algorithm.


## 3.2.1. Key Generation

We choose two distinct prime numbers:a = 61 and b = 53.Processn = a ∗ b, in this manner n = 61 ∗ 53 = 3233.Process Euler’s totient work, Ø (n) = (a − 1) ∗ (b − 1). Thus, Ø (n) = (61 − 1) ∗ (53 − 1) = 60 ∗ 52 = 3120.Picked any whole numbere, with the end goal that 1 < e < 3120 that is coprime to 3120. Here, we picked e = 17.Processd, d = e − 1 (mod Ø (n)); therefore, d = 17 − 1 (mod 3120) = 2753.Public Key is (e, n) = (17, 3233) and Private Key is (d, n) = (2753, 3233).


## 3.2.2. Encryption

Cloud co-op provides the client with the Public Key (17, 3233) for storing the information. Let supposem = 65 for Client mapped information. This information is further encoded to the specialist co-op by utilizing Public Key C = 6517 (mod 3233) = 2790 which is shared among both parties. The Cloud specialist co-op is currently storing these encoded data, i.e., figure content.


## 3.2.3. Decryption

When the customer requests the information, the Cloud specialist cooperative verifies the client and sends the encrypted data (if the client is legitimate).At that time, the cloud client computes to decode the information,m = Cd (mod n) = 27902753 (mod 3233) = 65.When them esteem is gotten, client will get back the first information. Figure 3 describes the flow chart of RSA.Figure 3
Flow chart depicted the RSA decryption algorithm.


## 3.3. The RSA Algorithm for RSA Public and Private Key Pair Generation

Both key exchange and digital signatures can be done with the RSA technique. The mathematics behind RSA is extremely simple despite the fact that it is used with integers with hundreds of digits.The steps below can be used to establish an RSA public and private key pair:(i)
P and q are two prime numbers. The modulus, n = pq, can be calculated using these numbers.(ii)
Choose a third number,r, that is substantially prime to the product (p 1) (q1); r is the public exponent.(iii)
Use the quotient ((rs − 1))/((p − 1) (q − 1) to find an integer s. The private exponent is represented by the integer s.(iv)
The number pair (n, r) is the public key. Although these data are public, determining r from n and s is computationally impossible unless p and q are large enough.(v)
To encrypt a message,m generates the cipher-text C using equation 4 and the public key. C =  mr mod (n) (4)(vi)
The receiver then uses the private key to decrypt the cipher-text using the following:(4)m=c5modn.


## 4. Results and Discussion

As previously stated, the proposed philosophy lashed back at the heart of informational collection understanding. Linear, Cubic, Quadratic, Fine Gaussian, Medium Gaussian, and Coarse Gaussian classifiers are processed by the SVM classifier with simplified parameters in order to find the ideal hyperplane that divides the pursuit space into two classes. SVM structured information into two classes using a reaction set for classifier in which 0 and 1 attributes are set on which assumption. Figure4 shows the feature selection that was taken into account in the study.Figure 4
Feature selection.Figure4 depicts the feature selection which is age, sex, cerebral palsy, resting blood pressure, cholesterol, fasting blood sugar test, electrocardiogram, maximum heart rate archieved, exhang, and oldpeak considered in the study.As we discussed in proposed methodology, total six techniques are used. First of all, data of disease are sent towards different classification techniques to classify data into two classes.In SVM, there are further six types: Linear SVM, Quadratic SVM, Cubic SVM, Fine Gaussian SVM, Medium Gaussian SVM, and Coarse Gaussian SVM. We classify our data through all these six SVMs, and we found the best result from Fine Gaussian SVM as it has maximum accuracy among all SVMs.In Naive Bayes, there are further two types: Gaussian Naive Bayes and Kernel Naive Bayes. We classify our data with these two Naive Bayes, and we found the best result from Kernel Naive Bayes as it has highest accuracy compared with Gaussian Naive Bayes.In Decision Tree, there are further three types: Fine Tree, Medium Tree, and Coarse Tree. We classify our data with these three Decision Trees, and we found the best result from Fine Tree as it has highest accuracy compared with other two. We also classify our data through Random Forest. In KNN, there are further six types: Fine KNN, Medium KNN, Coarse KNN, Weighted KNN, Cubic KNN, and Cosine KNN. We classify our data with all these six KNN, and we found the best result from Fine KNN as it has highest accuracy among all KNN.Table5 determines classifier’s performance on the basis of classified. Performance of SVM, NV, DT, RF, and KNN is calculated. The affectability, explicitness, exactness, and f-measure are calculated, and accuracy is checked, in order to analyze the classifier's performance. FP and FN are the proportions of negative instances incorrectly categorised as positive and positive cases incorrectly classed as negative, respectively.Table 5
Classifier’s performance on the basis of classified instances.
ClassifiersCorrectly classifiedIncorrectly classifiedSVM13082KNN13064NB1075235RF130010DT128228On the basis of classified cases, Table6 determines the performance of the classifier. Accuracy is determined and analysed based on these classified cases. Out of a total number of examples, the performance of SVM is measured in terms of Correctly Classified Instances and Incorrectly Classified Instances. Four different classifiers are true positive, true negative, false positive, and false negative values. SVM displays the largest true positive values, while KNN displays the lowest false negative values, DT displays the lowest false positive values, and RF displays the highest false negative values.Table 6
True and negative values of classifiers.
ClassifiersTPTNFPFNSVM74256620KNN74256440NB625450118117RF742558100DT742540280Measures used for classification are shown in Table7 where TP and TN address true positive and true negative which are the degree of positive and negative cases that were really perceived independently. FP and FN address false positive and false negative which are the degree of negative cases that were erroneously designated positive and the degree of positive cases that were erroneously named negative independently.Table 7
Classifier’s performance.
SensitivityTP/TP+FNSpecificityFP/FP+TNPrecisionTP/TP+FPF-measure2Sen∗Pre/Sen+PreAccuracyTP+TN/TP+FP+TN+FNFigures5(a)–5(d) and 6(e) illustrate the specificity, sensitivity, precision, f-measurement, and accuracy, which are used to calculate and estimate the effectiveness of the classifiers. Figure 5(a) shows that NB has the highest specificity. In Figures 5(b) and 5(c), NB has the lowest sensitivity and precision of 0.844 and 0.824, respectively. In Figure 5(c) and Figure 5(d), SVM achieves the highest precision and f-measure of 0.984 and 0.954, respectively. In Figure 5(e), the accuracy of several classifiers is shown in percentages, with SVM having the greatest accuracy of 0.974. SVM has the highest accuracy of all the classifiers. The percentage of correctly expressed positive and negative examples is denoted by TP and TN, respectively. Figure 5(f) depicts the categorization model’s performance. In Figure 5(g), a scatter plot with horizontal and vertical axes is displayed. As illustrated in Figure 5, FP and FN are the proportions of negative instances incorrectly identified as positive and positive cases incorrectly classified as negative, respectively. SVM has a TP rate of 0.980, while KNN has a rate of 0.963, DT has a rate of 0.933, RF has a rate of 0.982, and NB has a rate of 0.802. SVM has an FP rate of 0.043, KNN of 0.030, DT of 0.14, RF of 0.050, and NB of 0.330.Figure 5
Performance measure comparison of five classification techniques. (a) Specificity. (b) Sensitivity. (c) Precision. (d)F-measure. (e) Accuracy. (f) ROC. (g) Scatter plot. (h) Confusion matrix.
(a)(b)(c)(d)(e)(f)(g)(h)Figure 6
Encryption time using RSA algorithm.The prediction speed and training time of each classifier are shown in Table8, with SVM having the highest Prediction Speed observed per second (obs/sec) and KNN having the quickest training time.Table 8
Prediction speed and training time of classifiers.
ClassifiersPrediction speed (obs/sec)Training time (sec)SVM2800023.01KNN160003.273DT1200014.37RF80007.317NB140008.364Graph in Figure6 represents a file of size 4 kb, 8 kb, 16 kb, 32 kb, and 64 kb taking 16 ms, 31 ms, 47 ms, 78 ms, and 218 ms encryption time using the RSA algorithm.In RSA, exchange is the public key with the recipient is used for a decryption request. Hold it safe is a proprietary key that is never shared with any other person.Graph in Figure7 represents a file of size 4, 8, 16, 32, and 64 kb taking 15, 16, 16, 47, and 47 ms decryption time using the RSA algorithm.Figure 7
Decryption time using RSA algorithm.If the key size is identical to the size of the packet to be sent across the network, an effective cryptosystem will produce the best results. Algorithm focused on parameters such as key length, block size, features, and functions. Because we realize data are held elsewhere in cloud storage, we need fast processing speed as well as fast protection. Here, the graph in Figure6 indicates the success of the suggested case that how long it takes to encrypt the files.


## 5. Conclusions

An asset-restricted mobile PC saves data on an IoT-based cloud. However, constantly a significant inquiry regarding cloud specialist deals with the records appropriately while mobile cloud computing security is the fundamental concern. The proposed system gives a security system to make sure about the information in mobile cloud computing with the assistance of RSA calculation and other five different intelligent classification techniques.A classification method based on the proposed methodology was presented to classify heart-attack data. First, dataset is generated for different parameters of heart attack. Second, based on these data, result is calculated in “0” and “1” form. Now, the generated data are sent straight to SVM, KNN, NB, RF, and DT for classification. The accuracies of the training dataset with classifiers are 99.80%, 99.6%, 82%, 99.2%, and 97.8% of SVM, KNN, NB, RF, and DT, respectively. SVM has high accuracy in comparison with other contemporary algorithms. In future, SVM could be utilized for grouping reason. The execution of the RSA calculation provides information assurance. Cloud security depends on reliable computing and encryption. Only the approved user can access the data in the proposed work. However, if any intruder (unauthorized user) tries to attack the system to collect sensitive data, the original information will be secure and cannot be recovered.



---

*Source: 2195646-2022-04-14.xml*