In this pa.per, we present Key-Updating Schemes in identity-based (identification or signature) systems, and consider the security of the schemes. We ’ propose two kinds of key-updating schemes, i.e., one is sequential type and the other is parallel type, and show that both schemes are equivalent to each other in a polynomial time sense, i.e., there elrists a deterministic polynomial time algor...

RSA type public key cryptosystems based on the Pell’s equation are proposed in the honor of an Indian mathematician Brahmgupta who studied Pell’s equation long before European mathematicians came to know about it. Three RSA type schemes are proposed, first two are not semantically secure where as the other two schemes are semantically secure. The decryption speed of the proposed schemes is abou...

NEtwork MObility (NEMO) controls mobility of a number of mobile nodes in a comprehensive way using one or more mobile routers. To choose a route optimization scheme, it is very important to have a quantitative comparison of the available route optimization schemes. The focus of this paper is to analyze the degree of Route Optimization (RO), deploy-ability and type of RO supported by each class ...

This work presents two high-order, semi-discrete, central-upwind schemes for computing approximate solutions of 1D systems of conservation laws. We propose a central weighted essentially non-oscillatory (CWENO) reconstruction, also we apply a fourth-order reconstruction proposed by Peer et al., and afterwards, we combine these reconstructions with a semi-discrete central-upwind numerical flux ...

Subdivision schemes are efficient computational methods for the design, representation and approximation of surfaces of arbitrary topology in R. Subdivision schemes generate curves/surfaces from discrete data by repeated refinements. This paper reviews some of the theory of linear stationary subdivision schemes and their applications in geometric modelling. The first part is concerned with “cla...