Please use this identifier to cite or link to this item:
|Title:||Elliptic curve cryptosystems using efficient exponentiation|
Finite fields (Algebra)
|Abstract:||Elliptic curve cryptosystems, proposed by Koblitz () and Miller (), can be constructed over a smaller field of definition than the ElGamal cryptosystems () or the RSA cryptosystems (). This is why elliptic curve cryptosystems have begun to attract notice. In this paper, we investigate efficient elliptic curve exponentiation. We propose a new coordinate system and a new mixed coordinates strategy, which significantly improves on the number of basic operations needed for elliptic curve exponentiation|
|Appears in Collections:||Fulltext Publications|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.