Public Key Cryptography Algorithm using Binary Manipulation and Chinese Remainder Theorem
N. Syed Siraj Ahmed1, R. Selvakumar2, Akshay Taywade3

1Mr. N. Syed Siraj Ahmed, School of Computing Science and Engineering, Vellore Institute of Technology, (VIT) (Deemed University),Vellore (Tamil Nadu), India.
2Dr. R. Selva Kumar, School of Computing Science and Engineering, Vellore Institute of Technology, (VIT) (Deemed University),Vellore (Tamil Nadu), India.
3Mr. Akshay Taywade, School of Computing Science and Engineering, Vellore Institute of Technology, (VIT) (Deemed University),Vellore (Tamil Nadu), India.

Manuscript received on 21 November 2013 | Revised Manuscript received on 28 November 2013 | Manuscript published on 30 November 2013 | PP: 85-88 | Volume-2 Issue-5, November 2013 | Retrieval Number: E0882112513/2013©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© 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: Cryptography enables all processes, transactions, and communications to be safely performed electronically. Public key achieve confidentiality and has the ability to create a digital signature where as private key achieve confidentiality. Public key Cryptography is an extremely active subject of research with important applications in electronic commerce and internet security. In particular key exchange is used in secure socket layer protected communication and public key digital signature is used to verify the malicious software. This paper explains a public-key cryptography algorithm using chinese remainder theorem and binary manipulations such as reverse, division, multiply and addition of binary number etc.,. The security of the above scheme is based on the difficulty of finding a specific solution of the binary number. The chinese remainder theorem is used to hide the technique mentioned above, before making the hidden sequence of above to be transformed modulus. This algorithm has security against any kind of forgeries.
Keyword: Binary Manipulation, Cryptography, Chinese Remainder Theorem, Public Key

Scope of the Article: Cryptography and Applied Mathematics