Sciweavers

Share
ICICS
1997
Springer

Efficient elliptic curve exponentiation

11 years 11 months ago
Efficient elliptic curve exponentiation
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosystems([16]). This is why elliptic curve cryptosystems have begun to attract notice. There are mainly two types in elliptic curve cryptosystems, elliptic curves E over IF2r and E over IFp. Some current systems based on ElGamal or RSA may often use modulo arithmetic over IFp. Therefore it is convenient to construct fast elliptic curve cryptosystems over IFp. In this paper, we investigate how to implement elliptic curve cryptosystems on E/IFp.
Atsuko Miyaji, Takatoshi Ono, Henri Cohen
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1997
Where ICICS
Authors Atsuko Miyaji, Takatoshi Ono, Henri Cohen
Comments (0)
books