Abstract
The similarity between fast computations with huge numbers and data compression is investigated. For example, in data-compression, frequent messages are assigned short codes, while in fast computations we store and reuse the results of frequent computations. In compression we sometimes send the difference of consecutive messages, if its usually small (Δ modulation), while in fast computation we compute x n+Δ=x n·x Δ, if x n is already known, and Δ ≪ n.
Chapter PDF
Similar content being viewed by others
4. References
J. Bos, M. Coster: “Addition Chain Heuristics”, Crypto’89.
H. Cohen, and A.K. Lenstra: “Implementation of a New Primality Test”, Math. of Computation, Vol. 48, No. 177, Jan. 1987, pp.103–121.
Downey, Leony, and Sethi: “Computing Sequences With Addition Chains”, SIAM Jour, Comput. 3, (1981), pp.638–696.
P. Erdös: “Remarks on Number Theory III, on Addition Chains”, Acta Arith. VI (1960), pp.77–81.
Graham, Knuth and Patashnik: “Concrete Mathematics, a Foundation for Computer Science”, Addison Wesley, 1988.
Lempel and Ziv: “Compression of Individual Sequences via Variable Rate Coding” IEEE Trans of Inf. Theory, IT-24 No. 5 (September 1978) pp.530–536.
Knuth: “The Art of Computer Programming, Vol. 2, Seminumerical Algorithms”, Addison-Wesley, 1980, pp.441–462.
J.J. Quisquater: (A talk on m-ary exponentiation at the Rump session of Eurocrypt’90)
Schönhage: “A Lower Bound on The Length of Addition Chains”, Theoretical Computer Science Vol. 1 (1975), pp.229–242.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yacobi, Y. (1991). Exponentiating Faster with Addition Chains. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive