Safety Analysis of Reverse Algorithm Encryption in Databases

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.

Cryptographic technique is one of the principal means to protect information security. Not only has it to ensure the information confidential, but also provides digital signature, authentication, secret sub-storage, system security and other functions. Therefore, the encryption and decryption solution can ensure the confidentiality of the information, as well as the integrity of information and certainty, to prevent information from tampering, forgery and counterfeiting. Encryption and decryption algorithm's security depends on the algorithm while the internal structure of the rigor of mathematics, it also depends on the key confidentiality. Key in the encryption algorithm has a pivotal position, once the key was leaked, it means that anyone can be in the encryption system to encrypt and decrypt information, it means the encryption algorithm is useless. Therefore, what kind of data you choose to be a key, how to distribute the private key, and how to save both data transmission keys are very important issues in the encryption and decryption algorithm. This paper proposed an implementation of a complete and practical RSA encrypt/decrypt solution based on the study of RSA public key algorithm. In addition, the encrypt procedure and code implementation is provided in details.

We design an algorithm to merge both RSA algorithm and Diffie-Hellman Algorithm of them to provide a user with even higher level of data security. Actually, our intent is to secure data of smaller as well as larger size by obtaining one randomly chosen key pair from set of RSA keys and one randomly chosen secret key using Diffie-Hellman algorithm and then applying RSA encryption to make even public components of Diffie-Hellman algorithm inaccessible for any eavesdropper freely. Encrypted exchange of public components of Diffie-Hellman part of the system makes it hidden from all other than intended users to see Diffie-Hellman generator and prime modulus. This will make our algorithm M*N times complex to break using even the latest version of Brute Force attack, where M and N are corresponding complexities imposed by the Diffie-Hellman and RSA algorithms respectively. Encryption algorithms play a main role in information security systems. On the other side, those algorithms consume a significant amount of computing resources such as CPU time, memory, and battery power. This paper provides evaluation of five of the most common encryption algorithms namely: AES (Rijndael), DES, 3DES, RC2, Blowfish. A comparison has been conducted with our proposed algorithm.

A novel quantum gray-level image encryption and decryption algorithm based on image correlation decomposition is proposed. The correlation among image pixels is established by utilizing the superposition and measurement principle of quantum states. And a whole quantum image is divided into a series of sub-images. These sub-images are stored into a complete binary tree array constructed previously and then randomly performed by one of the operations of quantum random-phase gate, quantum revolving gate and Hadamard transform. The encrypted image can be obtained by superimposing the resulting sub-images with the superposition principle of quantum states. For the encryption algorithm, the keys are the parameters of random phase gate, rotation angle, binary sequence and orthonormal basis states. The security and the computational complexity of the proposed algorithm are analyzed. The proposed encryption algorithm can resist brute force attack due to its very large key space and has lower computational complexity than its classical counterparts.

In order to promote the research process of information security in the whole society, improve the safety factor of computer data communication, strengthen computer security management, the author proposes a computer data encryption strategy that combines the strong security of the 3DES encryption algorithm and the asymmetric encryption advantages of the RSA algorithm. Through the detailed analysis of DES encryption algorithm and 3DES encryption, creatively uses the RSA encryption algorithm to improve the single 3DES algorithm, consolidates the performance of the 3DES encryption algorithm to ensure data communication, and ensures the data integrity, better improve encryption performance. Experiments show that: The proposed encryption algorithm improves security performance by 10 times, and the response efficiency is only 1 ms away from other algorithms, compared with other algorithms, it has better encryption performance and is suitable for actual computer data communication scenarios. Conclusion: The encryption algorithm proposed by the author has achieved good results in terms of security performance and response efficiency, it is suitable for actual computer data security communication and can effectively improve computer security management.

The proposed method is a mixture of several security methods namely digital authentication tag along with the data mining in the DNA database. Data mining in the area of human genetics, an important goal is to understand the mapping relationship between the individual variation in human DNA sequences and variability in various algorithms for database security issues, for mutation susceptibility and parental identification differences. This paper primarily deals with the advancement of genetic algorithm with proper security features in DNA Databases and it enhances the special features in DNA database security. Several security methods include encryption algorithms, higher, not as much of multifaceted with trouble-free to apply in DNA Databases, used for protected database. The Reverse Encryption algorithm to protect data,Advance Cryptography algorithm to resist data, also Advanced Encryption Standard (AES) is most preferable for security in DNA databases.

In the past few years, several security algorithms such as encryption and watermarking algorithms have been put forward in order to ensure the security of the digital image from attackers. Most of the encryption algorithm make use of relatively small key spaces and hence it provides less security to attackers.The proposed system make use of an image encryption algorithm that is working on the principle of Rubik's cube. Watermarking techniques are added to the image before applying Rubik's cube algorithm so as to provide more security for the digital image. The above algorithm is applied on both RGB images and ARGB images and a comparison evaluation is done between the two image types using various performance metrics.

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.

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.

With recent advancements in multimedia technologies, the security of digital data has become a critical issue. To overcome the vulnerabilities of current security protocols, researchers tend to focus their efforts on modifying existing protocols. Over the last few decades, though, several proposed encryption algorithms have been proven insecure, leading to major threats against important data. Using the most appropriate encryption algorithm is a very important means of protection against such attacks, but which algorithm is most appropriate in any particular situation will also be dependent on what sort of data is being secured. However, testing potential cryptosystems one by one to find the best option can take up an important processing time. For a fast and accurate selection of appropriate encryption algorithms, we propose a security level detection approach for image encryption algorithms by incorporating a support vector machine (SVM). In this work, we also create a dataset using standard encryption security parameters, such as entropy, contrast, homogeneity, peak signal to noise ratio, mean square error, energy, and correlation. These parameters are taken as features extracted from different cipher images. Dataset labels are divided into three categories based on their security level: strong, acceptable, and weak. To evaluate the performance of our proposed model, we have performed different analyses (f1-score, recall, precision, and accuracy), and our results demonstrate the effectiveness of this SVM-supported system. INDEX TERMS Support vector machine (SVM), security analysis, image encryption, cryptosystem.

Security and the privacy features concerning e-banking needs to be improved rapidly to continue its growing. It is really difficult to ensure enough adequate security by using the conventional algorithms for a long time period, due to recent advances such as high progress in cryptanalysis techniques, improvement of computing skills and continuous hacking trials. This paper refers important issues regarding how to enhance the transition to more secure cryptographic and encryption algorithms in the financial sector. This paper recommends that adopting and implementing open source applications following international standards can be considered as a good replacement to the conventional algorithms to offer more enhancement security techniques and highest performance encryption algorithms for e-banking transaction services. We proposed a modified algorithm for AES, in which substitute byte, shift row will remain as in the original AES while mix column operation is replaced by 128 permutation operation followed by add round key operation. Comparative study with traditional encryption algorithms is shown the superiority of the modified algorithm and its high ability to overcome the problem of computational overhead. We additionally suggested another level of e-banking security services using Confidence Building Metric (CBM). The CBMs are computed based on certain parameters and can be implemented on any platform at the client side.

Because data digitisation is so common, it is necessary to encrypt messages while they travel over unprotected channels. The communication is encrypted before it is sent. Encryption cannot function without both a technique and a key. It is crucial to take additional measures to safeguard the privacy and confidentiality of the receivers when transmitting sensitive images over an unsecured network such as the internet. Regardless of the fact that there is no standardisation for these algorithms Combining standard public key cryptosystems like RSA and El-gamal with chaos-based cryptosystems like Chebyshev polynomials can improve security in a manner similar to AES, DES, RSA, etc. Although AES and other classical algorithms have been standard for some time, many security experts now recommend chaos-based encryption approaches for media files due to their computational efficiency. Because existing algorithms are unsuited for real-time picture encryption due to their poor encryption speeds and the high processing needs of secure encryption methods, researchers have proposed bespoke algorithms for image encryption. One of the better techniques is chaotic encryption, which uses cypher text that is unpredictable enough to greatly decrease the likelihood of decipherment when applied to images. Consequently, research into digital picture encryption algorithms based on chaotic technology has become an important tool for modern digital image encryption. We go over all the new features and improvements in picture encryption. With an eye towards evaluating them and giving academics and practitioners the context they need to understand the methods' current position, this study aims to introduce and summarise the currently used photo encryption algorithms and metrics. This study rates the different photo encryption algorithms based on their strengths and weaknesses after examining them. Furthermore, the assessment matrices used to evaluate the performance and security of the encryption algorithms in recent studies have been validated by comparative analysis.The article also reviews these metrics in detail and provides upper and lower bounds for a set of efficiency, quality, and security evaluation criteria for image encryption algorithms.

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.

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.

The primary operation performed by cloud computing is to provide dynamic storage capacity and security to its users. The main benefit from using the cloud computing is the reduction in the economic expenditure and ease in the accessibility of data. This whole mechanism involves various security algorithms; still there are some security issues which needs to be solved. In this paper, various security algorithms have been discussed in order to analyze the performance of the algorithms and to find out that which encryption algorithm is better for the data protection in the cloud computing platform. The mainly concerned algorithms in this paper are RSA Algorithm and Modification in RSA Encryption Algorithm (MREA). One of the modifications in RSA encryption algorithm is named as Homomorphic Encryption Algorithm.