Font Size: a A A

Research And Implementation Of RSA Algorithm

Posted on:2011-09-30Degree:MasterType:Thesis
Country:ChinaCandidate:Y HuFull Text:PDF
GTID:2178360308461100Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
Along with the fast popularization of network in the seven seas, Internet gradually penetrates into people's daily life, and it turns into the important method of information exchange. All of these bring the enormous convenience to the people, but it also proposes the new challenge, and sets a higher request to the network security. Therefore effectively protects the security about the information which transmit in the network has been became more and more important.This article studies the object of RSA algorithm, it belongs to the algorithm of public key. In this algorithm both encryption key and algorithm can be published, and the key of decipher is possessed by the individual user. From the day that borned the RSA algorithm because it had the capability of highly security and be operated easily that received the superfluity attention and it was used widespread. At present, RSA algorithm is involved in many cryptographic systems. But in recent years, as a result of the ability of analyzes the great integer to be strengthened day by day, we have to increase the length of prime to guarantee the RSA algorithm's security. However the time-consuming modular exponent-iation computation which has always been the bottleneck of RSA, restricts its wider application. This paper presents an optimized algorithm, which enhances the original algorithm and improves the efficiency of the processing of making big prime, RSA algorithm.At first of this article has thorough carefully researched the principle of RSA algorithm, that builds the favorable rationale for the improvement of the algorithm; Next has analyzed the RSA algorithm's security, discussed many methods attack to RSA, as well as how chooses the right parameter to resist these attacks; Once more, this paper studies the relevant sub-algorithm of RSA, proposes a new algorithm of how to make a prime on the basis of the commonly used algorithm for generating big prime and analyzes the performance of the new algorithm; At last, implement the new algorithm and through a series test data show that its speed has been enhanced truly.Although this paper makes some improvement to the RSA algorithm, there are still some aspects to be improved later.
Keywords/Search Tags:RSA, Montgomery's modular multiplication, modular, exponentiation algorithm, multiple-precision integer arithmetic
PDF Full Text Request
Related items