Role of Chinese Remainder Theorem in Cryptography
V.KEERTHIIKA, M.Sc., M.Phil., Assistant Professor in Sri Krishna College of Engineering and Technology, Coimbatore.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 256-258 | Volume-8 Issue-6, August 2019. | Retrieval Number: E7522068519/2019©BEIESP | DOI: 10.35940/ijeat.E7522.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Strength of the network security usually depends on the weakness of the link, which is the concept lies in the implementation of cryptographic algorithms. In this paper, we deal with the implementation of RSA algorithm using Chinese remainder theorem.
Keywords: Encryption, decryption, cipher text, prime numbers, Congruence, RSA algorithm etc.