Please use this identifier to cite or link to this item:
Title: Elliptic curve cryptosystems using efficient exponentiation
Authors: Saleh, Mohammad
Keywords: Cryptography
Curves, Elliptic
Finite fields (Algebra)
Issue Date: 2007
Abstract: Elliptic curve cryptosystems, proposed by Koblitz ([12]) and Miller ([16]), can be constructed over a smaller field of definition than the ElGamal cryptosystems ([6]) or the RSA cryptosystems ([20]). 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

Files in This Item:
File Description SizeFormat 
kamal-paper.pdf542.46 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.