Affiliation:
1. Université Cheikh Anta Diop de Dakar , SENEGAL
Abstract
Abstract
The problem of computing xn
effciently, such that x and n are known to be very interesting, specially when n is very large. In order to find effcient methods to solve this problem, addition chains have been much studied, and generalized to addition-subtraction chains. These various chains have been useful in finding effcient exponentiation algorithms. In this paper, we present a new method to recover all existing exponentiation algorithms. It will be applied to design a new fast exponentiation method.
Reference12 articles.
1. [1] BERGERON, F.—BERSTEL, J.—BRLEK, S.—DUBOC, C.: Addition chains using continued fractions, J. Algorithms 10 (1989), no. 3, 403–412.
2. [2] BLEICHENBACHER, D.—FLAMMENKAMP, A.: An effcient algorithm for computing shortest addition chains, SIAM J. Discrete Math. 10 (1997), no. 1, 15–17.
3. [3] DOWNEY, P.—LEONG, B.—SETHI, R.: Computing sequences with addition chains, SIAM J. Comput. 10 (1981), no. 3, 638–646.
4. [4] VOLGER, H.: Some results on addition-subtraction chains, Inform. Process. Lett. 20 (1985), no. 3, 155–160.
5. [5] KNUTH, D. E.: The Art of Computer Programming, Vol. 2. Seminumerical Algorithms. Second edition. Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley Publishing Co., Reading, Mass., 1981.