SACRYPT
1999
Springer
13 years 8 months ago
1999
Springer
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m . We call these sequences elliptic curve...
EUROCRYPT
1999
Springer
13 years 8 months ago
1999
Springer
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
ASIACRYPT
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
CHES
2000
Springer
13 years 8 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
CARDIS
2000
Springer
13 years 8 months ago
2000
Springer
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...
ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
This paper introduces three new probabilistic encryption schemes using elliptic curves over rings. The cryptosystems are based on three specific trapdoor mechanisms allowing the r...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
INDOCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
CTRSA
2003
Springer
13 years 9 months 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...
AAECC
2003
Springer
13 years 9 months 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...