Return to search

Fast Exponentiation with Block-Shift Computing Method

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.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0729104-144620
Date29 July 2004
CreatorsWang, Hu-yi
ContributorsChun-I Fan, C. Richard Lin, Dr. D. J. Guan
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729104-144620
Rightsunrestricted, Copyright information available at source archive

Page generated in 0.0016 seconds