Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Sandeep, K. M."

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Results Per Page
  • Sort Options
  • Thumbnail Image
    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.
  • Thumbnail Image
    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, C. H.; Sravana Kumar, D.; Sirisha, P.; Sandeep, K. M.
    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.

DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify