Application Research of Data Encryption Algorithm in Computer Security Management

Data encryption IS defined as a method of transforming information into a coded format, ensuring that only authorized individuals can successfully decode and comprehend the content. In addition, cryptography is principally categorized into two distinct types: symmetric key cryptography and asymmetric key cryptography. In this research, we conduct a comparative analysis of two cryptographic systems: RSA (asymmetric) and AES (symmetric key), specifically evaluating their performance in data encryption for point-to-point communications. The analysis focuses on the speed of file encryption and decryption as well as the length of the encrypted data. Experimental results reveal that both RSA and AES are robust encryption algorithms; however, AES outperforms RSA in terms of both encryption and decryption speeds while also producing a smaller remaining data size that could not be encrypted due. Finally, the paper has outlined strengths and weaknesses of reviewed algorithms which make it possible to effectively put these algorithms together in protecting information and satisfying the security needs of applications. Keywords: Encryption – Decryption– Cryptosystems– Encryption Algorithm- RSA– AES.

Encryption provides security for databases. This paper provides a new encryption algorithm ,”Reverse Encryption Algorithm (REА)“. Furthermore, designing a REA algorithm has improved data encryption security. Safe and successful proposed encryption algorithm REA is evaluated and compared with the most common encryption algorithms. The designing of the REA algorithm also improves the security of data encryption. Additionally, the safety and the performance of the suggested encryption algorithm REА represents evaluation and enhancement with the most common encryption algorithms. Experimental results show that the proposed encryption algorithm REA surpasses other encryption algorithms in performance and security of databases. All in all, the proposed encryption algorithm REA achieves a balance between security and efficiency.

With the continuous development of computer technology, people pay more and more attention to data information security. Traditional cryptographic algorithms can no longer meet the needs of computer communication. Based on DES encryption algorithm as the core idea to design a highly confined conditional memory (MAC), which is used to prevent unauthorized disclosure of important files and sensitive content, it uses ciphertext computing method for secret communication and combines it with ordinary channel to achieve protective measures for data information security. In this paper, a computer information security technology based on ciphertext computing is designed using DES encryption algorithm, which mainly uses triple DES (3DES) encryption algorithm to encrypt the original plaintext data to protect important files and sensitive information so that they can be used for storage and transmission after encryption, which can ensure the integrity of data.

Now a days, as more and more information is communicated via computers, the need is to ensure that this information is secure and information can be secured by the means of encryption algorithms. Securing information refers to the methodologies that are implemented to protect sensitive information from misuse or disclosure as it causes risk. Encryption is the process of conglomerating or scrambling a message so that only the intended recipient can read it. With the fast progression of digital data exchange in electronic way, Information security is becoming much more important in data storage and transmission. With the evolution of human intelligence, the art of cryptography has become more complex in order to make information more secure. Various encryption algorithms are deployed to make information more secure. In this paper, a survey of RSA, DES and AES encryption algorithms are presented.

Cloud is an evolving computing technology in which the services are provisioned dynamically through internet. The users’ data are stored in the remotely located servers that are maintained by cloud providers. The major security challenge in cloud is that the users cannot have direct control over the remotely stored data. To preserve the privacy of user’s data stored in the cloud, an efficient algorithm maintaining the confidentiality of data is proposed. We ensure that the data stored in the untrusted cloud server is confidential by developing a new data encryption algorithm. Unlike other encryption algorithms, our encryption algorithm needs lesser computation overhead. Encryption and decryption algorithms are developed in java and Remote Method Invocation (RMI) concepts are used for communication between client and server. Simulation environment is set up with the eucalyptus tool. This technique provides the data confidentiality with minimum computational overhead of the client.

Nowadays, the development of information technology can be described as extremely rapid, especially with the widespread use of the Internet; the security of communications in the network has become an important issue we are facing. The purpose of this article is to solve the problems in today’s network security data encryption algorithms. Starting from the computer network communication security data encryption algorithm, we discuss the effects of several different encryption methods on improving network security. The research results show that it is known that the application of link encryption algorithm in network communication security encryption algorithm can increase the security index by 25%, the node encryption algorithm can increase the security index by 35%, and the end‐to‐end encryption algorithm can make the cyber activity safety index to increase by 40%. Among them, RSA algorithm and DES algorithm are two very representative algorithms; they represent different encryption systems. From the perspective of network data link, there are three methods of encryption algorithm, namely, link encryption algorithm, node encryption algorithm, and end‐to‐end encryption algorithm.

CSCW (computer supported cooperative work) means a group of people cooperate to finish the same task with the help of computers. Under such a working environment, a safety mechanism is vital important to ensure unwanted information leakage. At present the encryption algorithms widely used in CSCW system are inefficient, and can't realize the real-time communication model satisfactorily. DES and ECC are both widely recognized data encryption algorithms, which have already been applied to CSCW security system, but each has his own strengths and weaknesses. DES is efficient but its key is easily revealed; the key of ECC is well managed, but the process efficiency is lower than DES. This paper puts forward a combined encryption algorithm based on 3DES and ECC to improve the performance of the CSCW system encryption. It is proved that the algorithm is feasible and effective.

In this digital era, people are moving fast towards cloud and big data; hence, it becomes very important for the organization to encrypt the data. To enable secure data communication, the user needs different encryption algorithms. The encryption algorithms are RC4, RC5, SHA, DES,3DES, AES, etc. The mostly used algorithm is the Advanced Encryption Standard [AES]. This utilizes symmetrical keys, where the keys are shared between transmitter and receiver, i.e., the key will be easily hijacked by attackers. In this paper, we proposed the system working on three phases. Firstly, the custom replacement for input values like one character replaced by another character. Secondly, encrypt the data by using AES dynamic keys. To generate a key using 16 bytes, data frame is sending sequentially. Based on the order of this sequence, the key is changed dynamically with encrypted data and finally add padding bits to the ciphertext to provide more security to data or information.

Pattern matching is widely used in applications such as genomic data query analysis, network intrusion detection, and deep packet inspection (DPI). Performing pattern matching on plaintext data is straightforward, but the need to protect the security of analyzed data and analyzed patterns can significantly complicate the process. Due to the privacy security issues of data and patterns, researchers begin to explore pattern matching on encrypted data. However, existing solutions are typically built on static pattern matching methods, lacking dynamism, namely, the inability to perform addition or deletion operations on the analyzed data. This lack of flexibility might hinder the adaptability and effectiveness of pattern matching on encrypted data in the real‐world scenarios. In this paper, we design a dynamic pattern matching scheme on encrypted data with forward and backward security, which introduces much‐needed dynamism. Our scheme is able to implement the addition operation and the deletion operation on the encrypted data without affecting the security of the original pattern matching scheme. Specifically, we design secure addition and deletion algorithms based on fragmentation data structures, which are compatible with the static pattern matching scheme. Moreover, we make significant improvements to the key generation algorithm, the encryption algorithm, and the match algorithm of the static scheme to ensure forward and backward security. Theoretical analysis proves that our scheme satisfies forward and backward security while ensuring the nonfalsifiability of encrypted data. The experimental results show that our scheme has a slight increase in time cost compared to the static pattern matching scheme, demonstrating its practicality and effectiveness in dynamic scenarios.

Homomorphic encryption facilitates secure computations on encrypted data without necessitating decryption, thereby ensuring robust protection of sensitive information. Nevertheless, these computations impose substantial performance overheads due to their inherent complexity. This research proposes an innovative approach that amalgamates GPU and FPGA acceleration, dynamic code generation, and parallelization to enhance the performance and scalability of homomorphic encryption algorithms.Our methodology employs GPU acceleration to harness the parallel processing capabilities of GPUs, FPGA acceleration to exploit custom, application-specific hardware configurations, dynamic code generation to produce optimized machine code, and automatic parallelization to distribute computations across multiple processing units. WE demonstrate the efficacy of our approach through extensive benchmarking against existing optimization strategies. Our findings reveal that this comprehensive optimization significantly reduces computational overhead and bolsters the performance of homomorphic encryption algorithms, particularly when processing large datasets. In summary, the proposed approach offers a practical solution for augmenting the performance of homomorphic encryption, rendering it suitable for real-world applications involving confidential data. Our contributions hold significant ramifications for the domains of cybersecurity and data privacy and provide fertile ground for future research endeavours.

In this paper, a new model of 2D absolute sine-cosine coupling (2D-ASCC) is proposed. In comparison with other 2D chaos map, the proposed system has higher complexity and better property of pseudo-random. It can effectively improve the security performance of encryption algorithm, if the proposed chaos map is applied in the design of image encryption algorithm based on chaos. Then, a new diffusion algorithm is designed based on the jumping diffusion. The plaintext is divided into two groups, and each group of plaintext is encrypted with a different formula. The pixel value of each ciphertext is composed of several non-adjacent pixels and the pseudo-random values generated by the proposed chaos map. In comparison with some existing encryption scheme, by using the design encryption scheme, the plaintext image can be completely encrypted in one iteration, it can significantly increase the security of algorithm and reduces the correlation between adjacent pixels. Finally, by using the numerical simulation and the security analysis, the effectiveness of the encryption algorithm is verified, and the comparison results show the higher security of the design encryption algorithm.

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Processing.

The growing use of tele This paper presents a new secret diffusion scheme called Round Key Permutation (RKP) based on the nonlinear, dynamic and pseudorandom permutation for encrypting images by block, since images are considered particular data because of their size and their information, which are two-dimensional nature and characterized by high redundancy and strong correlation. Firstly, the permutation table is calculated according to the master key and sub-keys. Secondly, scrambling pixels for each block to be encrypted will be done according the permutation table. Thereafter the AES encryption algorithm is used in the proposed cryptosystem by replacing the linear permutation of ShiftRows step with the nonlinear and secret permutation of RKP scheme; this change makes the encryption system depend on the secret key and allows both to respect the second Shannon’s theory and the Kerckhoff principle. Security analysis of cryptosystem demonstrates that the proposed diffusion scheme of RKP enhances the fortress of encryption algorithm, as can be observed in the entropy and other obtained values. communications implementing electronic transfers of personal data, require reliable techniques and secure. In fact, the use of a communication network exposes exchanges to certain risks, which require the existence of adequate security measures. The data encryption is often the only effective way to meet these requirements. This paper present a cryptosystem by block for encrypting images, as images are considered particular data because of their size and their information, which are two dimensional nature and characterized by high redundancy and strong correlation. In this cryptosystem, we used a new dynamic diffusion technique called round key permutation, which consists to permute pixels of each bloc in a manner nonlinear, dynamic and random using permutation table calculated according to the master key and sub-keys. We use thereafter the AES encryption algorithm in our cryptosystem by replacing the linear permutation of ShiftRows with round key permutation technique; this changing makes the encryption scheme depend on encryption key. Security analysis of cryptosystem demonstrate that the modification made on using the proposed technique of Round Key Permutation enhances the fortress of encryption algorithm, as can be observed in the entropy and other obtained values.

With today's development and expansion of networks and internet-connected devices, information security is an issue of increasing concern. Confidentiality is one of the focuses in network security for digital communication systems, where large data blocks go through a cryptographic algorithm with a cipher key that increases the security and complexity of the output ciphertext. For the past several years, multiple security algorithms have been developed and utilized in the data encryption process, such as the Data Encryption Standard (DES), Triple Data Encryption Standard (3DES), and the current one, designated by the U.S. National Institute of Standards and Technology (NIST), the Advanced Encryption Standard (AES). AES is a symmetric encryption algorithm that has a minimum input data block size of 128-bits which undergo a series of permutations, substitutions, and digital logic operations over several rounds. Encryption algorithms are always improving on ciphertext complexity, required hardware storage allocation, and execution time. Field Programmable Gate Arrays (FPGA's) are a hardware alternative for encryption algorithm implementation because, although the logic units in it are fixed, the functions and interconnections between them are based on the user's design which allow for improvement. The research presented focuses on the development and analysis of an efficient AES-128 Mix Columns algorithm implementation, utilized in the data block encryption rounds, on an Altera Cyclone IV FPGA using the Intel Quartus II software and Verilog Hardware Description Language.

Confidentiality and data integrity are two important security services that are provided by the most popular VPN protocols such IPsec and SSL/TLS. It is a well-known fact that security comes at the cost of performance, and performance is affected by the cryptographic algorithms and their execution. In this study, confidentiality and data integrity processes were implemented using client--server Java applications in a real LAN to assess their performance based on different encryptions methods. The execution time of data encryption, data decryption, and data integrity verification was measured and total session times were computed for the following encryption algorithms AES, Blowfish, 3DES, RC2, MD5, and SHA-1. The observation results have been analyzed and the performance of these encryption algorithms and digest ciphers was compared, interpreted, and outlined in terms of total session time and different security parameters (data integrity, encryption, decryption, and data integrity verification).