A novel modular multiplication algorithm and its application to RSA decryption
The services such as electronic commerce, internet privacy, authentication, confidentiality, data integrity and non repudiation are presented by public key cryptosystems. The most popular of public key cryptosystems is RSA cryptosystem. RSA is widely used for digital signature and digital envelope, which provide privacy and authentication. The basic operation of RSA cryptosystem is modular exponentiation which is achieved by repeated modular multiplications. RSA can be speeded up by using the Chinese Remainder Theorem (CRT) and using strong prime criterion. In this paper, we present an efficient modulo n multiplication algorithm with reasonable factors of 2n and 2n+2. In this paper we discuss decryption techniques in RSA cryptosystem. We show that this new technique can speed up the decryption process and it can reduce the computational time compared to the methods of traditional, CRT), and Hwang et al.[10] .
Keywords: RSA cryptosystem; modular multiplication; Chinese Remainder theorem;prime factors
Download Full-Text
ABOUT THE AUTHORS
G.A.V.Rama Chandra Rao
G.A.V. Rama Chandra Rao received the M.Tech. degree in Computer Science and Technology from GITAM University. He is pursuing his Ph.D. in computer science and Engineering from GITAM University. His current research interests include cryptography and network security.
P.V.Lakshmi
P.V. Lakshmi received the M.Tech. degree in Computer Science and Engineering and the Ph.D. degree in Computer Science and Engineering from Andhra University. She is now Professor & Head in the Department of information technology, GIT, GITAM University. Her current research interests include Bioinformatics, cryptography, and Network security. She had published more than 25 research papers on the above research fields. She has more than 15 years experience in teaching.
N.Ravi Shankar
N. Ravi Shankar received the M.Sc. degree in Applied Mathematics, M.Tech. degree in Computer Science and technology with bioinformatics as specialization, and the Ph.D. degree in Applied Mathematics from Andhra University. He is now Associate Professor & BoS Chairman in the Department of Applied Mathematics, GIS, GITAM University. He is also on the editorial boards of several journals. His current research interests include Operations research, Group theory and its applications, fuzzy set theory, bioinformatics, rough set theory, cryptography, and graph theory. He had published more than 45 research papers on the above research fields. He has more than 20 years experience in teaching.
G.A.V.Rama Chandra Rao
G.A.V. Rama Chandra Rao received the M.Tech. degree in Computer Science and Technology from GITAM University. He is pursuing his Ph.D. in computer science and Engineering from GITAM University. His current research interests include cryptography and network security.
P.V.Lakshmi
P.V. Lakshmi received the M.Tech. degree in Computer Science and Engineering and the Ph.D. degree in Computer Science and Engineering from Andhra University. She is now Professor & Head in the Department of information technology, GIT, GITAM University. Her current research interests include Bioinformatics, cryptography, and Network security. She had published more than 25 research papers on the above research fields. She has more than 15 years experience in teaching.
N.Ravi Shankar
N. Ravi Shankar received the M.Sc. degree in Applied Mathematics, M.Tech. degree in Computer Science and technology with bioinformatics as specialization, and the Ph.D. degree in Applied Mathematics from Andhra University. He is now Associate Professor & BoS Chairman in the Department of Applied Mathematics, GIS, GITAM University. He is also on the editorial boards of several journals. His current research interests include Operations research, Group theory and its applications, fuzzy set theory, bioinformatics, rough set theory, cryptography, and graph theory. He had published more than 45 research papers on the above research fields. He has more than 20 years experience in teaching.