Research Of RSA Encryption Algorithm

Computer network technology, whose application has gone deep into almost every field of human life and social activity, has bee further popularized and developed since 1990s, but it is a very important question to guarantee information security. Various encryption algorithms have been presented to meet different security technology and application needs. RSA, whose security and property has been affirmed continually in its widespread application, is generally established as an excellent cryptosystem. RSA has become the most popular cryptosystem.RSA is a crucial and significant public key cryptosystem. However, the time-consuming modulo exponentiation computation, which has always been the bottle-neck of RSA. According to RSA theory, we need to compute every data by, in which 'c' stands for the encrypted data, 'm' stands for the pre-encrypted data, 'e' stands for the public key, 'n' stands for the mode. If the value of 'e' is too small, it is hard to improve its security. As a result, a great amount of time is needed for integer computation. Therefore, various improved algorithms have been developed to realize RSA, such as SMM, RSR, etc. This paper works out the key point of accelerating computation by analyzing several famous computations, and then applies it into construction encryption selectively to further improve the speed of RSA encryption.Firstly, this paper introduces the mathematical the basis of encryption algorithm, and analyzed the RSA theory from mathematical theory. Secondly, it analyzed several RSA algorithms and the theory to accelerate computation. Thirdly, it represents an improved algorithm, which combines SMM into system, and the traditional RSA to improve the processing of encryption and decryption. Fourthly, a program which implies this algorithm and comparisons between and it are made. Finally, a simple file encryption program is developed by this algorithm.