| dc.creator (作者) | Wu, Chia-Long | en_US |
| dc.creator (作者) | Lou, Der-Chyuan | en_US |
| dc.creator (作者) | Chang, Te-Jen | en_US |
| dc.date (日期) | 2005 | |
| dc.date.accessioned | 17-Oct-2017 17:04:56 (UTC+8) | - |
| dc.date.available | 17-Oct-2017 17:04:56 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-Oct-2017 17:04:56 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/113735 | - |
| dc.description.abstract (摘要) | 本論文結合二元乘法、符號元表示法、以及補數表示法三種運算技術提出新的快速模指數演算法。對於大部份的公開金鑰密碼系統而言，模指數運算是相當耗時且佔記憶體的運算。而當我們利用本論文所提出的演算法時，我們可以將整體模指數運算複雜度由11k/8有效降至13k/12，其中k為指數E的長度。 | |
| dc.description.abstract (摘要) | This paper proposes a new fast technique to fast evaluate modular exponentiation which combines a binary exponentiation method, a complement representation method, and a signed-digit representation method. Because modular exponentiation is one of the most time-consuming operations for many cryptosystems, we adopt the proposed method to reduce the computational complexity from 11k/8 to 13k/12, where k is the bit-length of the exponent E. We can therefore efficiently speed up the overall performance of the modular exponentiation. | |
| dc.format.extent | 141036 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | TANET 2005 台灣網際網路研討會論文集 | zh_TW |
| dc.relation (關聯) | 資訊安全技術 | zh_TW |
| dc.subject (關鍵詞) | 聯合防禦;合作式安全系統;分散式入侵偵測系統;事件回應;電腦病蟲 | zh_TW |
| dc.subject (關鍵詞) | Complement signed-digit representation modular exponentiation binary method public key cryptography | en_US |
| dc.title (題名) | Fast Binary Multiplication Method forModular Exponentiation | en_US |
| dc.type (資料類型) | conference | |
