Resource Requirements for the Application of Addition Chains in Modulo Exponentiation

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 658)


Addition chains or sequences can be used to reduce the amount of multiplications to accomplish an exponentiation at the cost of more memory required. We examine known methods of exponentiations based on addition sequences and derive the parameters determining operation count and number of required registers for storing intermediate results. As a result an improved method is proposed to choose window distributions as a basis for using known addition sequence heuristics.


Window Size Addition Sequence Solid State Circuit Computation Rule Operation Count 
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.


  1. [AliMar91]
    Alia, Giuseppe; Martinelli, Enrico: “A VLSI Modulo m Multiplier”, IEEE Transactions on Computers, Vol. 40, No. 7, p. 873–878, July 1991CrossRefGoogle Scholar
  2. [BosCos89]
    Bos, Jurjen; Coster, Matthijs: “Addition Chain Heuristics”, in Brassard, G. (Ed.): “Advances in Cryptology — Crypto’ 89”, Proceedings (Lecture Notes in Computer Science 435), p. 400–407, Springer, 1989Google Scholar
  3. [CuBoKa91]
    Curiger, A.V.; Bonnenberg, H.; Kaeslin, H.: “Regular VLSI Architectures for Multiplication Modulo (2 exp n + 1)”, IEEE Journal on Solid State Circuits, Vol. 26, No. 7, p. 990–994, July 1991CrossRefGoogle Scholar
  4. [DoLeSe81]
    Downey, P.; Leong, B.; Sethi, R.: “Computing Sequences with Addition Chains”, SIAM Journal on Computing, Vol. 3, No. 3, p. 638–646, August 1981CrossRefMathSciNetGoogle Scholar
  5. [Even90]
    Even, Shimon: “Systolic Modular Multiplication”, in Menezes, A.J.; Vanstone, S.A. (Eds.): “Advances in Cryptology — Crypto’90 Proceedings (Lecture Notes in Computer Science 537), p. 619–624, Springer, 1990Google Scholar
  6. [Hwang79]
    Hwang, Kai: “Computer Arithmetic: Principles, Architecture, and Design”, John Wiley & Sons, New York, 1979Google Scholar
  7. [Knuth69]
    Knuth, Donald E.: “The Art of Computer Programming, Vol. 2: Seminumerical Algorithms”, Addison-Wesley, Reading, Massachusetts, 1969zbMATHGoogle Scholar
  8. [KocHun90]
    Koc, C. K.; Hung, C. Y.: “Multi-Operand Modulo Addition Using Carry Save Adders”, Electronics Letters, Vol. 26, No. 6, p. 361–363, IEE, March 1990CrossRefGoogle Scholar
  9. [LipPos90]
    Lippitsch, P.; Posch, K.C.; Posch, R.: “Multiplication As Parallel As Possible”, Institute for Information Processing Graz, Report 290, October 1990Google Scholar
  10. [LuHaLH88]
    Lu, E.H.; Harn, L.; Lee, J.Y.; Hwang, W.Y.: “A Programmable VLSI Architecture for Computing Multiplication and Polynomial Evaluation Modulo a Positive Integer”, IEEE Journal on Solid State Circuits, Vol. 23, No. 1, p. 204–207, February 1988CrossRefGoogle Scholar
  11. [McCart86]
    McCarthy, D.P.: “Effect of Improved Multiplications Efficiency on Exponentiation Algorithms Derived from Addition Chains”, Mathematics of Computations, Vol. 46, No. 174, p. 603/608, American Mathematical Society, April 1987MathSciNetGoogle Scholar
  12. [Montgo85]
    Montgomery, P. L.: “Modular Multiplication without Trial Division”, Mathematics of Computation, Vol. 44, No. 170, p. 519–521, April 1985zbMATHCrossRefMathSciNetGoogle Scholar
  13. [Moraga89]
    Moraga, Claudio: “Design of a Modulo p Multiplier”, International Journal on Electronics, Vol. 67, No. 5, p. 819–827, Taylor & Francis, 1989 Google Scholar
  14. [Morita90]
    Morita, Hikaru: “A Fast Modular-multiplication Module for Smart Cards”, Proceedings of AUSCRYPT’ 90 (Lecture Notes in Computer Science 453), p. 406–409, Springer, January 1990Google Scholar
  15. [Yacobi90]
    Yacobi, Y.: “Exponentiation Faster with Addition Chains”, in Damgard, I.B. (Ed.): “Advances in Cryptology — EUROCRYPT’ 90”, Proceedings (Lecture Notes in Computer Science 473), p. 222–229, Springer, 1990Google Scholar
  16. [Yao76]
    Yao, Andrew: “On the Evaluation of Powers”, SIAM Journal on Computing, Vol. 5, No. 1, pp. 100–103, March 1976zbMATHCrossRefMathSciNetGoogle Scholar
  17. [ZivLem78]
    Ziv, Jacob; Lempel, Abraham: “Compression of Individuel Sequences via Variable-Rate Coding”, IEEE Transactions on Information Theory, Vol. IT-24, No. 5, pp. 530–536, September 1978CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Verlag Berlin Heidelberg 1993

Authors and Affiliations

  1. 1.Lehrstuhl für DatenverarbeitungTechnische Universität MünchenMünchen 2Germany

Personalised recommendations