This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Complexity and Fast Algorithms for Multiexponentiations
February 2000 (vol. 49 no. 2)
pp. 141-147

Abstract—In this paper, we propose new algorithms for multiple modular exponentiation operations. The major aim of these algorithms is to speed up the performance of some cryptographic protocols based on multiexponentiation. Our new algorithms are based on binary-like complex arithmetic, introduced by Pekmestzi and generalized in this paper.

[1] R.L. Rivest,A. Shamir, and L.A. Adleman,"A Method for Obtaining Digital Signatures and Public Key Cryptosystems," Comm. ACM, vol. 21, pp. 120-126, 1978.
[2] V. McLellan, “Password Security-Crypto in your VAX,” Digital Review, p. 86, Oct. 1986.
[3] T. ElGamal, A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms IEEE Trans. Information Theory, vol. 31, no. 4, pp. 469-472, 1985.
[4] E.F. Brickell and K.S. McCurley, “Interactive Identification and Digital Signatures,” AT&T Technical J., pp. 74-86, 1991.
[5] C.P. Schnorr,“Efficient identification and signatures for smart cards,” Crypto’89, (Lecture Notes in Computer Science), vol. 435, New York: Springer-Verlag, 1990, pp. 239-252.
[6] P. Downey, B. Leony, and P. Sethi, “Computing Sequences with Addition Chains,” SIAM J. Computing, vol. 11, pp. 638-696, 1981.
[7] P.E. Valskii, “On the Lower Bounds of Multiplications in Evaluation of Powers,” Problems of Cybernetics, vol. 2, pp. 73-74, 1959 (in Russian).
[8] A. Yao, “On the Power Evaluation,” SIAM J. Computing, vol. 5, pp. 100-103, 1976.
[9] N. Pippenger, “On the Evaluation of Powers and Monomials,” SIAM J. Computing, vol. 9, pp. 230-250, 1980.
[10] Y. Yacobi, "Exponentiating Faster with Addition Chains," Advances in Cryptology—Eurocrypt '90, Lecture Notes in Computer Science, vol. 473, pp. 222-229. Springer-Verlag, 1991.
[11] O. Kochergin, “The Evaluation of Powers,” Math. Problems of Cybernetics, vol. 26, pp. 76-82, 1995 (in Russian).
[12] D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1998.
[13] J. Jedwab and C.J. Mitchell, Minimum Weight Modified Signed-Digit Representations and Fast Exponentiation Electronics Letters, vol. 25, no. 17, pp. 1171-1172, 1989.
[14] C.N. Zhang, “An Improved Binary Algorithm for RSA,” Computers and Math. with Applications, vol. 25, pp. 15-24, 1993.
[15] V. Dimitrov and T. Cooklev, “Two Algorithms for Modular Exponentiations Using Nonstandard Arithmetics,” IEICE Trans. Fundamentals, vol. E78-A, pp. 82-87, 1995.
[16] C.-Y. Chen, C.-C. Chang, and W.-P. Yang, “Hybrid Method for Modular Exponentiation with Precomputations,” IEE Electronics Letters, vol. 32, no. 6, pp. 540-541, 1996.
[17] G.W. Reitweisner, “Binary Arithmetics,” Advances in Computers, vol. 1, pp. 231-308, 1960.
[18] S. Arno and F.S. Wheeler, Signed Digit Representations of Minimal Hamming Weight IEEE Trans. Computers, vol. 42, no. 8, pp. 1007-1010, Aug. 1993.
[19] K. Koyama and Y. Tsuruoka, “A Signed Binary Window Method for Fast Computing over Elliptic Curves,” IEICE Trans. Fundamentals, vol. E76-A, pp. 55-62, 1993.
[20] E.F. Brickell, “A Fast Modular Multiplication Algorithm with Applications to Two Key Cryptography,” Proc. CRYPTO '82, pp. 450-456, 1982.
[21] F. Morain and J. Olivos, “Speeding Up the Computations on an Elliptic Curve Using Addition-Subtraction Chain,” Theoretical Informatics and Applications, vol. 24, pp. 531-544, 1990.
[22] K. Koyama, U. Maurer, T. Okamoto, and S. Vanstone, “New Public-Key Schemes on Elliptic Curves over the Ring${\bf Z}_{\rm n}$” Proc. CRYPTO '91, pp. 305-311, 1991.
[23] N. Koblitz, A Course in Number Theory and Cryptography, GTM. Springer-Verlag, 1987.
[24] D.M. Gordon, “A Survey of Fast Exponentiation Methods” J. Algorithms, vol. 27, no. 1, pp. 129-146, Apr. 1998.
[25] “NIST: A Proposed Federal Information Processing Standard for Digital Signatures Standard (DSS),” Federal Register, vol. 56, pp. 42,980-42,982, 1991.
[26] E.G. Strauss, “Addition Chains of Vectors,” Am. Math. Monthly, vol. 71, pp. 807-808, 1964.
[27] H. Chabanne, “Factoring of$x^n-1$and Orthogonalization over Finite Fields of Characteristic 2,” Applicable Algebra in Eng., Comm., and Computing, vol. 6, pp. 57-63, 1995.
[28] A. Thiong Ly, “A Deterministic Algorithms for Factorizing Polynomials over Extensions$GF(p^n)$of$GF(p)$,$p$a Small Prime,” J. Information and Optimization Science, vol. 10, pp. 337-344, 1989.
[29] V.D. Blondel and J.N. Tsitsiklis, “When Is a Pair of Matrices Mortal,” Information Processing Letters, vol. 63, pp. 283-286, 1997.
[30] S.M. Yen,C.S. Laih,, and A.K. Lenstra,“Multi-exponentiation,” IEEE Proc. Part E: Computers and Digital Techniques, vol. 141, no. 6, pp. 325-326, 1994.
[31] K. Pekmestzi, “Complex Number Multipliers,” IEE Proc.—Computers and Digital Techniques, vol. 136, pp. 70-75, 1989.
[32] D.E. Knuth, “An Imaginary Number System,” Comm. ACM, vol. 2, pp. 18-23, 1960.
[33] D.L. Dietmeyer, “Conversion from Positive to Negative and Imaginary Radix,” IEEE Trans. Electronic Computers, vol. 12, 1963.
[34] D.A. Pospelov, Fundamentals of Computer Arithmetics. Moscow: Visshaja Shkola, 1970 (in Russian).
[35] J. Duprat, Y. Herreros, and S. Kla, “New Representation of Complex Numbers and Vectors,” Proc. 10th IEEE Symp. Computer Arithmetic, pp. 2-9, 1991.
[36] G.H. Norton, “On the Asymptotic Analysis of the Euclidean Algorithm,” J. Symbolic Computation, vol. 10, pp. 53-58, 1990.
[37] S.-M. Yen and C.-S. Laih, “Improved Digital Signature Suitable for Batch Verification,” IEEE Trans. Computers, vol. 44, no.7, pp. 957-959, 1995.
[38] S.M. Yen and C.S. Laih,“The fast cascade exponentiation algorithm and its applications on cryptography,” Proc. of the AUSCRYPT’92, pp. 10.20-10.24, Dec. 1992.
[39] Y. Tsuruoka and K. Koyama, “Fast Exponentiation Algorithms Based on Batch-Processing and Precomputation,” IEICE Trans. Fundamentals, vol. E80-A, no. 1, pp. 34-39, 1997.
[40] D. Gordon, “Discrete Logarithms in GF(P) Using the Number Field Sieve,” SIAM J. Discrete Math., vol. 6, no. 1, pp. 124-138, 1993.
[41] L. Adleman and J. Demarrais, “A Subexponential Algorithm for Discrete Logarithms over All Finite Fields,” Math. Computation, vol. 61, no. 203, pp. 1-15, 1993.
[42] A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, Fla., 1996, pp. 543-590.

Index Terms:
Modular exponentiation, cryptography, complex arithmetic.
Citation:
Vassil S. Dimitrov, Graham A. Jullien, William C. Miller, "Complexity and Fast Algorithms for Multiexponentiations," IEEE Transactions on Computers, vol. 49, no. 2, pp. 141-147, Feb. 2000, doi:10.1109/12.833110
Usage of this product signifies your acceptance of the Terms of Use.