Search

The technology-driven modern age emphasizes the security and privacy of communication. Through this paper, we delve deep into the need for user-centric security within cloud-based environments. The need for enhancement in encryption arises due to the increasing cases of data breaches and insider threats in cloud-based environments recently. The focus is laid upon the use of RSA encryption, end-to-end encryption, and anonymous messaging to address security-based concerns. The primary focus of this research is to develop a comprehensive security system to ensure the confidentiality and authenticity of text-based messages shared in the cloud. The proposed improved RSA algorithm, as suggested, incorporates three prime numbers in the key generation process. To address repetitive ciphertext, the proposed algorithm involves adding the index of each character in the plaintext string to the character's integer value before encryption. Conversely, during decryption, the same index is subtracted. This proposed algorithm has been utilized in a practical scenario, specifically in the implementation of a chat application. This paper presents a proof-of-concept for the proposed enhanced version of the RSA algorithm, accompanied by a thorough comparison and analysis of computational times across various bit lengths. Increase in data security at a cost of minor increase in computation time was observed through this research. [ABSTRACT FROM AUTHOR]

In today's rapidly evolving digital landscape, secure data transmission and exchange are crucial for protecting sensitive information across personal, financial, and global infrastructures. Traditional cryptographic algorithms like RSA and AES face increasing challenges due to the rise of quantum computing and enhanced computational power, necessitating innovative approaches for data security. We explored a novel encryption scheme leveraging the quadratic chaotic map (QCM) integrated with the Fibonacci sequence, addressing key sensitivity, periodicity, and computational efficiency. By employing chaotic systems' inherent unpredictability and sensitivity to initial conditions, the proposed method generates highly secure and unpredictable ciphers suitable for text and image encryption. We incorporated a combined sequence from the Fibonacci sequence and QCM, providing enhanced complexity and security. Comprehensive experimental analyses, including noise and occlusion attack simulations, demonstrate the scheme's robustness, resilience, and practicality. The results indicated that the proposed encryption framework offers a secure, efficient, and adaptable solution for digital data protection against modern computational threats. [ABSTRACT FROM AUTHOR]

Modern technologies like quantum and cloud computing have reshaped computing, offering immense power and scalability. While beneficial, they also challenge the security of traditional cryptographic systems. Quantum computing threatens RSA and ECC with algorithms like Shor's algorithm, which can accelerate computations exponentially. This risks exposing these systems to attacks, necessitating quantum-resistant cryptography. Cloud computing poses data security concerns, requiring robust cryptographic mechanisms and access controls. Lattice-based cryptography, leveraging problems like the Short Integer Solution (SIS), emerges as a solution. This paper presents a novel quantum-resistant public key encryption scheme based on ElGamal and SIS, ensuring security against quantum and classical threats in modern cryptographic environments. [ABSTRACT FROM AUTHOR]

As cyberattacks are getting more complex and sophisticated, stringent, multi-layered security measures are required. Existing approaches often rely on tokenization or encryption algorithms, both of which have drawbacks. Previous attempts to ensure data security have primarily focused on tokenization techniques or complex encryption algorithms. While these methods work well on their own, they have proven vulnerable to sophisticated cyberattacks. This research presents new ways to improve data security in digital storage and communication systems. We solve data security issues by proposing a multi-level encryption strategy that combines double encryption technology along with tokenization. The first step in the procedure is a byte-level byte-pair encoding (BPE) tokenizer, which tokenizes the input data and adds a layer of protection to make it unreadable. After tokenization, data is encrypted using Rivest-Shamir-Adleman (RSA) to create a strong initial level of security. To further enhance security, data encrypted with RSA has an additional layer of encryption applied using the advanced encryption standard (AES) method. This article describes how this approach is implemented in practice and shows how it is effective in protecting data at a higher level than single-layer encryption or tokenization systems. [ABSTRACT FROM AUTHOR]

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In the rapid evolving digital landscape, the imperative to ensure data security has never been more crucial. This paper addresses the pressing challenges in data security by introducing a file encryption management system, leveraging a modified advanced encryption standard (AES) algorithm with reduced round iterations and bit permutation. This system aims to comprehensively secure various file types, providing a dependable solution for file exchange. Our findings reveal substantial improvements in both encryption and decryption processes using the reduced-round permutationbased AES (RRPBA). The adapted algorithm demonstrates a significant 38.8% acceleration in encryption time and a remarkable 44.86% improvement in decryption time, positioning it as a pivotal component for efficient file operations within the management system. Moreover, the throughput assessments showcase a remarkable 33.73% improvement in encryption and 23.72% in decryption, outperforming the original AES, emphasizing the algorithm's superior computational effectiveness, signaling positive implications for future high-performance applications. In conclusion, the study not only addresses critical security challenges but also presents a viable solution with tangible speed advantages for file encryption and decryption processes within digital file management systems. [ABSTRACT FROM AUTHOR]

Summary: Communicating large amounts of data requires an encryption solution that ensures fast and secure data transfer. Unfortunately, it faced privacy and security issues, resulting in higher power consumption, data scarcity, energy, diversity, data reliability, low security, and packet loss in the communication process. The goal of this research is to ensure data transfer while conserving energy and protecting data transmission in WSNs. Therefore, this paper proposes a multipath routing protocol using the HGSPSO algorithm, which is a combination of hybrid gravitational search algorithm (HGSA) and particle swarm optimization (PSO), to securely transmit data from one node to another node under public and private key cryptography. The PSO approach is utilized to resolve the energy hole problem by selecting the cluster head in the sink coverage area. The RSA can be employed for data encryption, data decryption, key generation, and sharing. The metrics like acceleration constants and inertial weights are used for the HGSPSO algorithm. The result of this implementation demonstrated that the scheme had a low energy consumption of 36%, a maximum packet delivery ratio (PDR) of 96%, a higher throughput rate of 88%, and a low packet loss of 39%. [ABSTRACT FROM AUTHOR]

The article concentrates on exploring the issue of privacy‐preserving sliding mode consensus of multi‐agent systems (MASs) with disturbance. An encryption and decryption algorithm has been proposed to address data security and privacy issues during data transmission. To optimize network resource allocation, a dynamic event‐triggering mechanism has been introduced, which reduces the number of encrypted data while saving the computation cost. The consensus performance based on the sliding mode control strategy is achieved when the reachability of the slide‐mode surface is guaranteed, and then the slide‐mode controller is developed. Finally, an empirical demonstration through a numerical example validates the efficacy of the proposed strategy. [ABSTRACT FROM AUTHOR]

The connected digital environment generates massive amounts of data that must be protected from unauthorized disclosure. Technological advancements and the creative techniques attackers use can exacerbate data security breaches. Security protocols and cryptographic algorithms are the two components of information security, the last being information security's basis and fundamental technology. The cryptographic conception will improve and assure security while also protecting network resources that are exchanged. The goal of this study is to demonstrate the few encryption algorithms that are used to encrypt data on an unsecured network. This research presents a new hybrid encryption strategy for encrypting data. MRDAES encrypts data using Rivest, Shamir, Adleman (RSA), Diffie Hellman (DH), and the Advanced Encryption System. The data will be encoded in two stages: the first by producing the encoded data using the XOR function, and the second by using AES to encode data and obtain the final result to be shared with intended reception with high-security complexity compared to other methods in terms of performance and avalanche effect. The proposed study examines the three most widely used cryptographic symmetric and asymmetric algorithms, RSA, Diffie-Hellman, and AES, and how they operate and impact security and complexity when integrated into a unified hybrid (MRDAES) computation with the proper adjustments. The study also presents an approach for increasing data security while minimizing the number of mathematical equations and obtaining high-security complexity while slightly increasing execution time with chosen large random prime numbers. The results indicate that the new hybrid technique (MRDAES) has more efficient performance and avalanche effect inputs with a minor increase in execution time. The proposed approach MRDAES produced more advanced complexity than classical RSA existing methods and others. According to avalanche effect data, the proposed technique provides better results with a higher percentage than existing algorithms on modified RSA Random Bit Insertion Algorithm (RBMRSA) and classical Rivest, Shamir, and Adleman (RSA). The proposed approach enhances the avalanche effect by 88% compared to 48% achieved by an RBMRSA, with a 40% increase and 87.80% compared to RSA. [ABSTRACT FROM AUTHOR]

Hybrid encryption techniques are gaining popularity in the cloud platform due to their ability to address security concerns and data storage challenges. In order to ensure confidentiality at every stage of processing, this article presents an innovative strategy that merges fully homomorphic encryption (FHE) and secure hash algorithm 3 (SHA-3), offering robust protection against cyber threats. FHE and SHA-3 offer a solution to this problem. We conducted experiments using different datasets to test the performance and security strength of this hybrid approach. Our method takes into account factors such as computational overheads, complexity requirements, key management challenges, and limited support from vendors/providers offering specialized hardware/software capable of supporting complex mathematical functions required by each technique separately before combined into a hybrid form suitable enough scaled-out horizontally across different nodes within clouds themselves today globally among end-users relying upon them heavily day-to-day tasks involving mission-critical workloads running inside virtualized machines hosted on public/private clouds ecosystems worldwide. The results show that implementing FHE together with SHA-3 can significantly improve an organization's overall cyber security posture when operating critical infrastructure components residing within cloud environments. According to the results, it performs better than other methods that are currently in used complexity of encryption and decoding, including homomorphic encryption and RSA, AES & DSA, and AES & RSA. The hybrid algorithm we are proposed using fully homomorphic & SHA3 with 2048 bits 0.789 seconds of encryption time and decryption time with 0.001 seconds and execution time with 4.25 seconds. Therefore, we conclude that our proposed hybrid encryption technique is the best approach to address cyber security risks associated with storing sensitive data in cloud computing environments. [ABSTRACT FROM AUTHOR]

This investigation delineates an innovative approach to fortify the secure key exchange process by integrating the robustness of the RSA algorithm with the unpredictability of a chaotic system, thereby advancing the security framework for color image encryption. Within this scheme, encryption keys are derived from a chaotic system, the initial conditions of which are dynamically modulated by the delta feature extracted from the source image. Such a design ensures that the system's behavior inherently adapts to the input image. The initial values and parameters governing the five-dimensional chaotic system are securely transmitted from sender to recipient via the RSA algorithm. Subsequently, diffusion and confusion processes are orchestrated through the application of two uniquely computed key matrices, which operate on the image at the column and row levels, respectively. This mechanism is instrumental in altering pixel values throughout the image. Performance evaluation of the proposed algorithm is quantified by several metrics: a high Number of Pixels Change Rate (NPCR) value of 99.621% illustrates its efficacy in pixel value modification, while a Peak Signal-to-Noise Ratio (PSNR) value of 8.898 implies the retention of image quality post-encryption. Furthermore, an Unified Average Changing Intensity (UACI) value of 33.823% signifies the algorithm's proficiency in introducing substantial variations in pixel intensities. The results corroborate the algorithm's competency in encrypting color images, underpinning its utility in diverse applications that necessitate stringent data and image protection measures against unauthorized access. [ABSTRACT FROM AUTHOR]

The internet of things (IoT) faces significant obstacles due to insufficient identity recognition and evolving network architecture, leading to concerns about the confidentiality of data and causing anxiety. The attribute-based encryption (ABE) techniques have recently been considered a solution to guarantee the security of data transfer and precise data sharing. However, most of the existing methods used the attribute-based encryption (ABE) technique, which requires a lot of computation power and is unsuitable for IoT devices with minimal resources. Researchers have achieved improvements in establishing practical methods for cloud security on mobile IoT devices using lightweight ABE. In this paper, the ciphertext policy-revocable and searchable attribute-based encryption (CP-RSABE) method is proposed to protect privacy and security. The proposed methods greatly lower the cost of computing IoT devices with the availability of multiple-keyword searchers for the users of data. The user's side of computation is very efficient, and the cloud server handles most of the computing tasks. The proposed method performs significantly better in terms of ciphertext size, decryption time, and parameter size. The method achieves data security, privacy preservation, and mobile terminal operations that are suitable for applications of IoT methods. The existing methods such as online/offline multi authority-ABE with cryptographic reverse firewalls (OO-MA-ABE-CRF), ciphertext policy ABE (CP-ABE), ABE with full privacy protection (ABE-FPP) are used to justify the effectiveness of CP-RSABE method. The proposed method CP-RSABE achieves the encryption time (0.0163s), decryption time (0.25s), communication overhead (3.4KB), size of secret key (5.1KB), and size of ciphertext (10.7KB) compared to the OO-MA-ABE-CRF, CP-ABE, ABE-FPP. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) networks are the most prone to internal as well as external attacks in addition to energy consumption problems. Conventional security solutions are not able to address these issues effectively due to the limited resources of sensor nodes participating in IoT communications. In this work, an Efficient and Secure Fog Based Routing Mechanism (ESFRM) is proposed to protect the network from faulty internal as well as external attacks. Every node participating in IoT communications calculates the comprehensive trust value of the next intermediate node which is the addition of direct trust, indirect trust and energy trust values before forwarding the data. This comprehensive trust value is then compared with the comprehensive threshold trust value to decide whether the particular node is a rogue node or a valid normal node. Further, an enhanced RSA (Rivest, Shamir, Adleman) algorithm is implemented to provide three levels of data security from Cluster Head (CH) to fog node, from fog node to cloud server and directly from CH to cloud server. For this purpose, an efficient CH selection technique is also proposed in this work. The proposed methodology is compared with the Secure Energy-efficient Fog-based Routing (SEFR) protocol and Trust-aware Secure Routing Protocol (TSRP). The evaluation results show that the proposed ESFRM outperforms the conventional schemes with respect to energy consumption, malicious node detection and transmission rate. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) have up until now faced many challenges because of their open, wide-ranging, and resource-limited nature, including security, efficiency, and energy consumption. In the military system, it is essential to provide high-level security to the significant data over wireless network which is proved to be unreliable public communications. To solve the above problem, high level of security with minimum complexity should be applied to be adequate to limited capabilities of transmission system. This paper presents a new algorithm named (SRS) for encrypting transmitted military images to keep them from getting hacked or broken by WSN. The SRS algorithm is designed to be lightweight, fast, and secure, taking into consideration the limited capabilities of the transmission system. It is implemented as a public key cryptosystem specifically designed for image encryption. The algorithm consists of two parts: encryption and decryption. The proposed system suggested some equations and calculations that are applied to the plain and coded images after being transmitted over the WSN. The results of testing the simulation model demonstrate the effectiveness of the system by evaluation using various metrics such as Signal-to-Noise Ratio (SNR), Mean Squared Error (MSE), and Peak Signal-to-Noise Ratio (PSNR). Overall, the paper presents a new encryption algorithm, SRS, specifically designed for securing military images transmitted over wireless sensor networks. The algorithm aims to provide a balance between security, efficiency, and energy consumption, considering the resource-limited nature of WSNs. The simulation results indicate the improvement of the proposed system by 13 %, 10 %, and 55 % in packet delivery ratio (PDR), throughput, and dropping ratio, respectively, and it shows that the suggested SRS method increased execution time by 67 % compared to RSA based algorithm [ABSTRACT FROM AUTHOR]

With the rapid increase in demand for data trustworthiness and data security, distributed data storage technology represented by blockchain has received unprecedented attention. These technologies have been suggested for various uses because of their remarkable ability to offer decentralization, high autonomy, full process traceability, and tamper resistance. Blockchain enables the exchange of information and value in an untrusted environment. There has been a significant increase in attention to the confidentiality and privacy preservation of blockchain technology. Ensuring data privacy is a critical concern in cryptography, and one of the most important protocols used to achieve this is the secret-sharing method. By dividing the secret into shares and distributing them among multiple parties, no one can access the secret without the cooperation of the other parties. However, Attackers with quantum computers in the future can execute Grover’s and Shor’s algorithms on quantum computers that can break or reduce the currently widely used cryptosystems. Furthermore, centralized management of keys increases the risk of key leakage. This paper proposed a post-quantum threshold algorithm to reduce the risk of data privacy leakage in blockchain Systems. This algorithm uses distributed key management technology to reduce the risk of individual node private key leakage and provide post-quantum security. The proposed privacy-preserving cryptographic algorithm provides a postquantum threshold architecture for managing data, which involves defining users and interaction processes within the system. This paper applies a linear secret-sharing solution to partition the private key of the Number Theory Research Unit (NTRU) algorithm into n parts. It constructs a t–n threshold that allows recovery of the plaintext only when more than t nodes participate in decryption. The characteristic of a threshold makes the scheme resistant to collusion attacks from members whose combined credibility is less than the threshold. This mitigates the risk of single-point private key leakage. During the threshold decryption process, the private key information of the nodes will not be leaked. In addition, the fact that the threshold algorithm is founded on the NTRU lattice enables it to withstand quantum attacks, thus enhancing its security. According to the analysis, the proposed scheme provides superior protection compared to currently available methods. This paper provides postquantum security solutions for data security protection of blockchain, which will enrich the use of blockchain in scenarios with strict requirements for data privacy protection. [ABSTRACT FROM AUTHOR]

Data security is critical in wireless sensor networks (WSNs) because communication signals are highly available due to data transmission in free space. Attacks ranging from passive eavesdropping to active snooping are more common on these networks. This paper proposes secure data transfer using data encryption based on the improved Rivest–Shamir–Adleman (RSA) with Diffie–Hellman (DH) key exchange algorithm (IRSA-DH). For this purpose, the adaptive distance-based agglomerative hierarchical (ADAH)-based clustering method is used. Then the cluster head (CH) is selected using the improved weight-based rain optimization (IWRO) to improve the network's lifespan. This study aims to design a secure group communication method for WSNs. In order to generate and distribute the key to the group, the RSA and DH and key exchange algorithm had been hybridized with the Key Management Center (KMC). For safe communication between users, the key exchange technique is investigated. The performance measures such as throughput, packet loss ratio (PLR), packet delivery ratio (PDR), latency, energy consumption, end-to-end delay (EED) and network lifetime are analyzed and compared with the existing approaches. [ABSTRACT FROM AUTHOR]

There are many ways to ensure data security, one of the classic way but still effective is to use encryption. Encryption itself has two techniques or algorithms: symmetric-key (also called secret-key) and asymmetric-key encryption (also called public key). In this paper, we proposed an analysis of two algorithm of encryption: RSA and AES algorithm in term of securing digital data. The method used in this research are: RSA and AES analysis, then retrieving the result. The two algorithm is deeply and thoroughly analyzed to discover the effectiveness to secure the data. The Technological Readiness Level (TKT) is at level 6, which means demonstration of a model or prototype or the analysis result of a system or subsystem or a study in a relevant environment. The result concluded that the application of the AES encryption algorithm is more optimal than RSA encryption in digital data security. Because the encryption and decryption process of using the AES algorithm is faster, although the difference in testing time of the two encryption algorithms is not too significant. The entropy value of 4.96 in AES encryption is greater than that of RSA proving that the even distribution of characters in the chiper text code does not accumulate on certain characters so that it will be difficult to attack using frequency analysis.

To address a business need, most organizations allow employees to use their own devices to enhance productivity and job satisfaction. For this purpose, the Bring Your Own Device (BYOD) policy provides controllable access for employees to organize data through their personal devices. Although the BYOD practice implies plenty of advantages, this also opens the door to a variety of security risks. This study investigates these security risks and proposes a complementary encryption approach with a digital signature that uses symmetric and asymmetric algorithms, depending on the organization's digital certificate, to secure sensitive information stored in employees' devices within the framework of BYOD policies. The method uses Advanced Encryption System (AES), Blowfish, RSA and ElGamal with a digital signature to achieve strong encryption and address critical security considerations such as user authentication, confidentiality and data integrity. The proposed encryption approach offers a robust and effective cryptographic solution for securing sensitive information in organizational settings that involve BYOD policies. The study includes experimental results demonstrating the proposed approach's efficiency and performance, with reasonable encryption and decryption times for different key and file sizes. The results of the study revealed that AES and Blowfish have the best execution time. AES has a good balance of security and performance. RSA performs better than ElGamal in encryption and signature verification, while RSA is slower than ElGamal in decryption. The study also provides a comparative analysis with previous studies of the four encryption algorithms, highlighting the strengths and weaknesses of each approach. [ABSTRACT FROM AUTHOR]

Cloud computing is a technology that provides secure storage space for the customer’s massive data and gives them the facility to retrieve and transmit their data efficiently through a secure network in which encryption and decryption algorithms are being deployed. In cloud computation, data processing, storage, and transmission can be done through laptops and mobile devices. Data Storing in cloud facilities is expanding each day and data is the most significant asset of clients. The important concern with the transmission of information to the cloud is security because there is no perceivability of the client’s data. They have to be dependent on cloud service providers for assurance of the platform’s security. Data security and privacy issues reduce the progression of cloud computing and add complexity. Nowadays; most of the data that is stored on cloud servers is in the form of images and photographs, which is a very confidential form of data that requires secured transmission. In this research work, a public key cryptosystem is being implemented to store, retrieve and transmit information in cloud computation through a modified Rivest-Shamir-Adleman (RSA) algorithm for the encryption and decryption of data. The implementation of a modified RSA algorithm results guaranteed the security of data in the cloud environment. To enhance the user data security level, a neural network is used for user authentication and recognition. Moreover; the proposed technique develops the performance of detection as a loss function of the bounding box. The Faster Region-Based Convolutional Neural Network (Faster R-CNN) gets trained on images to identify authorized users with an accuracy of 99.9% on training. [ABSTRACT FROM AUTHOR]

Nowadays, medical enterprises are gradually attracted to store their data in the cloud paradigm and distribute the data between the authorized person due to the enormous growth of cloud computing and big data. However, the rapid growth of these systems has faced some crucial challenges such as data privacy and security. Presently, different cryptography techniques are used in a large amount of data processing and storage, but it is not suitable for the security of big data over cloud-based data transmission. Thus, this article presents the novel African Buffalo-based Elapid Crypto Model (AB-ECM) method for monitoring and securing the data while transferring it to the receiver. Here, the large amount of data from the cloud is compressed by the two-stage compression approach. Then, the system's security has been enhanced by the auditing phase; if the secret key of both auditing stages in the sender and receiver is the same, then only the data is decrypted. The execution of this secure process is done in the MATLAB Platform. The simulation consequences of the proposed system have been compared with the conventional methods in terms of confidential rate, data transfer rate, encryption time, resource usage, and decryption time. The comparison shows that the developed model has attained the finest security function over the existing techniques. [ABSTRACT FROM AUTHOR]

Today in this modern and digital world, people need privacy and security during digital communication of their secret information. Cryptographic techniques provide methods for secure digital communication. In this paper, we have proposed a secret message sharing algorithm using finite state machine and recurrence relation to enhance the security level of the messages which is being sent between sender and receiver. The proposed new cryptographic encryption and decryption algorithm has been implemented using Moore machine which is a type of finite state automaton and two recurrence matrices namely Fibonacci numbers and Mersenne numbers. The importance of these algorithms is that, we can send information securely through the communication channel using them. The efficiency of the proposed algorithm has been analyzed and the analysis shows high level cryptographic protection during digital communication. In these algorithms we have used multiple set of keys to encipher the original message and its inverse to decipher it again and the authenticity of algorithms is assured because these algorithms have different levels of security which enhance the chances to keep our data or information confidential and secure for long time. There are many states in Moore machine to calculate the appropriate output. In every state it takes a new recurrence relation which depends upon the input. To compute the output, we apply mathematical operation which is our cipher text. At each level we have number of cipher text which increases the data security. [ABSTRACT FROM AUTHOR]

The amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge. The problem is not with the quantity of data but how to secure the data by ensuring its confidentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non-linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C#, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution time of a cryptographic algorithm but rather the size of the security key. [ABSTRACT FROM AUTHOR]

This paper focuses on analyzing the performance of various encryption algorithms, namely RSA, ECC, and DSA, in terms of encrypting and decrypting sensitive data. Encryption is crucial for ensuring the security of data, and there are two types of encryption algorithms: Symmetric key and Asymmetric-key encryption. RSA is highly secure but has high computation time, whereas ECC provides equivalent security with lower computing power and battery usage. The study compares the implementation and analysis of DES, 3DES, AES, RSA, ECC, and DSA, highlighting their strengths and weaknesses. The paper aims to provide a comprehensive comparison of these cryptographic techniques, including their performances, to assist in selecting the most appropriate algorithm for specific applications. [ABSTRACT FROM AUTHOR]

The most commonly used public key cryptographic algorithms are based on the difficulty in solving mathematical problems such as the integer factorization problem (IFP), the discrete logarithm problem (DLP) and the elliptic curve discrete logarithm problem (ECDLP). In practice, one of the most often used cryptographic algorithms continues to be the RSA. The security of RSA is based on IFP and DLP. To achieve good data security for RSA-protected encryption, it is important to follow strict rules related to key generation domains. It is essential to use sufficiently large lengths of the key, reliable generation of prime numbers and others. In this paper the importance of the arithmetic ratio of the prime numbers which create the modular number of the RSA key is presented as a new point of view. The question whether all requirements for key generation rules applied up to now are enough in order to have good levels of cybersecurity for RSA based cryptographic systems is clarified. [ABSTRACT FROM AUTHOR]

To improve the cybersecurity of Cloud Computing (CC) system. This paper proposes a Network Anomaly Detection (NAD) model based on the Fuzzy-C-Means (FCM) clustering algorithm. Secondly, the Cybersecurity Assessment Model (CAM) based on Grey Relational Grade (GRG) is creatively constructed. Finally, combined with Rivest Shamir Adleman (RSA) algorithm, this work proposes a CC network-oriented data encryption technology, selects different data sets for different models, and tests each model through design experiments. The results show that the average Correct Detection Rate (CDR) of the NAD model for different types of abnormal data is 93.33%. The average False Positive Rate (FPR) and the average Unreported Rate (UR) are 6.65% and 16.27%, respectively. Thus, the NAD model can ensure a high detection accuracy in the case of sufficient data. Meanwhile, the cybersecurity situation prediction by the CAM is in good agreement with the actual situation. The error between the average value of cybersecurity situation prediction and the actual value is only 0.82%, and the prediction accuracy is high. The RSA algorithm can control the average encryption time for very large text, about 12s. The decryption time is slightly longer but within a reasonable range. For different-size text, the encryption time is maintained within 0.5s. This work aims to provide important technical support for anomaly detection, overall security situation analysis, and data transmission security protection of CC systems to improve their cybersecurity. [ABSTRACT FROM AUTHOR]

COVID-19 has made the world realize that the world is a whole, and international trade is the main way to connect countries. With the increase of international trade, the trade data has also become gradually huge. However, the current international trade data is still transmitted using the traditional Internet, which not only is inefficient, but also has poor security. Therefore, this paper aimed to use blockchain technology to explore the big data sharing model and key mechanism of international trade. This paper mainly introduced the design and implementation of a blockchain-based IoT data security sharing system. Firstly, the functional architecture of the prototype system was comprehensively introduced. According to the division of different functional modules, the data interaction design of different modules and the design of related smart contracts were expounded. According to the characteristics of international trade big data, the encryption and decryption algorithms are designed for the transmission of international trade big data. Finally, the prototype system was introduced from data acquisition, experimental environment deployment, system-related functional verification, and performance testing. The experimental test results showed that the encryption and decryption of transaction data by the data security sharing prototype system were more than 2 times faster than those of the traditional algorithm, and the transmission efficiency of the system at different nodes fluctuated within 10%, which showed that the system could perform security interactive sharing of data. [ABSTRACT FROM AUTHOR]

Computers and the internet are the two main communication tools used today to link the entire world together as one virtual space. So we can easily exchange lots of information within seconds of time, but the confidential data that needs to be transferred should be kept confidential. Thus, in order to aid this, we have proposed a new encryption technique by combining Image steganography (LSB) with the cryptographic RSA algorithm for providing more security to our data as well as imperceptibility. The expected outcome would be a properly secure combination of encryption models that uses steganography to hide the message content in a cover image, and also encrypts the message using the cryptographic algorithm, as an additional security layer, in case the content was retrieved from the cover image. [ABSTRACT FROM AUTHOR]

Background: The Internet of things (IoT) is the network of different objects or "things" containing sensors, software, and other technologies used to exchange data between devices and systems over the cloud. Such systems and networks should be provided with a proper cryptographic methodology to block unauthorized data transmission access. This issue is considered an essential challenge of resources that are shared on the data communication network, that is its security. So, in this study, a cryptosystem is proposed to maintain the security level of such systems with a new idea depending on DNA cryptography and DNA mixing. Results: In this study, the proposed cryptosystem is based on the RSA algorithm and DNA cryptography concepts with a novel idea for mixing DNA strands obtained from encoding medical image and report to enhance the security level through the IoT networks. This system achieved a proper result in reconstructing images with high quality. The similarity between the original data and the restored one reached 92% through 18 s. Conclusions: Such a proposed cryptosystem provided the feasibility of data security in network security, especially for E-health care through IoT system to help medical teamwork in handling medical data between hospitals safely. The result showed that RSA is a fast, efficient algorithm that can be utilized safely in cryptography schemes. [ABSTRACT FROM AUTHOR]

The Coronavirus pandemic and the work-from-anywhere has created a shift toward cloud-based services. The pandemic is causing an explosion in cloud migration, expected that by 2025, 95% of workloads will live in the cloud. One of the challenges of the cloud is data security. It is the responsibility of cloud service providers to protect user data from unauthorized access. Historically, a third-party auditor (TPA) is used to provide security services over the cloud. With the tremendous growth of demand for cloud-based services, regulatory requirements, there is a need for a semi to fully automated self sovereign identity (SSI) implementation to reduce cost. It's critical to manage cloud data strategically and extend the required protection. At each stage of the data migration process, such as data discovery, classification, and cataloguing of the access to the mission-critical data, need to be secured. Cloud storage services are centralized, which requires users must place trust in a TPA. With the SSI, this can become decentralized, reducing the dependency and cost. Our current work involves replacing TPA with SSI. A cryptographic technique for secure data migration to and from the cloud using SSI implemented. SSI facilitate peer-to-peer transactions, meaning that the in-between presence of TPA needs no longer be involved. The C2C migration performance is recorded and found the background or foreground replication scenario is achievable. Mathematically computed encrypted and decrypted ASCII values for a word matched with the output by the algorithm. The keys generated by the algorithm are validated with an online validator to ensure the correctness of the generated keys. RSA based mutual TLS algorithm is a good option for SSI based C2C migration. SSI is beneficial because of the low maintenance cost, and users are more and more using a cloud platform. The result of the implemented algorithm shows that the SSI based implementation can provide a 13.32 Kbps encryption/decryption rate which is significantly higher than the TPA method of 1 Kbps. [ABSTRACT FROM AUTHOR]

Surgical training provides a solution for the trainee surgeons living remotely and needs to improve their surgical skills learned from the experts around the globe. One of the main challenges in implementing an effective tele-training system is security vulnerabilities during data transmission. The current security solutions come at a price in terms of efficiency and performance. This research aims to enhance security during video transmission over the Internet with decreased processing time. y: The proposed system consists of a hybrid encryption model with 2D discrete wavelet transform level 1 steganography technique, which enhances security during data transmission by encrypting the data first and then hiding it in the cover image. This creates a ciphered image that is difficult to crack for the attackers. Advanced Encryption Standard (AES) and (Rivest-Shamir-Adleman) RSA algorithms are used for the encryption process. It modifies and improves the key generation part of the encryption algorithm to achieve higher security. The hybrid encryption algorithm with the modified and improved key generation enhances security by improving the entropy by 29% over the current best solution. Additionally, the average processing time of the encryption and decryption process has been reduced by 33% compared to the state of the art solution. The processing time for the encryption process has been reduced by 2.55 ~ 2.92 ms, and for the decryption process, 2.45 ~ 2.55 ms. The entropy is increased by 8.174 (average) for the proposed system against 6.895 for the existing best solution. The proposed approach is mainly focused on providing improved security to the video data transmission over the Internet by modifying and improving the key generation step. Finally, this study proposes a solution for brute-force attacks in RSA during a real-time transmission. [ABSTRACT FROM AUTHOR]

Nowadays, information security management systems are important parts of managing a system for better handling of the information security. In scenarios and situations where safety management is done by managing protection of malwares, it is important to manage security issues properly. Cryptography is an approach which makes possible for a recipient to encrypt and decrypt the information. A combination of two different strategies for encryption and decryption in the text encoding will be transformed into the used all content. The encryption and decryption key of the content decryption key is used. There are different types of information. A number, such as finding two large prime numbers with that product. The number, the size of the RSA key is large enough to make, it's hard to pinpoint these numbers. The key, known as the RSA public key, is the most prominent open encryption. Calculations were used for information exchange. In this paper, we created a program for simulation and testing of apply cryptography of Advance Encryption Standard (AES) algorithm with Rivest-Shamir-Adleman (RSA) algorithm for better performance. In this study, this program is an application of a new algorithm to be the AES&RSA principle of using a public key instead of a private key for cryptography, and the testing of encryption and decryption for the AES&RSA algorithm resulted in time is no different on the AES algorithm and more secure encryption and decryption. The results indicated that the time needed for encoding and decoding of AES&RSA algorithm has been reduced (i.e., efficiency has been improved). [ABSTRACT FROM AUTHOR]

The recent innovations in network application and the internet have made data and network security the major role in data communication system development. Cryptography is one of the outstanding and powerful tools for ensuring data and network security. In cryptography, randomization of encrypted data increases the security level as well as the Computational Complexity of cryptographic algorithms involved. This research study provides encryption algorithms that bring confidentiality and integrity based on two algorithms. The encryption algorithms include a well-known RSA algorithm (1024 key length) with an enhanced bit insertion algorithm to enhance the security of RSA against different attacks. The security classical RSA has depreciated irrespective of the size of the key length due to the development in computing technology and hacking system. Due to these lapses, we have tried to improve on the contribution of the paper by enhancing the security of RSA against different attacks and also increasing diffusion degree without increasing the key length. The security analysis of the study was compared with classical RSA of 1024 key length using mathematical evaluation proofs, the experimental results generated were compared with classical RSA of 1024 key length using avalanche effect in (%) and computational complexity as performance evaluation metrics. The results show that RBMRSA is better than classical RSA in terms of security but at the cost of execution time. [ABSTRACT FROM AUTHOR]

This study shows that a previously published cross correlation based power analysis (CCPA) attack applied to the Montgomery Ladder exponentiation steps of a Rivest Shamir Adleman (RSA) implementation can be improved by working in frequency domain. It is shown that utilizing cross correlation values of discrete Fourier transform (DFT) coefficients instead of time samples, requires lesser power traces to retrieve the key bits of the target implementation. In addition, instead of using DFT coefficients corresponding to the whole measured frequency band, using a few DFT coefficients corresponding to lower bands, even under the first harmonic of the target clock is also an improving factor on the performance of the CCPA. Practical and theoretical results are also compared to both domains. To the best of our knowledge, this is the first study to show the frequency domain applicability and superiorities in terms of horizontal CCPA type attacks. [ABSTRACT FROM AUTHOR]

The Cloud Environment provides storage for files as well as sharing services for disseminated clients. This technology helps users in the cloud to outsource their data and get good quality services from the cloud. Often, Data Integrity is a serious issue in Cloud Storage because the service provider is a semi-trusted one. Consequently, a self-determining auditing service is essential to check data integrity. In this paper, we developed a secure Cloud Storage environment without a third-party system and proposed an Improved Rivest-Shamir-Adleman Encryption Algorithm (IREA) along with the Flexible Capacity Cuckoo Filter (FCCF) auditing technique without Third Party Auditing. In this proposed system, the data owner encrypts the data using Improved RSA and stores it in the Cloud Service, and users alone can decrypt the data with the knowledge of the data owner. Furthermore, the FCCF ensures the integrity of the verification and secure data transactions can be provided by using the Two Level Quick Response (2LQR) code. The experimental results validate that the proposed IREA-FCCF with the 2LQR technique for data security in a CE has less time compared to that of the existing schemes in terms of encryption time, decryption time, signature generation, signature verification, and cost of the dynamic records. [ABSTRACT FROM AUTHOR]

A watermarking method based on a robust sparse domain is proposed in this paper, which integrates the secret information into the significant sparse elements of the original image. Our algorithm protects the original data by a two-way security process to embed confidential information. First of all, converting the watermark logo into a discrete transform coefficient (DCT) is the protection process. Then, using the dictionary learning method, the transformed coefficient is embedded in the selected effective sparse coefficient in the original image. The embedded logo is extracted from the selected effective sparse coefficient using the sparse orthogonal matching tracking algorithm (OMP) domain. Then, the discrete inverse transformation is performed. To check the algorithm's efficiency, numerous specific attacks are checked. The experimental results show that the algorithm can recover the embedded watermark with precision without losing any information. [ABSTRACT FROM AUTHOR]

Cloud computing is a diversified domain and is a huge phenomenon that is a widely preferred technology in the current times. The users are unable to utilize cloud computing to the maximum, due to challenges in the security issues. To store sensitive or useful data in an insecure region is not an option for the user. Various techniques have been developed to provide security for the big data in the cloud. During voluminous data transmissions, it will not maintain the end-to-end security and the prevailing approaches do not solve the key complexities and not provides security for the keys. The Attribute-Based Encryption (ABE) can deliver a mechanism of fine-grained control by providing one-to-many encryption. But, the revocable process of accessing the privilege of encrypted data of users from cloud servers is challenging. Further, the complex process of ABE takes up huge computational time hence it becomes a burden for system users. To solve such issues, the proposed Enhanced Cipher-text Policy-based Attribute Encryption (CP-ABE) protect, broadcast and control the access of information, especially over the cloud server. In the proposed Enhanced CP-ABE method, proxy is added to securely transmit the key to the users. The Rivest Shamir Adleman (RSA) Algorithm provides security to outsourced big data in the cloud that enables public key encryption secure data when it is being sent over an insecure network such as the internet. The proposed Enhanced CP-ABE with RSA method effectively identifies the users who decrypt the ciphertexts during decryption. The experimental results show that the proposed Enhanced CP-ABE with RSA Scheme method acquires lesser encryption and decryption times of 1638 ms and 1102 ms respectively for a 256-bit key length. Whereas, the existing methods acquire encryption and decryption times of 1721ms and 1134 ms respectively. [ABSTRACT FROM AUTHOR]

A highly secure communication method is essential for end users for the exchange of information which is not interpreted by an intruder. Cryptography plays a crucial role in the current and upcoming digital worlds, for secure data transmission in wired and wireless networks. Asymmetric and symmetric cryptographic algorithms encrypt data against vulnerable attacks and transfer to authenticated users. Steganography is a method for providing secure information with the help of a carrier file (text, video, audio, image, etc.). This paper proposes Deoxyribonucleic Acid (DNA)-based asymmetric algorithm which is used to encrypt the patient's secret information and its performance is compared with ElGamal, RSA and Diffie–Hellman (DH) cryptographic algorithms. The proposed asymmetric algorithm is applied to image steganography which is used for encrypting and concealing the patient's secret information in a cover image. The proposed method consumes less hardware resources with improved latency. Dynamic Partial Reconfiguration (DPR) allows to transform a selective area rather than complete shutdown of the entire system during bitstream configuration. Cryptosystem with DPR is designed, synthesized in Xilinx Vivado and simulated in Vivado simulator. The design is targeted at Basys3, Nexys4 DDR and Zync-7000 all-programmable SOC (AP SoC) architectures and programmed with secure partial bit files to avoid vulnerable attacks in the channel. [ABSTRACT FROM AUTHOR]

Data security in the cloud has been a major issue since the inception and adoption of cloud computing. Various frameworks have been proposed, and yet data breach prevails. With encryption being the dominant method of cloud data security, the advent of quantum computing implies an urgent need to proffer amodel that will provide adequate data security for both classical and quantum computing. Thus, most cryptosystemswill be rendered susceptible and obsolete, though some cryptosystems will stand the test of quantum computing. The article proposes a model that comprises the application of a variant of McEliece cryptosystem, which has been tipped to replace Rivest-Shamir-Adleman (RSA) in the quantum computing era to secure access control data and the application of a variant of N-th degree truncated polynomial ring units (NTRU) cryptosystem to secure cloud user data. The simulation of the proposed McEliece algorithm showed that the algorithm has a better time complexity than the existing McEliece cryptosystem. Furthermore, the novel tweaking of parameters S and P further improves the security of the proposed algorithms. More so, the simulation of the proposed NTRU algorithm revealed that the existing NTRU cryptosystem had a superior time complexity when juxtaposed with the proposed NTRU cryptosystem. [ABSTRACT FROM AUTHOR]

Nowadays sharing secure data turns out to be a challenging task for the data owner due to its privacy and confidentiality. Several IT companies stores their important information in the cloud since computing has developed immense power in sharing the data. On the other hand, privacy is considered a serious issue in cloud computing as there are numerous privacy concerns namely integrity, authentication as well as confidentiality. Among all those concerns, this paper focuses on enhancing the data integrity in the public cloud environment using Qusai modified levy flight distribution for the RSA cryptosystem (QMLFD-RSA). An effective approach named QMLFD for the RSA cryptosystem is proposed for resolving the problem based on data integrity in public cloud environment. A secured key generation and data encryption are done by employing the RSA cryptosystem thus the data is secured from unauthorized users. The key selection is done by using quasi based modified Levy flight distribution algorithm. Thus the proposed approach provides an effective model to enhance the integrity of data in cloud computing thus checking the data integrity uploaded in the public cloud storage system. In addition to this, ten optimization benchmark functions are calculated to determine the performances and the functioning of the newly developed QMLFD algorithm. The simulation results and comparative performances are carried out and the analysis reveals that the proposed QMLFD for the RSA cryptosystem provides better results when compared with other approaches. [ABSTRACT FROM AUTHOR]