105 search results - page 3 / 21 » Efficient elliptic curve exponentiation |
ANTS
2006
Springer
13 years 11 months 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 ...
JAL
1998
13 years 7 months ago
1998
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
CHES
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...
DCC
2000
IEEE
13 years 7 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
ANTS
2010
Springer
13 years 11 months ago
2010
Springer
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...