Conference Papers

Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506

Browse

Filters

2020 - 20234

Settings

Author: search.filters.author.Chandavarkar, B.R.Subject: search.filters.subject.Encryption

Search Results

Now showing 1 - 4 of 4
  • 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
    Generalizing a Secure Framework for Domain Transfer Network for Face Anti-spoofing
    (Springer, 2023) Chandavarkar, B.R.; Rana, A.; Ketkar, M.M.; Pai, P.G.
    An essential field in cyber-security is the technology behind the authentication of users. In the contemporary era, alphanumeric passwords have been the primary tool used. A password is easy to understand but theoretically complex to brute force and is very easy to store in large databases since, in essence, they are an array of characters. In practical use, however, passwords tend to be very ineffective as the attributes that make for “strong†passwords are generally really abstract and random. However, human memories tend to remember constructed language, which can be intelligently guessed with sufficient information regarding the person. A widely accepted remedy to this problem is to replace passwords with face recognition software which involves minimal effort for the user and, though not completely immune, is quite challenging to misuse. Misuse is often done by spoofing faces. Spoofing faces means presenting a 2D or even a 3D copy of a face to the camera, pretending it is the real face. Many discovered spoofing methods are taken into consideration and protected against in most software. Even though various methods have been suggested for anti-spoofing, there are challenges that these methods go through, e.g., washed-out images, lack of colour, poor illumination. Our proposal involves the use of OpenCV and deep learning to accurately colourize the image pre-processing and put it through the GAN framework (Wang et al., From RGB to Depth: Domain Transfer Network for Face Anti-Spoofing (2021). https://ieeexplore.ieee.org/document/9507460. Accessed 07 Feb 2022). Furthermore, to secure the image to prevent ill use, the final generated image pair will be encrypted so that only the user can access it. The aim is to combine the power of re-colourization with the GAN framework’s strong anti-spoofing capabilities and make the whole framework secure for the user. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.