Some Modification in ID-Based Public key Cryptosystem using IFP and DDLP
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2011, Vol 2, Issue 8
Abstract
In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify him self before joining a communication network. Once a user is accepted, the KAC will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communication partner and the public key of the KAC. There is no public file required in this system. However, Shamir did not succeed in constructing an identity based cryptosystem, but only in constructing an identity-based signature scheme. Meshram and Agrawal [5] have proposed an id - based cryptosystem based on integer factoring and double discrete logarithm problem which uses the public key cryptosystem based on integer factoring and double discrete logarithm problem. In this paper, we propose the modification in an id based cryptosystem based on the integer factoring and double discrete logarithm problem and we consider the security against a conspiracy of some entities in the proposed system and show the possibility of establishing a more secure system.
Authors and Affiliations
Chandrashekhar Meshram, S. A. Meshram
Keywords
Related Articles
- EP ID EP85816
- DOI -
- Views 144
- Downloads 0
MCMC Particle Filter Using New Data Association Technique with Viterbi Filtered Gate Method for Multi-Target Tracking in Heavy Clutter
Improving data association technique in dense clutter environment for multi-target tracking used in Markov chain Monte Carlo based particle filter (MCMC-PF) are discussed in this paper. A new method named Viterbi f...
Evaluating the Impact of Critical Factors in Agile Continuous Delivery Process: A System Dynamics Approach
Continuous Delivery is aimed at the frequent delivery of good quality software in a speedy, reliable and efficient fashion – with strong emphasis on automation and team collaboration. However, even with this new paradigm...
An Efficient Algorithm for Enumerating all Minimal Paths of a Graph
The enumeration of all minimal paths between a terminal pair of a given graph is widely used in a lot of applications such as network reliability assessment. In this paper, we present a new and efficient algorithm to gen...
Study of the Performance of Multi-hop Routing Protocols in Wireless Sensor Networks
Currently in the literature, there are quite a num-ber of multi-hop routing algorithms, some of which are subject to normalization. Routing protocols based on clustering provide an efficient method for extending the life...
Figural a Flexibility Test for Improving Creative Thinking in an Arabic Learning Environment A Saudi Arabia-Based Case Study
The capability of graduates to be flexible in the face of rapidly altering situations is an increasingly crucial requirement that teachers should be conscious of, given that persistent development and technological progr...