Fast Exponentiation with Block-Shift Computing Method
碩士 === 國立中山大學 === 資訊工程學系研究所 === 92 === 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 techniqu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/37689553944923968187 |