35 search results - page 4 / 7 » On the Construction of Prime Order Elliptic Curves |
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...
IEICET
2008
13 years 7 months ago
2008
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
ANTS
2004
Springer
14 years 23 days ago
2004
Springer
We present a non-archimedean method to construct, given an integer N ≥ 1, a finite field Fq and an elliptic curve E/Fq such that E(Fq) has order N.
PAIRING
2009
Springer
14 years 1 months ago
2009
Springer
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
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...