Silver-pohilg hellman algorithm implemented to discrete log with Arya Bhatta remainder theorem

Abstract

As the internet provides access to millions of communications in every second around the world, security implications are tremendously increasing. Transfer of important files like banking transactions, tenders, and e commerce require special security and authenticated mechanism in its journey from the sender to the receiver. Public key Cryptosystem (PKC) is ever expanding in the history of cryptography. Traditional Public Key Infrastructure (PKI) certificates assure the authenticity in the form of digital signature. Public key cryptosystem having wide range of practical applications in wireless environments like smartcards, tokens and mobile phones. In this paper we solved discrete log problems with Silver Pohilg Hellman algorithm Implemented to Discrete Log with Aryabhatta Remainder Theorem, which improves the difficult of solving discrete log. So obviously it improves the security of public key crypto systems and avoids various attacks on it.