Table of Content

Open Access iconOpen Access

ABSTRACT

Faster RSA Algorithm for Decryption Using Chinese Remainder Theorem

G.N. Shinde1, H.S. Fadewar2

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

Abstract

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

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



cc 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.
  • 1486

    View

  • 5509

    Download

  • 0

    Like

Share Link