A non-Symmetric Key Dependent for Reverse Encryption Algorithm (REA)

Cryptography is used essentially for protecting information by using the encryption algorithms. It is assumed that the encryption algorithm must have minimal requirements for securing any such information. Therefore, A poor structure of any encryption algorithm can cause insecure product cipher and then puts the highly sensitive information or infrastructure at risk. This paper analyzes the performance of one algorithm called with Reverse Encryption Algorithm (REA). According to Shannon confusion and diffusion concept, we found this algorithm is not able to support a symmetric key encryption algorithm in the critical analysis. In addition, our experiments proved that the decryption of this algorithm is also nonsymmetric key dependent. Reverse engineering attack was exploited these weakness and vulnerabilities to reverse transformation of the ciphertext to obtain the plaintext. Therefore, any application supports this type of encryption is vulnerable for the primitive cryptanalysis. This paper purpose is to analyze the encryption algorithm functionality and structure and to identify the issues that can be exploited to attack this algorithm.