TY - JOUR
T1 - Improved batch exponentiation
AU - Chung, Byungchun
AU - Hur, Junbeom
AU - Kim, Heeyoul
AU - Hong, Seong Min
AU - Yoon, Hyunsoo
N1 - Funding Information:
✩ This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute for Information Technology Advancement) (IITA-2008-C1090-0801-0015). * Corresponding author. E-mail address: bcchung@nslab.kaist.ac.kr (B. Chung).
PY - 2009/7/16
Y1 - 2009/7/16
N2 - An improved batch exponentiation algorithm is proposed that enhances the combination step of M'Raïhi-Naccache's batch exponentiation algorithm with a decremental combination strategy. In comparison with M'Raïhi-Naccache's algorithm for 160-bit and 1024-bit exponents, the proposed algorithm reduces the workload per exponentiation by about 15% in both cases when the optimal batch size is applied.
AB - An improved batch exponentiation algorithm is proposed that enhances the combination step of M'Raïhi-Naccache's batch exponentiation algorithm with a decremental combination strategy. In comparison with M'Raïhi-Naccache's algorithm for 160-bit and 1024-bit exponents, the proposed algorithm reduces the workload per exponentiation by about 15% in both cases when the optimal batch size is applied.
KW - Batch exponentiation
KW - Batch generation
KW - Cryptography
KW - Decremental strategy
UR - http://www.scopus.com/inward/record.url?scp=67349170371&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67349170371&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2009.04.008
DO - 10.1016/j.ipl.2009.04.008
M3 - Article
AN - SCOPUS:67349170371
VL - 109
SP - 832
EP - 837
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
IS - 15
ER -