Rsa's An Improved Fast Algorithm For The Design And Realization

Today, the world has been connected more and more closely with the rapid development of the Internet. This has brought great benefits to people. However, at the same time, it also brought many serious problems, among which the information security is the leading one. Since there are so many sensitive and important data on the Internet, more and more attention has been paid to the information security. To ensure the security of information, in the technique, the general way is through the methods of cryptograph. Cryptography is the core of the information security. Modern cryptograph is divided into the public key system and the private key system. The private key system is also called the single key system, in which the encryption process is the same as the decryption process. The public key system is also called the double key system, where the encryption process is different with the decryption process. Since the public key system can publish its public key and keep its private key secret, it has many new applications such as the digital signature and authentication, which is widely used in every field of the society. RSA is a crucial and significant public-key cryptosystem. However the time-consuming modulo exponentiation 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 encryption and decryption. The first chapter introduces the domestic and foreign progress of cryptograph; the RSA related tendency as well as the meaning of the research. The second chapter discusses some concepts concerning information security. The third chapter explains cryptograph. The fourth chapter describes and analyzes the RSA algorithm. The fifth chapter discusses the improvement of the RSA algorithm including the big number...