An interactive identification scheme based on discrete logarithms and factoring
Journal of Cryptology - Eurocrypt '90
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
More Flexible Exponentiation with Precomputation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
| Hi-index | 0.00 |
. In [5] Lim and Lee present an algorithm for fast exponentiation in a given group which is optimized for a limited amount of storage. The algorithm uses one precomputation for several computations in order to minimize the average time needed for one exponentiation. This paper generalizes the previous work proposing several improvements and a method for fast precomputation. The basic Lim/Lee algorithm is improved by determining the optimal segmentation of the exponent. Finally, it is shown that the improved Lim/Lee algorithm is faster than the previous one in average case.