Please use this identifier to cite or link to this item:

Title: Fast Binary Multiplication Method forModular Exponentiation
Authors: Wu, Chia-Long
Lou, Der-Chyuan
Chang, Te-Jen
Keywords: 聯合防禦;合作式安全系統;分散式入侵偵測系統;事件回應;電腦病蟲
Complement signed-digit representation modular exponentiation binary method public key cryptography
Date: 2005
Issue Date: 2017-10-17 17:04:56 (UTC+8)
Abstract: 本論文結合二元乘法、符號元表示法、以及補數表示法三種運算技術提出新的快速模指數演算法。對於大部份的公開金鑰密碼系統而言,模指數運算是相當耗時且佔記憶體的運算。而當我們利用本論文所提出的演算法時,我們可以將整體模指數運算複雜度由11k/8有效降至13k/12,其中k為指數E的長度。
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.
Relation: TANET 2005 台灣網際網路研討會論文集
Data Type: conference
Appears in Collections:[TANET 台灣網際網路研討會] 會議論文

Files in This Item:

File Description SizeFormat
351.pdf137KbAdobe PDF174View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing