Login
Register
Submit a Paper
Propose a Special lssue
Open Access
ABSTRACT
Faster RSA Algorithm for Decryption Using Chinese Remainder Theorem
Principal, Indira Gandhi (Sr.) College, CIDCO, New Nanded.(M.S.)
Mahatma Gandhi College, Amedpur Dist Latur (M.S.)
The International Conference on Computational & Experimental Engineering and Sciences 2008, 5(4), 255-262. https://doi.org/10.3970/icces.2008.005.255
Download PDFAbstract
E-business security is an overarching business issues that, based of an analyzed risks, and establishes the threat acceptance and reduction parameters for the safe use of technology. As an overarching issue, e-business security can be thought of as being absolutely fundamental to the effective and efficient use of Information Technology in support of e-business.This paper proposed four time faster RSA-CRT algorithm for decryption of data and effective representation of encryption using Chinese Remainder Theorem (CRT) for the data security. The algorithm is implemented in Java source code.
Keywords
Cite This Article
APA Style
Shinde, G., Fadewar, H. (2008). Faster RSA algorithm for decryption using chinese remainder theorem. The International Conference on Computational & Experimental Engineering and Sciences, 5(4), 255-262. https://doi.org/10.3970/icces.2008.005.255
Vancouver Style
Shinde G, Fadewar H. Faster RSA algorithm for decryption using chinese remainder theorem. Int Conf Comput Exp Eng Sciences . 2008;5(4):255-262 https://doi.org/10.3970/icces.2008.005.255
IEEE Style
G. Shinde and H. Fadewar, “Faster RSA Algorithm for Decryption Using Chinese Remainder Theorem,” Int. Conf. Comput. Exp. Eng. Sciences , vol. 5, no. 4, pp. 255-262, 2008. https://doi.org/10.3970/icces.2008.005.255
Copyright © 2008 The Author(s). Published by Tech Science Press.This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Downloads
Citation Tools
