47 search results - page 2 / 10 » Novel Precomputation Schemes for Elliptic Curve Cryptosystem... |
GMP
2003
IEEE
14 years 1 months ago
2003
IEEE
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...
ASIACRYPT
1999
Springer
14 years 26 days ago
1999
Springer
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...
MDAI
2005
Springer
14 years 2 months ago
2005
Springer
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...
IJNSEC
2010
13 years 3 months ago
2010
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...
ASIACRYPT
2000
Springer
14 years 28 days ago
2000
Springer
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...