论文信息 - An Algorithm for Modular Exponentiation

An Algorithm for Modular Exponentiation

Abstract A practical technique for improving the performance of modular exponentiations (ME) is described. The complexity of the ME algorithm is O ( n log n ) modular multiplications (MMs), where n is the length of the exponent, requiring an O(n2) precomputed look-up table size with very small constant of proportionality. The algorithm uses a double-based number system which we introduce in this paper.

Graham A. Jullien | William C. Miller | Vassil S. Dimitrov

[1] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[2] B. D. Weger,et al. Algorithms for diophantine equations , 1989 .

[3] Joachim von zur Gathen. Processor-Efficient Exponentiation in Finite Fields , 1992, Inf. Process. Lett..

[4] Vassil S. Dimitrov,et al. Two Algorithms for Modular Exponentiation Using Nonstandard Arithmetics , 1995 .

[5] Chin-Chen Chang,et al. Hybrid method for modular exponentiation with precomputation , 1996 .

[6] Peter de Rooij,et al. Efficient Exponentiation using Procomputation and Vector Addition Chains , 1994, EUROCRYPT.

[7] P. L. Montgomery,et al. A survey of modern integer factorization algorithms , 1994 .

[8] Ernest F. Brickell,et al. An Interactive Identification Scheme Based on Discrete Logarithms and Factoring , 1990, EUROCRYPT.

[9] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[10] Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[11] Allan Borodin,et al. The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[12] R. Tijdeman,et al. On the maximal distance between integers composed of small primes , 1974 .