Computing A^X mod n or A^XB^Y mod n for
large X, Y, and n is very important in many ElGamal-like
public key cryptosystems. In this paper, we proposed using block
method in sparse form to improve the performance of modular exponentiation
and analyzing the computational cost
by state transition diagram. We also extended the concept of Block Method and make it more general.
This method is suitable for some devices with limited storage space, such as smart card.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0621109-172157 |
| Date | 21 June 2009 |
| Creators | Jian, Wan-Rong |
| Contributors | Chun-I Fan, D.J Guan, Chia-Mei Chen |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0621109-172157 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0025 seconds