Premium
An efficient ID ‐based cryptographic technique using IFP and GDLP
Author(s) -
Meshram Chandrashekhar,
Ibrahim Rabha W.,
Meshram Sarita Gajbhiye,
Kalare Kailash W.,
Bagde Sunil D.
Publication year - 2020
Publication title -
security and privacy
Language(s) - English
Resource type - Journals
ISSN - 2475-6725
DOI - 10.1002/spy2.119
Subject(s) - computer science , cryptography , encryption , discrete logarithm , eavesdropping , public key cryptography , bilinear interpolation , cryptographic primitive , theoretical computer science , computer network , cryptographic protocol , computer security , computer vision
Implementing an improved ID‐based cryptographic mechanism is the main objective of the proposed work. In this article, an ID‐based cryptographic (IBC) technique using generalized discrete logarithm problem (GDLP) and the integer factorization problem (IFP) presented by Meshram et al have improved. Meshram et al have given IBC technique without using the bilinear pair and also, reveal that their technique can attain data protection and security objectives. Besides, their technique will deter the adversary from eavesdropping the encrypted information or the secret key of the user. However, it has found that their system carries a deadlock problem. Encryption process, as expected by the user, is not guaranteed to be secure. It is because the user may require private information about key authentication center (KAC), which has kept secret from users. Pang et al have proposed an improved technique that overcomes the deadlock problem. It has found that Pang et al have not discussed the analysis and proofs of security. In this article, generalized discrete logarithms in multiplicative group over finite fields and IFP have used to improve the technique and also a key distribution system has discussed. It has analyzed that the proposed strategy is safer than the technique described by Pang et al. Also, it has found that the proposed technique addresses the deadlock problem.