Abstract
Shamir developed an idea of the ID-based cryptographic technique in 1984 [1]. In its place of making and issuing a public key for each user, the ID-based cryptographic scheme authorized each user to choose his name or network address etc. as his public key. The public-key verification is so easy and direct by using the advantage of public key cryptosystem. In this study, we proposed the new ID-based cryptographic scheme for applying public-key cryptosystem based on Integer Factorization Problem (IFP) and Generalized Discrete Logarithm Problem (GDLP). The main benefit of the ID-based cryptographic technique based on our proposed scheme over other published ID-based cryptosystems in the literature, is that the number of users can be extended to a * L users without undignified the system's security even when users plan, where L and a are the system's private keys and factors in N – 1 respectively.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.