Journal Articles

Permanent URI for this collectionhttps://dspacenew8-imu.refread.com/handle/123456789/2069

Browse

Author: search.filters.author.Sirisha, P.Has files: Yes

Search Results

Now showing 1 - 10 of 10
  • No Thumbnail Available
    Item
    Cryptographic key communication protocol using elliptic curve over finite field with nested construction of hash message authentication code
    (International Journal of Advanced Research in Computer Science, 2018) Suneetha, Ch.; Sravana Kumar, D.; Sirisha, P.
    As the internet is the basic means of communication nowadays confirming the integrity and authenticity of the received data is a prime necessity in communication network. The present paper explores the key communication protocol from one entity to the other rather than sharing the part of the key by both the entities using elliptic curve over finite field. In addition one Nested construction of Hash Message Authentication Code (NMAC) is tagged to the communicated key that guards the communicated key for verification using cartographic hash function. The protocol designed here is more suitable for communicating high secured pass words and PIN numbers in monetary transactions
  • No Thumbnail Available
    Item
    Secure cryptosystem based on braiding/entanglement of pauli 5/2 matrices
    (Bulletin of Mathematics and Statistics Research, 2016-11) Sirisha, P.; Suneetha, Ch.
    "Cryptography is the art or science encompassing the principles and methods of transforming an intelligible message into one that is unintelligible and then retransforming that message back to its original form. Secure transmission of the information to the genuine recipient has become a Herculean task .This paper presents a novel encryption scheme using Braiding/Entanglement of Pauli Spin 5/2 matrices."
  • No Thumbnail Available
    Item
    Secure cryptosystem based on braiding/entanglement of pauli 3/2 matrices
    (International Journal of Computer Applications, 2016-06) Sravana Kumar, D.; Sirisha, P.; Suneetha, Ch.
    As the internet is the basic means of communication nowadays,secure transmission of the sensitive information to the genuine recipient has become a Herculean task. Cryptography is an essential tool for protecting information in computer systems. This paper presents a novel encryption scheme using Braiding/Entanglement of Pauli Spin 3/2 matrices.
  • No Thumbnail Available
    Item
    Cascade block cipher using braiding / entanglement of spain matrices and bit rotation
    (International Journal of Network Security & Its Applications, 2016-03) Sravana Kumar, D.; Sirisha, P.; Suneetha, Ch.
    Secure communication of the sensitive information in disguised form to the genuine recipient so that an intended recipient alone can remove the disguise and recover the original message is the essence of Cryptography. Encrypting the message two or more times with different encryption techniques and with different keys increases the security levels than the single encryption. A cascade cipher is stronger than the first component. This paper presents multiple encryption schemes using different encryption techniques Braiding/Entanglement of Pauli Spin 3/2 matrices and Rotation of the bits with independent secret keys.
  • No Thumbnail Available
    Item
    Security and authentication architecture of block cipher using mathematical operation and one-way hash function
    (International Journal of Mathematics Trends and Technology (IJMTT), 2017-09) Suneetha, CH.; Sravana Kumar, D.; Sirisha, P.; Sandeep, KM.
    Extensive growth of telecommunication network provides easy and quick techniques of communicating the information. Rapid development of information technology has given the scope to huge range of new possibilities of internet hacking. Solution to the security problems expanded the field of cryptography. The present paper describes a block cipher mechanism for message confidentiality and authentication using simple arithmetic, logical operations and one-way cryptographic hash functions in two different stages. Agreed upon primary or Master key is used to generate number of sub keys for encrypting different message blocks to extend the lifetime of the master key using some permutation function.
  • No Thumbnail Available
    Item
    Symmetric stream cipher based on chebyshev polynomial
    (International Journal Of Engineering And Computer Science, 2017) Sravana Kumar, D.; Sirisha, P.; Suneetha, Ch.
    The rapid development of information technology turned internet as the basic means and wide choice for communications. Due to extensive adoption of internet for communications it is essential these days to conceal the message from unintended reader. The present paper describes a new encryption algorithm using Chebyshev polynomial of I kind. The plain text is encrypted in three rounds each round consisting of two stages with the concatenation of the previous cipher character with different keys. For making the algorithm more secure the key for the first round of encryption is generated from the main key (agreed upon by the sender and the receiver) and the subsequent round keys are concatenated with the previous round keys. The stream cipher proposed here has several advantages over conventional cryptosystems.
  • No Thumbnail Available
    Item
    New password embedding technique using elliptic curve over finite field
    (Springer, 2019) Sravana Kumar, D.; Suneeth, C. H.; Sirisha, P.
    In the present sophisticated digital era, safe communication of user password from one source to the other is quite difficult in client/server system. Also storing the password as it appears increases the potential risk of the security. Protection of the password is at most important in group communications to avoid the access of the illegal person to group resources. In addition, a roaming user who uses the network from different client terminals requires access to the private key. The present paper explains secure communication of password from one entity to the other. Here the password is encrypted using elliptic curve over finite field, embedded in a large random text at different selected positions, and communicated to the receiver via public channel.
  • No Thumbnail Available
    Item
    New random walk technique and collision detection algorithm to improve the pollard rho attack of solving discrete logarithm problem on elliptic curves
    (International Journal of Mathematics Trends and Technology (IJMTT), 2018-04) Suneetha, P.; Sirisha, P.; Sravana Kumar, D.; sandeep, K. M.
    Elliptic curve cryptography is a revolutionary in the history of public key cryptography that is protected by a hard problem Elliptic Curve Discrete Logarithm Problem (ECDLP). A wide research has been done on cryptanalysis of ECDLP. In 1978 Pollard developed an algorithm with a “Monte-Carlo” method for solving ECDLP called Pollard Rho attack which is the quickest algorithm. Since then the algorithm was modified to increase the efficiency of Pollard Rho algorithm in relatively short time to find the insecurity of the elliptic curve cryptosystem. The present paper designs a new random walk technique and collision detection algorithm to improve the performance of Pollard Rho algorithm.
  • 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.