Abstract
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.
Chapter PDF
References
Alia, Giuseppe; Martinelli, Enrico: “A VLSI Modulo m Multiplier”, IEEE Transactions on Computers, Vol. 40, No. 7, p. 873–878, July 1991
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, 1989
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 1991
Downey, P.; Leong, B.; Sethi, R.: “Computing Sequences with Addition Chains”, SIAM Journal on Computing, Vol. 3, No. 3, p. 638–646, August 1981
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, 1990
Hwang, Kai: “Computer Arithmetic: Principles, Architecture, and Design”, John Wiley & Sons, New York, 1979
Knuth, Donald E.: “The Art of Computer Programming, Vol. 2: Seminumerical Algorithms”, Addison-Wesley, Reading, Massachusetts, 1969
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 1990
Lippitsch, P.; Posch, K.C.; Posch, R.: “Multiplication As Parallel As Possible”, Institute for Information Processing Graz, Report 290, October 1990
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 1988
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 1987
Montgomery, P. L.: “Modular Multiplication without Trial Division”, Mathematics of Computation, Vol. 44, No. 170, p. 519–521, April 1985
Moraga, Claudio: “Design of a Modulo p Multiplier”, International Journal on Electronics, Vol. 67, No. 5, p. 819–827, Taylor & Francis, 1989
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 1990
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, 1990
Yao, Andrew: “On the Evaluation of Powers”, SIAM Journal on Computing, Vol. 5, No. 1, pp. 100–103, March 1976
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 1978
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Verlag Berlin Heidelberg
About this paper
Cite this paper
Sauerbrey, J., Dietel, A. (1993). Resource Requirements for the Application of Addition Chains in Modulo Exponentiation. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_15
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive