Font Size: a A A

Improved Rsa Algorithm

Posted on:2011-08-09Degree:MasterType:Thesis
Country:ChinaCandidate:K Y HeFull Text:PDF
GTID:2208330332477067Subject:Software engineering
Abstract/Summary:PDF Full Text Request
According to the requirements of computer security technology and application requirements, put forward many encryption algorithm. RSA algorithms was recognized as a global excellent encryption algorithm, not only can one password, also can be used to encrypt digital signatures and identity verification.According to RSA theory, we need to compute every data by. If the value of'e'is too small,it is hard to improve its security .As a result,a lot of time is needed for large number modular power multiplication computation. Therefore,various improved algorithms have been developed to realize RSA,such as SMM,the sliding window algorithm,etc.A new fast RSA algorithm is presented in this paper, which is an improvement of a fast RSA algorithm based on symmetry of modulo multiplication (SMM algorithm), In the algorithm based on SMM iterative computation moves further reduce.This paper puts forward a kind of combination of traditional algorithm, namely in the RSA algorithms and sliding window exponentiation algorithm to optimize the combination on the basis of further SMM combination algorithm, and further improve the speed of encryption and decryption;Final,a simple file encryption program is developed by this algorithm. It Can be used for file encryption and decryption files can also be used to operate. Input from users can generate keys, or to use for users to choose. If you want to execute encryption operation, can let a program to generate keys (also can use to designated). Decryption operation must be input from users decryption keys. The key to use input file encryption and decryption, get encrypted files or reduction of the original documents.
Keywords/Search Tags:cryptography, RSA, Public key cryptosystem, large number modular power multiplication, fast algorithm
PDF Full Text Request
Related items