Analysis of the formation of a dynamic brief key algorithm RC4+ for file security

Abstract

Abstract The development of technology, makes it easy for us to communicate and exchange information and can also have an impact on the development of cryptographic algorithms. An algorithm that is used to do encryption and decryption must not only be correct, but also must be used efficiently. An algorithm is said to be efficient if the algorithm uses relatively smaller memory and has a fast processing time. So far, many studies have discussed the efficiency of an algorithm. Regarding the measurement of time and memory space needed is known as algorithm complexity. The complexity of the algorithm itself can be interpreted as a number of computational steps carried out by an algorithm to solve problems. The RC4 + algorithm is a symmetric algorithm that is used to encrypt and decrypt messages, and use the same key in the encryption-decryption process. The key used is the RC4 + session key key. In the result, the amount of memory needed by the modified RC4 + Algorithm is more. Execution time or runtime The modified RC4 + algorithm for encryption and decryption is much faster than the original algorithm.