44 search results - page 3 / 9 » Computing in Component Groups of Elliptic Curves |
CRYPTO
1991
Springer
13 years 11 months ago
1991
Springer
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
DCC
2001
IEEE
14 years 7 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
TIT
2010
13 years 2 months ago
2010
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
FC
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Systems for the support of customer relationship management are becoming increasingly attractive for vendors. Loyalty systems provide an interesting possibility for vendo...
CRYPTO
1995
Springer
13 years 11 months ago
1995
Springer
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...