Faculty Publications

Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736

Publications by NITK Faculty

Browse

Has files: NoSubject: search.filters.subject.Decryption

Search Results

Now showing 1 - 5 of 5
  • No Thumbnail Available
    Item
    New Data Hiding Technique in Encrypted Image: DKL Algorithm (Differing Key Length)
    (Elsevier, 2015) Udhayavene, S.; Dev, A.T.; Chandrasekaran, K.
    This paper introduces a new technique to increase the information security over the network using steganography in such a way that the secret message being sent is unidentifiable. There is a comparison made to give a clear view of how the algorithm proposed is better than LSB algorithm which is used since a long time for sending concealed messages. To avoid the chances of an attacker using steganalysis to retrieve the data, the data encryption is done. S-tool is used to show the reliability of this algorithm. We will be comparing both LSB and DKL algorithms on the basis of Mean Square Error, Peak Signal Noise Ratio, Relative Payload and Rate of Embedding. Here by its shown that DKL algorithm is more efficient than LSB algorithm. © 2015 The Authors.
  • No Thumbnail Available
    Item
    Greatest common divisor and its applications in security: Case study
    (Institute of Electrical and Electronics Engineers Inc., 2020) Sri Siddhartha, M.; Rodriques, J.; Chandavarkar, B.R.
    In this paper, we explain the importance and applications of the Greatest Common Divisor(GCD) in the field of security. GCD of two numbers is the greatest divisor that ultimately divides these two numbers. The paper initially discusses four standard algorithms used in calculating GCD: Euclidean Algorithm, Binary GCD algorithm, Dijkstra's algorithm, and Lehmer's algorithm. We then analyze the various GCD applications in computer security. Some applications like generating modular multiplicative inverse are used in various cryptographic algorithms, reducing public keys' disclosure within closed groups, the importance of GCD in cryptographic algorithms, key refreshment message authentication, and peer validation. In the end, we cover the effects arising due to not proper use of GCD according to the algorithms stated in this paper, and how a poor choice of prime numbers that we use to compute the GCD and miscalculation of GCD can affect the computer security. © 2020 IEEE.
  • No Thumbnail Available
    Item
    Prime Numbers and Its Applications in Security: Case Study
    (Springer Science and Business Media Deutschland GmbH info@springer-sbm.com, 2021) Namdeo, A.K.; Lomga, A.; Chandavarkar, B.R.
    Prime Numbers are the major building blocks in integer universe. Prime numbers play an important role in number theory and cryptography. With this unique nature of prime number, it is mainly used in security. Many security algorithms have used prime numbers because of their uniqueness. In this paper, we have discussed the importance of prime numbers and their application. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
  • No Thumbnail Available
    Item
    Comparative Study Between RSA Algorithm and Its Variants: Inception to Date
    (Springer Science and Business Media Deutschland GmbH info@springer-sbm.com, 2021) Rathod, U.; Sreenivas, S.; Chandavarkar, B.R.
    RSA Public Key Cryptography (PKC) otherwise called asymmetric encryption, comprises of two keys known as public key and private key. While the sender utilizes receiver’s public key to encrypt the message, the receiver’s private key is utilized for decrypting the message, so there is no compelling reason to share a private key as in symmetric cryptography which requires sharing a private key. This paper means to investigate RSA and its variants, study its qualities and shortcomings, and propose inventive answers for conquer the shortcoming. RSA is extraordinary compared to other asymmetric key cryptographic algorithms in correspondence over systems. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
  • No Thumbnail Available
    Item
    Music cryptography based on carnatic music
    (Blue Eyes Intelligence Engineering and Sciences Publication, 2019) Rao, D.; Koolagudi, S.G.
    Music and cryptography have been linked to one another since ancient times. The idea of replacing plaintext letters with music notes and sending the music file to receiver, is not new. But such replacements sometimes result in music clips which are not pleasant to listeners and thereby leading to the music clip gaining unnecessary extra attention. Most of the works done in this area, fail to ensure the generation of a music clip that invariably conforms to any particular form of music. Melody of the music clip is neglected. In order to address this issue, current paper proposes a novel approach for sharing a secret message based on concepts of Carnatic Classical Music. The method proposed here aims at converting a message in textual format to a music clip before sending it to the receiver. Receiver can then decrypt that message using the knowledge of range of frequency values associated with each musical note also called as 'swara' in Carnatic Classical Music. Each plaintext character from English alphabet is replaced by different combinations of swaras. The set of swaras mapped to each plaintext character is so chosen that the final music file produced as the output of encryption always conforms to a melodic form ('Raga') governed by the framework of Carnatic Classical Music. Ten subject matter experts in the field of Carnatic music have given their opinion about the conformance of these music clips to specified ragas. Also, Mean Opinion Score (MOS) of 25 listeners has been tabulated to test and verify the melodic aspect of these music clips. © BEIESP.