Journal Articles

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

Browse

Author: search.filters.author.Sravana Kumar, D.Subject: search.filters.subject.Elliptic curve

Search Results

Now showing 1 - 2 of 2
  • 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
    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.