Improved batch exponentiation
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. (C) 2009 Elsevier B.V. All rights reserved.
- Publisher
- ELSEVIER SCIENCE BV
- Issue Date
- 2009-07
- Language
- English
- Article Type
- Article
- Keywords
VERIFICATION
- Citation
INFORMATION PROCESSING LETTERS, v.109, no.15, pp.832 - 837
- ISSN
- 0020-0190
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 5 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.