The computation of modular exponentiation in a finite multiplication group,
or scalar multiplication in elliptic curves,
is the most time-consuming operations for many cryptosystems, such as RSA or DSA.
In this thesis we first introduce some researched techniques for the exponentiation, then
we propose an idea to speed up the computation for pairs of integers, e.g. $c=a^xb^y$, or $C=xA+yB$ in elliptic curves, by adjusting the computing sequence of
the Shamir method and shifting the two integer's nonzero bits. So that the number of matched
nonzero bits is maximized to reduce the computing cost.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0729104-144620 |
| Date | 29 July 2004 |
| Creators | Wang, Hu-yi |
| Contributors | Chun-I Fan, C. Richard Lin, Dr. D. J. Guan |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729104-144620 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0016 seconds