Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
The purpose of this paper is to introduce pairing over elliptic curve and apply it to ID based key agreement schemes and privacy preserving key agreement schemes. The key words her...
In 2004, a multi-signature scheme (MSS) based on the elliptic curve cryptosystem is given by Chen et al. [1]. Later, Liu and Liu [6] showed that if one of the users always sends h...
This paper introduces three new probabilistic encryption schemes using elliptic curves over rings. The cryptosystems are based on three specific trapdoor mechanisms allowing the r...