13 search results - page 3 / 3 » ches 2001 |
CHES
2001
Springer
14 years 3 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...
CHES
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
AAECC
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. A way for preventing SPA-like attacks on elliptic curve systems is to use the same formula for the doubling and the general addition of points on the curve. Various propo...