Research And Ameliorate The Rate Of RSA Algorithm

Along with the fast popularization of network in the seven seas, Internet graduallypenetrates into people's daily life, and it turns into the important method of informationexchange. All of these brings the enormous convenience to the people, but it also proposes thenew challenge, and sets a higher request to the network security. Therefore effectively protectsthe security about the information which transmit in the network has been becomed more andmore important.This article studies the object of RSA password system, it belongs to the algorithm ofpublic key. In this algorithm both encryption key and algorithm can be published, and the keyof decipher is possessed by the individual user.From the day that borned the RSA algorithmbecause it had the capability of highly security and be operated easily that received thesuperfluity attention and it was used widespreaded. At present, RSA algorithm is involved inmany cryptographic systems. But inrecent years because the ability of analyzes the greatinteger to be strengthened day by day, in order to guaranteed the RSA algorithm's securityalways has to increase the length of modulus, that causes the encryption and decipheroperation have to calculate the large number about the function of model and power, thisalways the bottleneck question restricts its application which prolonges the time ofexecution, therefore this paper has made the correlation improvement in the aspect of speedabout the RSA algorithm.At first of this article has thorough carefully researched the principle of RSA passwordsystem, that builds the favorable rationale for the improvement of the algorithm; Next hasanalyzed the RSA password system's security, discusseds many methods attack to RSA, aswell as how makes corresponding processing in the correlation algorithm to resist theseattacks; Once more, this article to make the exhaustive analysis in several factors whichaffected the speed of the algorithm. Through a series test data found that after theimprovement its speed has been enhanced truly. According to the result of analyse, improvesthe algorithm in three aspects, that is Recursive Sure of Residues, Symmetry of ModuloMultiplication and the test of prime number. This article also proposed the thought of pretreatment table, namely that when theinformation which need to encrypt all of them are English ,that can produce a data sheet inadvance, which places all the cryptographes of the possibly letters, then in followingtransformation which from definite orders to cryptograph, you can looks up the informationfrom the table that save the calculate time extremlely. The pretreatment table algorithm savesthe time relate with how many definite orders the indefinite information have, more definiteorders moer saves the time.