Improved batch exponentiation

Authors:
Byungchun Chung;Junbeom Hur;Heeyoul Kim;Seong-Min Hong;Hyunsoo Yoon
Affiliations:
Department of Computer Science, KAIST, Daejeon 305-701, Republic of Korea;Department of Computer Science, KAIST, Daejeon 305-701, Republic of Korea;Department of Computer Science, Kyonggi Univ., Suwon 443-760, Republic of Korea;Department of Computer Science, KAIST, Daejeon 305-701, Republic of Korea;Department of Computer Science, KAIST, Daejeon 305-701, Republic of Korea
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 1

A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation

Information Processing Letters
Improved Digital Signature Suitable for Batch Verification

IEEE Transactions on Computers
Lenient/Strict Batch Verification in Several Groups

ISC '01 Proceedings of the 4th International Conference on Information Security
Fast exponentiation with precomputation

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques

Operand folding hardware multipliers

Cryptography and Security

Quantified Score

Hi-index	0.89

Visualization

Abstract

An improved batch exponentiation algorithm is proposed that enhances the combination step of M'Raihi-Naccache's batch exponentiation algorithm with a decremental combination strategy. In comparison with M'Raihi-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.