126 search results - page 16 / 26 » On the Use of Weber Polynomials in Elliptic Curve Cryptograp... |
CHES
2001
Springer
14 years 28 days ago
2001
Springer
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
FC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we formulate the concept of policy-based cryptography which makes it possible to perform policy enforcement in large-scale open environments like the Internet, with ...
ANTS
2006
Springer
14 years 5 days ago
2006
Springer
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...
IACR
2011
12 years 8 months ago
2011
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
PKC
2004
Springer
14 years 1 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...