Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11889/4061
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Saleh, Mohammad | - |
dc.date.accessioned | 2017-01-10T09:12:57Z | - |
dc.date.available | 2017-01-10T09:12:57Z | - |
dc.date.issued | 2007 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.11889/4061 | - |
dc.description.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 | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Cryptography | en_US |
dc.subject | Curves, Elliptic | en_US |
dc.subject | Finite fields (Algebra) | en_US |
dc.title | Elliptic curve cryptosystems using efficient exponentiation | en_US |
dc.type | Article | en_US |
newfileds.department | Science | en_US |
newfileds.item-access-type | open_access | en_US |
newfileds.thesis-prog | none | en_US |
newfileds.general-subject | none | en_US |
item.grantfulltext | open | - |
item.languageiso639-1 | other | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Fulltext Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
kamal-paper.pdf | 542.46 kB | Adobe PDF | View/Open |
Page view(s)
104
Last Week
0
0
Last month
2
2
checked on Apr 14, 2024
Download(s)
34
checked on Apr 14, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.