Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. Bos and M. Coster. Addition Chain Heuristics. In G. Brassard, editor, Advances in Cryptology-CRYPTO’ 89. LNCS 435, pp. 400–407. Springer-Verlag, 1990.
E. F. Brickell and K. S. McCurley. An Interactive Identification Scheme Based on Discrete Logarithms and Factoring. In Journal of Cryptology 5 (1992), no. 1, pp. 29–39.
J. Jedwab and C. J. Mitchell. Minimum Weight Modified Signed-Digit Representations and Fast Exponentiation. Elect. Let. 25(17), pp. 1171–1172 (1989).
D. E. Knuth. The Art of Computer Programming, Vol.2: Seminumerical algorithms. Third edition, Addison-Wesley, 1997.
C. H. Lim and P. J. Lee. More Flexible Exponentiation with Precomputation. In Yvo G. Desmedt, editor, Advances in Cryptology-CRYPTO’ 94. LNCS 839, pp. 95–107. Springer-Verlag, 1994.
A. J. Menezes, P. C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press series on discrete mathematics and its applications. CRC Press, Boca Raton, 1997.
National Institute of Technology and Standards. Specifications for the Digital Signature Standard (DSS). Federal Information Processing Standards Publication XX, US Department of Commerce, February 1 1993.
R. L. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of ACM 21 (1978), pp 120–126.
P. de Rooij. Efficient Exponentiation Using Precomputation and Vector Addition Chains. In de Santis, editor, Advances in Cryptology-EUROCRYPT’ 94. LNCS 950, pp. 389–399. Springer-Verlag, 1994.
C. P. Schnorr. Efficient Signature Generation by Smart Cards. In Journal of Cryptology 4 (1991), no. 3, pp. 161–174.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cubaleska, B., Rieke, A., Hermann, T. (2000). Improving and Extending the Lim/Lee Exponentiation Algorithm. In: Heys, H., Adams, C. (eds) Selected Areas in Cryptography. SAC 1999. Lecture Notes in Computer Science, vol 1758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46513-8_12
Download citation
DOI: https://doi.org/10.1007/3-540-46513-8_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67185-5
Online ISBN: 978-3-540-46513-3
eBook Packages: Springer Book Archive