37 search results - page 2 / 8 » Fast Point Decompression for Standard Elliptic Curves |
CTRSA
2003
Springer
14 years 21 days ago
2003
Springer
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
INDOCRYPT
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
PAIRING
2009
Springer
14 years 2 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 ...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjecture...
IJNSEC
2006
13 years 7 months ago
2006
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is ...