Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 832-837 |
Number of pages | 6 |
Journal | Information Processing Letters |
Volume | 109 |
Issue number | 15 |
DOIs | |
Publication status | Published - 2009 Jul 16 |
Externally published | Yes |
Keywords
- Batch exponentiation
- Batch generation
- Cryptography
- Decremental strategy
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications