Browsing by Author "Talari, Surendra."

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    An Improved cipher based automatic theorem proving technique for encryption and decryption
    (Advances in Mathematics: Scientific Journal, 2020) Talari, Surendra.; Amiripalli, S. S.; Sirisha, P.; Sateesh kumar, D; Krishna Deepika, V.
    Globalization has positively influenced almost every sector in India. In the present digital world, security and management of information in the cyber space is quite crucial. The multifarious dimension of cryptography plays an important role in exchange of information securely. In this paper we propose one new crypto system technique using Automatic Theorem Proving concept by assigning various ciphers to the antecedent and consequent rules. Here we form the sequent using plaint text, connective symbols then encrypt this plain text into various levels using antecedent rules and consequent rules and the corresponding assigned ciphers. Since it involves various levels of encryptions and decryptions, it is difficult to the attacker to decrypt the plain text, so that security is more. Though the encryption and decryption run time of the proposed technique is feasible, the security levels are infeasible.
  • No Thumbnail Available
    Item
    Silver-pohilg hellman algorithm implemented to discrete log with Arya Bhatta remainder theorem
    (Jour of Adv Research in Dynamical & Control Systems, 2020) Talari, Surendra.; Sirisha, P.; Sateesh Kumar, D.; Sowmya, K. L.; Divakara Rao, K.
    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.