Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
3 results
Search Results
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.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.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.