RESUMEN
Cloud computing alludes to the on-demand availability of personal computer framework resources, primarily information storage and processing power, without the customer's direct personal involvement. Cloud computing has developed dramatically among many organizations due to its benefits such as cost savings, resource pooling, broad network access, and ease of management; nonetheless, security has been a major concern. Researchers have proposed several cryptographic methods to offer cloud data security; however, their execution times are linear and longer. A Security Key 4 Optimization Algorithm (SK4OA) with a non-linear run time is proposed in this paper. The secret key of SK4OA determines the run time rather than the size of the data as such is able to transmit large volumes of data with minimal bandwidth and able to resist security attacks like brute force since its execution timings are unpredictable. A data set from Kaggle was used to determine the algorithm's mean and standard deviation after thirty (30) times of execution. Data sizes of 3KB, 5KB, 8KB, 12KB, and 16 KB were used in this study. There was an empirical analysis done against RC4, Salsa20, and Chacha20 based on encryption time, decryption time, throughput and memory utilization. The analysis showed that SK4OA generated lowest mean non-linear run time of 5.545±2.785 when 16KB of data was executed. Additionally, SK4OA's standard deviation was greater, indicating that the observed data varied far from the mean. However, RC4, Salsa20, and Chacha20 showed smaller standard deviations making them more clustered around the mean resulting in predictable run times.
Asunto(s)
Algoritmos , Almacenamiento y Recuperación de la Información , Nube Computacional , Seguridad Computacional , MicrocomputadoresRESUMEN
Focus on predictive algorithm and its performance evaluation is extensively covered in most research studies to determine best or appropriate predictive model with Optimum prediction solution indicated by prediction accuracy score, precision, recall, f1score etc. Prediction accuracy score from performance evaluation has been used extensively as the main determining metric for performance recommendation. It is one of the most widely used metric for identifying optimal prediction solution irrespective of dataset class distribution context or nature of dataset and output class distribution between the minority and majority variables. The key research question however is the impact of class inequality on prediction accuracy score in such datasets with output class distribution imbalance as compared to balanced accuracy score in the determination of model performance in healthcare and other real-world application systems. Answering this question requires an appraisal of current state of knowledge in both prediction accuracy score and balanced accuracy score use in real-world applications where there is unequal class distribution. Review of related works that highlight the use of imbalanced class distribution datasets with evaluation metrics will assist in contextualizing this systematic review.
RESUMEN
The cloud is becoming a hub for sensitive data as technology develops, making it increasingly vulnerable, especially as more people get access. Data should be protected and secured since a larger number of individuals utilize the cloud for a variety of purposes. Confidentiality and privacy of data is attained through the use of cryptographic techniques. While each cryptographic method completes the same objective, they all employ different amounts of CPU, memory, throughput, encryption, and decryption times. It is necessary to contrast the various possibilities in order to choose the optimal cryptographic algorithm. An integrated data size of 5n*102 (KB (∈ 1,2,4,10,20,40) is evaluated in this article. Performance metrics including run time, memory use, and throughput time were used in the comparison. To determine the effectiveness of each cryptographic technique, the data sizes were run fifteen (15) times, and the mean simulation results were then reported. In terms of run time trend, NCS is superior to the other algorithms according to Friedman's test and Bonferroni's Post Hoc test.